Abstract
We study noise sensitivity of properties of the largest components \({({\mathcal{C}_j})_{j \geqslant 1}}\) of the random graph \(\mathcal{G}(n,p)\) in its critical window p = (1+λn−1/3)/n. For instance, is the property “\(|{\mathcal{C}_1}|\) exceeds its median size” noise sensitive? Roberts and Şengül (2018) proved that the answer to this is yes if the noise ε is such that ε ≫ n−1/6, and conjectured the correct threshold is ε ≫ n−1/3. 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 ε ≫ n−1/3 the pair of vectors \({n^{ - 2/3}}{(|{\mathcal{C}_j}|)_{j \geqslant 1}}\) before and after the noise converges in distribution to a pair of i.i.d. random variables, whereas for ε ≪ n−1/3 the ℓ2-distance between the two goes to 0 in probability. This confirms the above conjecture: any Boolean function of the vector of rescaled component sizes is sensitive in the former case and stable in the latter.
We also look at the effect of the noise on the metric space \({n^{ - 1/3}}{({\mathcal{C}_j})_{j \geqslant 1}}\). E.g., for ε ≥ n−1/3+o(1), we show that the joint law of the spaces before and after the noise converges to a product measure, implying noise sensitivity of any property seen in the limit, e.g., “the diameter of \({\mathcal{C}_1}\) exceeds its median.”
Similar content being viewed by others
References
L. Addario-Berry, N. Broutin and C. Goldschmidt, The continuum limit of critical random graphs, Probability Theory and Related Fields 152 (2012), 367–406.
L. Addario-Berry, N. Broutin, C. Goldschmidt and G. Miermont, The scaling limit of the minimum spanning tree of the complete graph, Annals of Probability 45 (2017), 3075–3144.
D. Aldous, Brownian excursions, critical random graphs and the multiplicative coalescent, Annals of Probability 25 (1997), 812–854.
I. Benjamini, G. Kalai and O. Schramm, Noise sensitivity of Boolean functions and applications to percolation, Institut des Hautes Études Scientifiques. Publications Mathématiques 90 (1999), 5–43.
S. Bhamidi, N. Broutin, S. Sen and X. Wang, Scaling limits of random graph models at criticality: Universality and the basin of attraction of the Erdős-Rényi random graph, https://arxiv.org/abs/1411.3417.
P. Billingsley, Convergence of Probability Measures, Wiley Series in Probability and Statistics: Probability and Statistics, John Wiley & Sons, New York, 1999.
B. Bollobás, The evolution of random graphs, Transactions of the American Mathematical Society 286 (1984), 257–274.
B. Bollobás, Random Graphs, Cambridge Studies in Advanced Mathematics, Vol. 73, Cambridge University Press, Cambridge, 2001.
C. Garban and J. E. Steif, Noise Sensitivity of Boolean Functions and Percolation, Institute of Mathematical Statistics Textbooks, Vol. 5, Cambridge University Press, New York, 2015.
S. Janson and M. J. Luczak, Susceptibility in subcritical random graphs, Journal of Mathematical Physics 49 (2008), Article no. 125207.
S. Janson, T. Łuczak and A. Rucinski, Random Graphs, Wiley-Interscience Series in Discrete Mathematics and Optimization, Wiley-Interscience, New York, 2000.
E. Lubetzky and J. E. Steif, Strong noise sensitivity and random graphs, Annals of Probability 43 (2015), 3239–3278.
T. Łuczak, Component behavior near the critical point of the random graph process, Random Structures & Algorithms 1 (1990), 287–310.
T. Łuczak, Random trees and random graphs, Random Structures & Algorithms 13 (1998), 485–500.
T. Łuczak, B. Pittel and J. C. Wierman, The structure of a random graph at the point of the phase transition, Transactions of the American Mathematical Society 341 (1994), 721–748.
R. Lyons, Random walks, capacity and percolation on trees, Annals of Probability 20 (1992), 2043–2088.
J. Pitman, Combinatorial Stochastic Processes, Lecture Notes in Mathematics, Vol. 1875, Springer, Berlin, 2006.
M. I. Roberts and B. Şengül, Exceptional times of the critical dynamical Erdős-Rényi graph, The Annals of Applied Probability 28 (2018), 2275–2308.
R. Rossignol, Scaling limit of dynamical percolation on the critical Erdős-Rényi random graph, Annals of Probability 49 (2021), 322–399.
Acknowledgment
E.L. was supported in part by NSF grant DMS-1812095.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Lubetzky, E., Peled, Y. Noise sensitivity of critical random graphs. Isr. J. Math. 252, 187–214 (2022). https://doi.org/10.1007/s11856-022-2354-y
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11856-022-2354-y