Summary
In network theory, a giant component is a connected component of a given random graph that contains a significant fraction of the entire graph's vertices. More precisely, in graphs drawn randomly from a probability distribution over arbitrarily large graphs, a giant component is a connected component whose fraction of the overall number of vertices is bounded away from zero. In sufficiently dense graphs distributed according to the Erdős–Rényi model, a giant component exists with high probability. Giant components are a prominent feature of the Erdős–Rényi model (ER) of random graphs, in which each possible edge connecting pairs of a given set of n vertices is present, independently of the other edges, with probability p. In this model, if for any constant , then with high probability (in the limit as goes to infinity) all connected components of the graph have size O(log n), and there is no giant component. However, for there is with high probability a single giant component, with all other components having size O(log n). For , intermediate between these two possibilities, the number of vertices in the largest component of the graph, is with high probability proportional to . Giant component is also important in percolation theory. When a fraction of nodes, , is removed randomly from an ER network of degree , there exists a critical threshold, . Above there exists a giant component (largest cluster) of size, . fulfills, . For the solution of this equation is , i.e., there is no giant component. At , the distribution of cluster sizes behaves as a power law, ~ which is a feature of phase transition. Alternatively, if one adds randomly selected edges one at a time, starting with an empty graph, then it is not until approximately edges have been added that the graph contains a large component, and soon after that the component becomes giant. More precisely, when t edges have been added, for values of t close to but larger than , the size of the giant component is approximately .
About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.