Giant component

Giant component

In network theory, a giant component is a connected subgraph that contains a majority of the entire graph's nodes. Percolation theory is based on adding nodes and connections to an empty graph until a giant component surfaces.

External links

* [http://expertvoices.nsdl.org/cornell-info204/2008/03/06/the-formation-of-a-giant-component/ The growth of a giant component]
* [http://expertvoices.nsdl.org/cornell-info204/2008/05/01/giant-component-full-development/ The full development of a giant component]


Wikimedia Foundation. 2010.

Игры ⚽ Нужно сделать НИР?

Look at other dictionaries:

  • Component — may refer to: Usage Component may refer to: System components, the constituents of a system Electronic components, the constituents of electronic circuits Component ingredient, the main ingredient in a dish Component video, a type of analog video …   Wikipedia

  • Baby-step giant-step — In group theory, a branch of mathematics, the baby step giant step algorithm is a series of well defined steps to compute the discrete logarithm. The discrete log problem is of fundamental importance to the area of public key cryptography. Many… …   Wikipedia

  • Sexual network — A sexual network is a social network that is defined by the sexual relationships within a set of individuals. tudies and discoveriesLike other forms of social networks, sexual networks can be formally studied using the mathematics of graph theory …   Wikipedia

  • Glossary of graph theory — Graph theory is a growing area in mathematical research, and has a large specialized vocabulary. Some authors use the same word with different meanings. Some authors use different words to mean the same thing. This page attempts to keep up with… …   Wikipedia

  • Erdős–Rényi model — In graph theory, the Erdős Rényi model, named for Paul Erdős and Alfréd Rényi, is either of two models for generating random graphs, including one that sets an edge between each pair of nodes with equal probability, independently of the other… …   Wikipedia

  • Zipf's law — Probability distribution name =Zipf s law type =mass pdf Zipf PMF for N = 10 on a log log scale. The horizontal axis is the index k . (Note that the function is only defined at integer values of k . The connecting lines do not indicate continuity …   Wikipedia

  • Complex network — In the context of network theory, a complex network is a graph (network) with non trivial topological features features that do not occur in simple networks such as lattices or random graphs but often occur in real graphs. The study of complex… …   Wikipedia

  • Multigraph — Pseudograph redirects here. It is not to be confused with Pseudepigraph. This article is about the mathematical concept. For other uses, see Multigraph (disambiguation). A multigraph with multiple edges (red) and several loops (blue). Not all… …   Wikipedia

  • List of mathematics articles (G) — NOTOC G G₂ G delta space G networks Gδ set G structure G test G127 G2 manifold G2 structure Gabor atom Gabor filter Gabor transform Gabor Wigner transform Gabow s algorithm Gabriel graph Gabriel s Horn Gain graph Gain group Galerkin method… …   Wikipedia

  • Multigrafo — Un multigrafo con múltiples aristas (en rojo) y tres bucles (en azul). No todos los autores permiten multigrafos con bucles. Un multigrafo o pseudografo es un grafo que está facultado para tener aristas múltiples; es decir, aristas que relacionan …   Wikipedia Español

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”