Author:
Lubetzky Eyal,Peled Yuval
Publisher
Springer Science and Business Media LLC
Reference19 articles.
1. L. Addario-Berry, N. Broutin and C. Goldschmidt, The continuum limit of critical random graphs, Probability Theory and Related Fields 152 (2012), 367–406.
2. 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.
3. D. Aldous, Brownian excursions, critical random graphs and the multiplicative coalescent, Annals of Probability 25 (1997), 812–854.
4. 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.
5. 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.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献