A Simple Branching Process Approach to the Phase Transition in Gn, p
暂无分享,去创建一个
[1] Y. Peres,et al. Component sizes of the random graph outside the scaling window , 2006, math/0610466.
[2] Béla Bollobás,et al. Handbook of large-scale random networks , 2008 .
[3] Benny Sudakov,et al. The phase transition in random graphs: A simple proof , 2012, Random Struct. Algorithms.
[4] Béla Bollobás,et al. Asymptotic normality of the size of the giant component via a random walk , 2012, J. Comb. Theory, Ser. B.
[5] Nicholas C. Wormald,et al. Counting connected graphs inside-out , 2005, J. Comb. Theory, Ser. B.
[6] A. Rbnyi. ON THE EVOLUTION OF RANDOM GRAPHS , 2001 .
[7] Tomasz Łuczak. Component behavior near the critical point of the random graph process , 1990 .
[8] P. Erdos,et al. On the evolution of random graphs , 1984 .