Optimal Network Membership Estimation under Severe Degree Heterogeneity

Real networks often have severe degree heterogeneity, with maximum, average, and minimum node degrees differing significantly. This paper examines the impact of degree heterogeneity on statistical limits of network data analysis. Introducing the empirical heterogeneity distribution (EHD) under a degree-corrected mixed membership model, we show that the optimal rate of mixed membership estimation is an explicit functional of the EHD. This result confirms that severe degree heterogeneity decelerates the error rate, even when the overall sparsity remains unchanged.

Authors

Institutions

Publication Details

Journal
Journal of the American Statistical Association
Published
2024-08-13
DOI
https://doi.org/10.1080/01621459.2024.2388903
Citations
4
Primary Topic
Complex Network Analysis Techniques
Type
article
Field-Weighted Citation Impact
1.12
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Optimal Network Membership Estimation under Severe Degree Heterogeneity

Zheng Tracy Ke, Jingming Wang
4 citations
Journal of the American Statistical Association
Complex Network Analysis Techniques
1.12
article

Optimal Network Membership Estimation under Severe Degree Heterogeneity

Zheng Tracy Ke, Jingming Wang
article en
4 citations

Abstract

Real networks often have severe degree heterogeneity, with maximum, average, and minimum node degrees differing significantly. This paper examines the impact of degree heterogeneity on statistical limits of network data analysis. Introducing the empirical heterogeneity distribution (EHD) under a degree-corrected mixed membership model, we show that the optimal rate of mixed membership estimation is an explicit functional of the EHD. This result confirms that severe degree heterogeneity decelerates the error rate, even when the overall sparsity remains unchanged.

Journal of the American Statistical AssociationVol. 120(550)
Harvard University (US), University of Virginia (US)
Openalex Percentile: Top 23%
Complex Network Analysis Techniques
1.12
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.