Edge percolation on a random regular graph of low degree
暂无分享,去创建一个
[1] Svante Janson,et al. The Birth of the Giant Component , 1993, Random Struct. Algorithms.
[2] Béla Bollobás,et al. THE ASYMPTOTIC NUMBER OF UNLABELLED REGULAR GRAPHS , 1982 .
[3] Joel H. Spencer,et al. Sudden Emergence of a Giantk-Core in a Random Graph , 1996, J. Comb. Theory, Ser. B.
[4] Edward A. Bender,et al. The Asymptotic Number of Labeled Graphs with Given Degree Sequences , 1978, J. Comb. Theory A.
[5] N. Wormald. Differential Equations for Random Processes and Random Graphs , 1995 .
[6] Joel H. Spencer,et al. Random subgraphs of finite graphs: I. The scaling window under the triangle condition , 2005, Random Struct. Algorithms.
[7] József Balogh,et al. Bootstrap percolation on the random regular graph , 2007, Random Struct. Algorithms.
[8] Remco van der Hofstad,et al. Random subgraphs of finite graphs : II. The lace expansion and the triangle condition , 2003 .
[9] Tomasz Luczak. On the Number of Sparse Connected Graphs , 1990, Random Struct. Algorithms.
[10] R. Durrett. Probability: Theory and Examples , 1993 .
[11] Tomasz Luczak,et al. Component Behavior Near the Critical Point of the Random Graph Process , 1990, Random Struct. Algorithms.
[12] Tomasz Łuczak. Component behavior near the critical point of the random graph process , 1990 .
[13] Alan M. Frieze,et al. Random graphs , 2006, SODA '06.
[14] N. S. Barnett,et al. Private communication , 1969 .
[15] H. Poincaré,et al. Percolation ? , 1982 .
[16] Béla Bollobás,et al. A Probabilistic Proof of an Asymptotic Formula for the Number of Labelled Regular Graphs , 1980, Eur. J. Comb..
[17] B. Pittel,et al. Maximum matchings in sparse random graphs: Karp-Sipser revisited , 1998 .
[18] R. Durrett. Some general results concerning the critical exponents of percolation processes , 1985 .
[19] R. Durrett. Random Graph Dynamics: References , 2006 .
[20] B. Pittel,et al. The structure of a random graph at the point of the phase transition , 1994 .
[21] Tomasz Łuczak,et al. On the number of sparse connected graphs , 1990 .
[22] Bruce A. Reed,et al. The Size of the Giant Component of a Random Graph with a Given Degree Sequence , 1998, Combinatorics, Probability and Computing.
[23] Boris G. Pittel,et al. On a random graph with immigrating vertices: Emergence of the giant component , 2000, Random Struct. Algorithms.
[24] P. Erdos,et al. On the evolution of random graphs , 1984 .
[25] Boris G. Pittel,et al. On the Largest Component of the Random Graph at a Nearcritical Stage , 2001, J. Comb. Theory, Ser. B.
[26] Bruce A. Reed,et al. A Critical Point for Random Graphs with a Given Degree Sequence , 1995, Random Struct. Algorithms.
[27] J. Moon. Counting labelled trees , 1970 .
[28] Noga Alon,et al. Percolation on finite graphs and isoperimetric inequalities , 2004 .