Phase Transition

Erdős and Rényi (1960) showed that for many monotone-increasing properties of random graphs, graphs of a size slightly less than a certain threshold are very unlikely to have the property, whereas graphs with a few more graph edges are almost certain to have it. This is known as a phase transition (Janson et al. 2000, p. 103).

The concept also arises in percolation theory.

See also

Percolation Threshold, Random Graph

Explore with Wolfram|Alpha


Erdős, P. and Rényi, A. "On the Evolution of Random Graphs." Publ. Math. Inst. Hungar. Acad. Sci. 5, 17-61, 1960.Janson, S.; Łuczak, T.; and Ruciński, A. "The Phase Transition." Ch. 5 in Random Graphs. New York: Wiley, pp. 103-138, 2000.

Referenced on Wolfram|Alpha

Phase Transition

Cite this as:

Weisstein, Eric W. "Phase Transition." From MathWorld--A Wolfram Web Resource.

Subject classifications