Jump to content

Random graph

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Populus (talk | contribs) at 20:43, 6 November 2003 (stubby page to be filled in later). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

In mathematics, a random graph is a graph that is generated by some random process. The theory of random graphs lies at the intersection between graph theory and probability theory, and studies the properties of typical random graphs.

Random graph models

(G(n,p), G(n,M), graph process G~, etc.)

Properties of random graphs

(tell story about evolution of G~)

History

(Erdos and Renyi, Bollobas)?

References

(put in some standard textbooks)

This is a stub.