Critical point (network science)
In network science, a critical point is a value of average degree, which separates random networks that have a giant component from those that do not (i.e. it separates a network in a subcritical regime from one in a supercritical regime).[1] Considering a random network with an average degree [math]\displaystyle{ \langle k\rangle }[/math] the critical point is [math]\displaystyle{ \langle k\rangle = 1 }[/math]
where the average degree is defined by the fraction of the number of edges ([math]\displaystyle{ e }[/math]) and nodes ([math]\displaystyle{ N }[/math]) in the network, that is [math]\displaystyle{ \langle k\rangle =\frac{2e}{N} }[/math].[2]
Subcritical regime
In a subcritical regime the network has no giant component, only small clusters. In the special case of [math]\displaystyle{ \langle k\rangle =0 }[/math] the network is not connected at all. A random network is in a subcritical regime until the average degree exceeds the critical point, that is the network is in a subcritical regime as long as
[math]\displaystyle{ \langle k\rangle \lt 1 }[/math].[3]
Supercritical regime
In a supercritical regime, in contrary to the subcritical regime the network has a giant component. In the special case of [math]\displaystyle{ \langle k\rangle =N-1 }[/math] the network is complete (see complete graph). A random network is in a supercritical regime if the average degree exceeds the critical point, that is if
[math]\displaystyle{ \langle k\rangle \gt 1 }[/math].[3]
Example on different regimes
Consider a speed dating event as an example, with the participants as the nodes of the network. At the beginning of the event, people do not know anyone else. In this case the network is in a subcritical regime, that is, there is no giant component in the network (even if there are a couple of people, who know each other). After the first round of dates, everyone knows exactly one other person. There is still no giant component in the network, the average degree is [math]\displaystyle{ \langle k\rangle = 1 }[/math], that is, everyone knows one other person on average, meaning that the network is at the critical point. After the second round, the average degree of the network exceeds the critical point, and the giant component is present. In this specific case, the average degree is [math]\displaystyle{ \langle k\rangle = 2 }[/math]. The network is in a supercritical regime.
See also
References
- ↑ Barabási, Albert-László. "Ch. 3". Network Science. http://barabasi.com/networksciencebook/.
- ↑ Puhalskii, Anatolii A. (2005). "Stochastic Processes in Random Graphs". The Annals of Probability 33: 337–412. doi:10.1214/009117904000000784.
- ↑ 3.0 3.1 van der Hofstad, Remco. "Ch. 4.3". Random Graphs and Complex Networks. http://www.win.tue.nl/~rhofstad/NotesRGCN2011.pdf.
 |  |
