REVIEW 4 cited by
Testing for Global Network Structure Using Small Subgraph Statistics
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
read the original abstract
We study the problem of testing for community structure in networks using relations between the observed frequencies of small subgraphs. We propose a simple test for the existence of communities based only on the frequencies of three-node subgraphs. The test statistic is shown to be asymptotically normal under a null assumption of no community structure, and to have power approaching one under a composite alternative hypothesis of a degree-corrected stochastic block model. We also derive a version of the test that applies to multivariate Gaussian data. Our approach achieves near-optimal detection rates for the presence of community structure, in regimes where the signal-to-noise is too weak to explicitly estimate the communities themselves, using existing computationally efficient algorithms. We demonstrate how the method can be effective for detecting structure in social networks, citation networks for scientific articles, and correlations of stock returns between companies on the S\&P 500.
Forward citations
Cited by 4 Pith papers
-
Resolution of the Detection Threshold Conjecture for Random Geometric Graphs in the $d>n$ Regime
Proves detection of RGG vs. ER is impossible for d ≫ (n h(p))^3 and d ≥ (1+ε)n, resolving the detection threshold conjecture in the regime p ≳ n^{-2/3}/log n.
-
Bayesian Predictive Synthesis for Dynamic Networks: Forecasting and Identifying Structural Mechanisms
Dynamic Bayesian predictive synthesis combines forecasts from multiple network mechanisms with time-varying weights for adaptive edge prediction and mechanism identification in dynamic networks.
-
Counting Cycles with AI: Counting Cycles with AI: Computationally Efficient Equivalent Forms with Applications
Cycle count statistics C_m can be expressed as linear combinations of low-complexity SEA and IFS terms, computed by Möbius inversion and a graph-pruning algorithm that a guided LLM helped implement.
-
Measuring the Clustering Strength of a Network via the Normalized Clustering Coefficient
The normalized clustering coefficient converges to a quantity that depends only on the community in-out ratio under the degree-corrected block model, enabling inference of community strength without community detection.
Discussion (0). Continue with ORCID to comment.