Giant Component in Random Graph

A random graph is a graph with nodes where the probability of finding an edge between two nodes is . When tends to a constant (as grows), the graph will almost surely contain a "giant" connected component, absorbing a considerably large fraction of the nodes. This phenomenon is often mentioned as an example of emergence in random graph behavior.

THINGS TO TRY

SNAPSHOTS

  • [Snapshot]
  • [Snapshot]
  • [Snapshot]

DETAILS

The emergence of a giant connected component plays a crucial role in the theory of autocatalytic chemical networks, which attempts to explain the appearance of life in the universe ("abiogenesis") as a self-organization phenomenon occurring within chemical systems. The idea was first proposed by Stuart Kauffman in 1995.
See the actual graph growth process at Giant Component.
S. Kauffman, At Home in the Universe: The Search for the Laws of Self-Organization and Complexity, Oxford: Oxford Univ. Press, 1995.
    • Share:

Embed Interactive Demonstration New!

Just copy and paste this snippet of JavaScript code into your website or blog to put the live Demonstration on your site. More details »

Files require Wolfram CDF Player or Mathematica.