Phase transition phenomena in random discrete structures

Abstract The paper surveys most characteristic features of the phase transition phenomenon in various models of random discrete structures.

[1]  V. E. Stepanov.  On Some Features of the Structure of a Random Graph Near a Critical Point , 1988 .

[2]  Tomasz Łuczak.  Component behavior near the critical point of the random graph process , 1990 .

[3]  Tomasz Luczak,et al.  Cycles in a Random Graph Near the Critical Point , 1991, Random Struct. Algorithms.

[4]  Joel E. Cohen,et al.  Giant components in three-parameter random directed graphs , 1992, Advances in Applied Probability.

[5]  V. E. Stepanov.  Phase Transitions in Random Graphs , 1970 .

[6]  Jeanette P. Schmidt,et al.  Component structure in the evolution of random hypergraphs , 1985, Comb..

[7]  Svante Janson,et al.  The Birth of the Giant Component , 1993, Random Struct. Algorithms.

[8]  B. Pittel,et al.  The structure of a random graph at the point of the phase transition , 1994 .

[9]  Yoshiharu Kohayakawa,et al.  The Evaluation of Random Subgraphs of the Cube , 1992, Random Struct. Algorithms.

[10]  V. F. Kolchin.  On the Behavior of a Random Graph Near a Critical Point , 1987 .

[11]  Boris G. Pittel,et al.  On Tree Census and the Giant Component in Sparse Random Graphs , 1990, Random Struct. Algorithms.

[12]  Yu. L. Pavlov.  The Asymptotic Distribution of Maximum Tree Size in a Random Forest , 1978 .

[13]  Tomasz Łuczak,et al.  Size and connectivity of the k-core of a random graph , 1991 .

[14]  Tomasz Luczak,et al.  Cycles in a Uniform Graph Process , 1992, Combinatorics, Probability and Computing.

[15]  Richard M. Karp,et al.  The Transitive Closure of a Random Digraph , 1990, Random Struct. Algorithms.

[16]  E. M. Wright,et al.  The Evolution of Unlabelled Graphs , 1976 .

[17]  János Komlós,et al.  Largest random component of ak-cube , 1982, Comb..

[18]  B. Pittel.  A random graph with a subcritical number of edges , 1988 .

[19]  V. E. Stepanov.  On the Probability of Connectedness of a Random Graph $\mathcal{G}_m (t)$ , 1970 .

[20]  Yu. L. Pavlov.  A case of limit distribution of the maximal volume on a tree in a random forest , 1979 .

[21]  Boris G. Pittel,et al.  Components of Random Forests , 1992, Combinatorics, Probability and Computing.

[22]  Tomasz Łuczak.  How to deal with unlabeled Random graphs , 1991 .

[23]  Saharon Shelah,et al.  Can You Feel the Double Jump? , 1994, Random Struct. Algorithms.

[24]  David Aldous,et al.  A Random Tree Model Associated with Random Graphs , 1990, Random Struct. Algorithms.

[25]  B. Bollobás.  The evolution of random graphs , 1984 .

[26]  Tomasz Luczak,et al.  The phase transition in the evolution of random digraphs , 1990, J. Graph Theory.