Fetching the paper…
Reading the bibliography…
It is well-known that the $G(n,p)$ model of random graphs undergoes a dramatic change around $p=\frac 1n$.
Random labelled trees and their branching networks
G.R. Grimmett · 1980
Earlier work this paper cites.
Methods of modern mathematical physics: Functional analysis
Michael Reed and Barry Simon · 1980
Earlier work this paper cites.
The spectrum of an infinite graph
Bojan Mohar · 1982
Earlier work this paper cites.
Enumeration of ℚ \mathbb{Q} -acyclic simplicial complexes
Gil Kalai · 1983
Earlier work this paper cites.
On the method of bounded differences
Colin McDiarmid · 1989
Earlier work this paper cites.
The birth of the giant component
Svante Janson, Donald E Knuth, Tomasz Łuczak, and Boris Pittel · 1993
Earlier work this paper cites.
The ζ ( 2 ) \zeta(2) limit in the random assignment problem
David Aldous · 2001
Earlier work this paper cites.
The objective method: Probabilistic combinatorial optimization and local weak convergence
David Aldous and Michael Steele · 2004
Earlier work this paper cites.
Asymptotic enumeration of spanning trees
Russell Lyons · 2005
Earlier work this paper cites.
Cores in random hypergraphs and boolean formulas
Michael Molloy · 2005
Earlier work this paper cites.
Homological connectivity of random 2-complexes
Nathan Linial and Roy Meshulam · 2006
Cited alongside, same era.
Processes on unimodular random networks
David Aldous and Russell Lyons · 2007
Cited alongside, same era.
Poisson cloning model for random graphs
Jeong Han Kim · 2007
Cited alongside, same era.
Homological connectivity of random k-dimensional complexes
Roy Meshulam and Nathan Wallach · 2009
Cited alongside, same era.
Resolvent of large random graphs
Charles Bordenave and Marc Lelarge · 2010
Cited alongside, same era.
Gibbs measures and phase transitions on sparse random graphs
Amir Dembo and Andrea Montanari · 2010
Cited alongside, same era.
Tight thresholds for cuckoo hashing via xorsat
Random graphs
Svante Janson, Tomasz Luczak, and Andrzej Rucinski · 2011
Later among the works it cites.
Some implications of local weak convergence for large random graphs
Justin Salez · 2011
Later among the works it cites.
A new approach to the orientation of random hypergraphs
Marc Lelarge · 2012
Later among the works it cites.
Collapsibility and vanishing of top homology in random simplicial complexes
Lior Aronshtam, Nathan Linial, Tomasz Łuczak, and Roy Meshulam · 2013
Later among the works it cites.
The threshold for integer homology in random d-complexes
Christopher Hoffman, Matthew Kahle, and Elliot Paquette · 2013
Later among the works it cites.
Extremal problems on shadows and hypercuts in simplicial complexes
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Martin Dietzfelbinger, Andreas Goerdt, Michael Mitzenmacher, Andrea Montanari, Rasmus Pagh, and Michael Rink · 2010
Cited alongside, same era.
The fundamental group of random 2-complexes
Eric Babson, Christopher Hoffman, and Matthew Kahle · 2011
Cited alongside, same era.
Recurrence of distributional limits of finite planar graphs
Itai Benjamini and Oded Schramm · 2011
Cited alongside, same era.
The rank of diluted random graphs
Charles Bordenave, Marc Lelarge, and Justin Salez · 2011
Cited alongside, same era.
Nathan Linial, Ilan Newman, Yuval Peled, and Yuri Rabinovich · 2014
Closest in time.
When does the top homology of a random simplicial complex vanish?
Lior Aronshtam and Nathan Linial · 2015
Closest in time.
The threshold for d d -collapsibility in random complexes
Lior Aronshtam and Nathan Linial · 2016
Closest in time.
The satisfiability threshold for k-xorsat
Boris Pittel and Gregory Sorkin · 2016
Closest in time.