For correlated Erdős-Rényi graphs with constant average degree, strong detection is information-theoretically possible if and only if the subsampling probability s exceeds min{1/√λ, √α}, with α≈0.338.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.PR 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Strong Detection Threshold for Correlated Erd\H{o}s-R\'enyi Graphs with Constant Average Degree
For correlated Erdős-Rényi graphs with constant average degree, strong detection is information-theoretically possible if and only if the subsampling probability s exceeds min{1/√λ, √α}, with α≈0.338.