Giant component · Lablypedia

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 component in Erdős–Rényi model

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 $p \leq \frac{1 - ϵ}{n}$ for any constant $ϵ > 0$ , then with high probability (in the limit as $n$ goes to infinity) all connected components of the graph have size O(log n), and there is no giant component. However, for $p \geq \frac{1 + ϵ}{n}$ there is with high probability a single giant component, with all other components having size O(log n). For $p = p_{c} = \frac{1}{n}$ , intermediate between these two possibilities, the number of vertices in the largest component of the graph, $P_{inf}$ is with high probability proportional to $n^{2 / 3}$ .

Giant component is also important in percolation theory. When a fraction of nodes, $q = 1 - p$ , is removed randomly from an ER network of degree $⟨ k ⟩$ , there exists a critical threshold, $p_{c} = \frac{1}{⟨ k ⟩}$ . Above $p_{c}$ there exists a giant component (largest cluster) of size, $P_{inf}$ . $P_{inf}$ fulfills, $P_{inf} = p (1 - \exp (- ⟨ k ⟩ P_{inf}))$ . For $p < p_{c}$ the solution of this equation is $P_{inf} = 0$ , i.e., there is no giant component.

At $p_{c}$ , the distribution of cluster sizes behaves as a power law, $n (s)$ ~ $s^{- 5 / 2}$ 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 $n / 2$ 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 $n / 2$ , the size of the giant component is approximately $4 t - 2 n$ . However, according to the coupon collector's problem, $Θ (n \log n)$ edges are needed in order to have high probability that the whole random graph is connected.

2 more chapters are free with a Lably account.

Graphs with arbitrary degree distributions

A similar sharp threshold between parameters that lead to graphs with all components small and parameters that lead to a giant component also occurs in tree-like random graphs with non-uniform degree distributions $P (k)$ . The degree distribution does not define a graph uniquely. However, under the assumption that in all respects other than their degree distribution, the graphs are treated as entirely random, many results on finite/infinite-component sizes are known. In this model, the existence of the giant component depends only on the first two (mixed) moments of the degree distribution. Let a randomly chosen vertex have degree $k$ , then the giant component exists if and only if $⟨ k^{2} ⟩ - 2 ⟨ k ⟩ > 0.$ This is known as the Molloy and Reed condition. The first moment of $P (k)$ is the mean degree of the network. In general, the $n$ -th moment is defined as $⟨ k^{n} ⟩ = E [k^{n}] = \sum k^{n} P (k)$ .

When there is no giant component, the expected size of the small component can also be determined by the first and second moments and it is $1 + \frac{⟨ k ⟩^{2}}{2 ⟨ k ⟩ + ⟨ k^{2} ⟩} .$ However, when there is a giant component, the size of the giant component is more tricky to evaluate.

Criteria for giant component existence in directed and undirected configuration graphs

Similar expressions are also valid for directed graphs, in which case the degree distribution is two-dimensional. There are three types of connected components in directed graphs. For a randomly chosen vertex:

out-component is a set of vertices that can be reached by recursively following all out-edges forward;
in-component is a set of vertices that can be reached by recursively following all in-edges backward;
weak component is a set of vertices that can be reached by recursively following all edges regardless of their direction.

Let a randomly chosen vertex has $k_{in}$ in-edges and $k_{out}$ out edges. By definition, the average number of in- and out-edges coincides so that $c = E [k_{in}] = E [k_{out}]$ . If $G_{0} (x) = \sum_{k} P (k) x^{k}$ is the generating function of the degree distribution $P (k)$ for an undirected network, then $G_{1} (x)$ can be defined as $G_{1} (x) = \sum_{k} \frac{k}{⟨ k ⟩} P (k) x^{k - 1}$ . For directed networks, generating function assigned to the joint probability distribution $P (k_{i n}, k_{o u t})$ can be written with two valuables $x$ and $y$ as: $G (x, y) = \sum_{k_{i n}, k_{o u t}} P (k_{i n}, k_{o u t}) x^{k_{i n}} y^{k_{o u t}}$ , then one can define $g (x) = \frac{1}{c} \frac{\partial G}{\partial x} |_{y = 1}$ and $f (y) = \frac{1}{c} \frac{\partial G}{\partial y} |_{x = 1}$ . The criteria for giant component existence in directed and undirected random graphs are given in the table below:

Giant component in Erdős–Rényi model

Graphs with arbitrary degree distributions

Criteria for giant component existence in directed and undirected configuration graphs

More in Discrete mathematics