Fetching the paper…
Reading the bibliography…
In this paper we study the component structure of random graphs with independence between the edges.
P. Erdős and A. Rényi, On a problem in the theory of graphs, Magyar Tud. Akad. Mat. Kutató Int. Közl
1962
Earlier work this paper cites.
A. Thomason, Pseudo-random graphs, in Proceedings of Random Graphs
1987
Earlier work this paper cites.
1987
Earlier work this paper cites.
A. Lubotzky, R. Phillips and P. Sarnak, Ramanujan graphs, Combinatorica
1988
Earlier work this paper cites.
F.R.K. Chung, Diameters and eigenvalues, J. Amer. Math. Soc
1989
Earlier work this paper cites.
F.R.K. Chung, R.L. Graham and R.M. Wilson, Quasi-random graphs, Combinatorica
1989
Earlier work this paper cites.
C. McDiarmid, On the method of bounded differences, in Surveys in combinatorics, 1989
1989
Earlier work this paper cites.
N. Alon, A note on network reliability, in Discrete probability and algorithms (Minneapolis, MN, 1993) , IMA Vol. Math. Appl., 72, Springer, New York, 1995, pp. 11–14
1995
Earlier work this paper cites.
M. Talagrand, Concentration of measure and isoperimetric inequalities in product spaces, Inst. Hautes Études Sci. Publ. Math
1995
Cited alongside, same era.
N. O’Connell, Some large deviation results for sparse random graphs, Probab. Theory Related Fields
1998
Cited alongside, same era.
A. Frieze and R. Kannan, Quick approximation to matrices and applications, Combinatorica
1999
Cited alongside, same era.
S. Janson, T. Łuczak and A. Ruciński, Random Graphs . Wiley, New York, 2000
2000
Cited alongside, same era.
M.J. Luczak and C. McDiarmid, Bisecting sparse random graphs, Random Structures and Algorithms
2001
Cited alongside, same era.
F. Chung and R. Graham, Sparse quasi-random graphs, Combinatorica
2002
B. Bollobás, S. Janson and O. Riordan, The phase transition in inhomogeneous random graphs, Random Structures and Algorithms
2007
Later among the works it cites.
C. Borgs, J. T. Chayes, L. Lovász, V. T. Sós and K. Vesztergombi, Convergent sequences of dense graphs I: Subgraph frequencies, metric properties and testing, Advances in Math
2008
Later among the works it cites.
P. Diaconis and S. Janson, Graph limits and exchangeable random graphs, Rendiconti di Matematica
2008
Later among the works it cites.
B. Bollobás and O. Riordan, Metrics for sparse graphs, in Surveys in Combinatorics 2009
2009
Closest in time.
S. Janson, Standard representation of multivariate functions on a general probability space, Electron. Commun. Probab
2009
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
L. Lovász and B. Szegedy, Limits of dense graph sequences, J. Combin. Theory B
2006
Cited alongside, same era.
M. Biskup, L. Chayes and S.A. Smith, Large-deviations/thermodynamic approach to percolation on the complete graph, Random Structures Algorithms
2007
Cited alongside, same era.
Cited in the paper.
Cited in the paper.
B. Bollobás, C. Borgs, J. Chayes and O. Riordan, Percolation on dense graph sequences, Annals of Probability
2010
Closest in time.
S. Janson, Asymptotic equivalence and contiguity of some random graphs, Random Structures and Algorithms
2010
Closest in time.