paper-with-me

Papers

Adjusted chi-square test for degree-corrected block models

2020-12-30 · Linfan Zhang, Arash A. Amini

We propose a goodness-of-fit test for degree-corrected stochastic block models (DCSBM). The test is based on an adjusted chi-square statistic for measuring equality of means among groups of $n$ multinomial distributions with $d_1,\dots,d_n$ observations. In the context of network models, the number of multinomials, $n$, grows much faster than the number of observations, $d_i$, corresponding to the degree of node $i$, hence the setting deviates from classical asymptotics. We show that a simple adjustment allows the statistic to converge in distribution, under null, as long as the harmonic mean of $\{d_i\}$ grows to infinity. When applied sequentially, the test can also be used to determine the number of communities. The test operates on a compressed version of the adjacency matrix, conditional on the degrees, and as a result is highly scalable to large sparse networks. We incorporate a novel idea of compressing the rows based on a $(K+1)$-community assignment when testing for $K$ communities. This approach increases the power in sequential applications without sacrificing computational efficiency, and we prove its consistency in recovering the number of communities. Since the test statistic does not rely on a specific alternative, its utility goes beyond sequential testing and can be used to simultaneously test against a wide range of alternatives outside the DCSBM family. In particular, we prove that the test is consistent against a general family of latent-variable network models with community structure.

📄 PDF Abstract BibTeX arXiv:2012.15047

Code (1)

linfanz/nac-test 공식 구현

Tasks

Computational Efficiency

Similar Papers 제목 키워드 기반

Hypothesis Testing for Equality of Latent Positions in Random Graphs

2021-05-23 · Xinjie Du, Minh Tang

We consider the hypothesis testing problem that two vertices $i$ and $j$ of a generalized random dot product graph have the same latent positions, possibly up to scaling. Special cases of this hypothesis test include tes…

Model SelectionStochastic Block Model

Sparse Popularity Adjusted Stochastic Block Model

2019-10-03 · Majid Noroozi, Marianna Pensky, Ramchandra Rimal

In the present paper we study a sparse stochastic network enabled with a block structure. The popular Stochastic Block Model (SBM) and the Degree Corrected Block Model (DCBM) address sparsity by placing an upper bound on…

modelStochastic Block Model

The Hierarchy of Block Models

2020-02-07 · Majid Noroozi, Marianna Pensky

There exist various types of network block models such as the Stochastic Block Model (SBM), the Degree Corrected Block Model (DCBM), and the Popularity Adjusted Block Model (PABM). While this leads to a variety of choice…

ClusteringStochastic Block Model

Targeted sampling from massive block model graphs with personalized PageRank

2019-10-04 · Fan Chen, Yini Zhang, Karl Rohe

The paper provides statistical theory and intuition for personalized PageRank (called "PPR"): a popular technique that samples a small community from a massive network. We study a setting where the entire network is expe…

ClusteringStochastic Block Model

Adjusted least squares fitting of algebraic hypersurfaces

2014-12-06 · Konstantin Usevich, Ivan Markovsky

We consider the problem of fitting a set of points in Euclidean space by an algebraic hypersurface. We assume that points on a true hypersurface, described by a polynomial equation, are corrupted by zero mean independent…