Noise sensitivity of critical random graphs
Eyal Lubetzky, Yuval Peled

TL;DR
This paper investigates the noise sensitivity of the largest components in critical Erdős–Rényi random graphs, confirming the conjectured threshold at 1/3 for the transition from stability to sensitivity of component properties.
Contribution
It proves the conjectured noise sensitivity threshold at 1/3, establishing the behavior of component sizes under noise in the critical window.
Findings
For 1/30, the component size vectors become asymptotically independent after noise.
For 1/30, the 2-distance between original and noisy vectors vanishes.
Noise sensitivity occurs for properties of the rescaled component space when 1/30 noise is applied.
Abstract
We study noise sensitivity of properties of the largest components of the random graph in its critical window . For instance, is the property " exceeds its median size" noise sensitive? Roberts and \c{S}eng\"{u}l (2018) proved that the answer to this is yes if the noise is such that , and conjectured the correct threshold is . That is, the threshold for sensitivity should coincide with the critical window---as shown for the existence of long cycles by the first author and Steif (2015). We prove that for the pair of vectors before and after the noise converges in distribution to a pair of i.i.d. random variables, whereas for the -distance between the two goes to…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsStochastic processes and statistical mechanics · Topological and Geometric Data Analysis · Geometry and complex manifolds
