Detection thresholds for the $\beta$-model on sparse graphs
Authors:
- Rajarshi MukherjeeRMRajarshi Mukherjee
- Sumit MukherjeeSMSumit Mukherjee
- Subhabrata SenSSSubhabrata Sen
- 1 June 2018
- journal article
- research article
- Published by Institute of Mathematical Statistics in The Annals of Statistics
- Vol. 46 (3) , 1288-1317
Abstract
In this paper, we study sharp thresholds for detecting sparse signals in $\beta$-models for potentially sparse random graphs. The results demonstrate interesting interplay between graph sparsity, signal sparsity and signal strength. In regimes of moderately dense signals, irrespective of graph sparsity, the detection thresholds mirror corresponding results in independent Gaussian sequence problems. For sparser signals, extreme graph sparsity implies that all tests are asymptotically powerless, irrespective of the signal strength. On the other hand, sharp detection thresholds are obtained, up to matching constants, on denser graphs. The phase transitions mentioned above are sharp. As a crucial ingredient, we study a version of the higher criticism test which is provably sharp up to optimal constants in the regime of sparse signals. The theoretical results are further verified by numerical simulations.Keywords
All Related Versions
This publication has 32 references indexed in Scilit:
- Graver basis for an undirected graph and its application to testing the beta model of random graphsAnnals of the Institute of Statistical Mathematics, 2012
- The method of moments and degree distributions for network modelsThe Annals of Statistics, 2011
- On combinatorial testing problemsThe Annals of Statistics, 2010
- Innovated higher criticism for detecting sparse signals in correlated noiseThe Annals of Statistics, 2010
- Detection boundary in sparse regressionElectronic Journal of Statistics, 2010
- Searching for a trail of evidence in a mazeThe Annals of Statistics, 2008
- An introduction to exponential random graph (p*) models for social networksSocial Networks, 2007
- Advances in exponential random graph (p*) models applied to a large social networkSocial Networks, 2007
- Higher criticism for detecting sparse heterogeneous mixturesThe Annals of Statistics, 2004
- Categorical Data Analysis of Single Sociometric RelationsSociological Methodology, 1981