In the study of graphs and networks, the degree of a node in a network is the number of connections it has to other nodes and the degree distribution is the probability distribution of these degrees over the whole network.
Definition
The degree of a node in a network (sometimes referred to incorrectly as the connectivity) is the number of connections or edges the node has to other nodes. If a network is directed, meaning that edges point in one direction from one node to another node, then nodes have two different degrees, the in-degree, which is the number of incoming edges, and the out-degree, which is the number of outgoing edges.
The degree distribution P(k) of a network is then defined to be the fraction of nodes in the network with degree k. Thus if there are n nodes in total in a network and nk of them have degree k, we have P(k) = nk/n.
The same information is also sometimes presented in the form of a cumulative degree distribution, the fraction of nodes with degree smaller than k, or even the complementary cumulative degree distribution, the fraction of nodes with degree greater than or equal to k (1 - C) if one considers C as the cumulative degree distribution; i.e. the complement of C.
Observed degree distributions
The degree distribution is very important in studying both real networks, such as the Internet and social networks, and theoretical networks. The simplest network model, for example, the (Erdős–Rényi model) random graph, in which each of n nodes is independently connected (or not) with probability p (or 1 − p), has a binomial distribution of degrees k:
\( P(k)={n-1 \choose k}p^{k}(1-p)^{{n-1-k}}, \)
(or Poisson in the limit of large n, if the average degree \( {\displaystyle \langle k\rangle =p(n-1)} \) is held fixed). Most networks in the real world, however, have degree distributions very different from this. Most are highly right-skewed, meaning that a large majority of nodes have low degree but a small number, known as "hubs", have high degree. Some networks, notably the Internet, the world wide web, and some social networks were argued to have degree distributions that approximately follow a power law: \( {\displaystyle P(k)\sim k^{-\gamma }} \), where γ is a constant. Such networks are called scale-free networks and have attracted particular attention for their structural and dynamical properties.[1][2][3][4] However, recently, there have been some researches based on real-world data sets claiming despite the fact that most of the observed networks have fat-tailed degree distributions, they deviate from being scale-free.[5]
Excess degree distribution
Excess degree distribution is the probability distribution, for a node reached by following an edge, of the number of other edges attached to that node.[6] In other words, it is the distribution of outgoing links from a node reached by following a link.
Suppose a network has a degree distribution \( {\displaystyle P(k)} \), by selecting one node (randomly or not) and going to one of its neighbors (assuming to have one neighbor at least), then the probability of that node to have \( {\displaystyle k} \) neighbors is not given by \( {\displaystyle P(k)} \). The reason is that, whenever some node is selected in a heterogeneous network, it is more probable to reach the hobs by following one of the existing neighbors of that node. The true probability of such nodes to have degree \( {\displaystyle k} \) is \( {\displaystyle q(k)} \) which is called the excess degree of that node. In the configuration model, which correlations between the nodes have been ignored and every node is assumed to be connected to any other nodes in the network with the same probability, the excess degree distribution can be found as:[6]
\( {\displaystyle q(k)={\frac {k+1}{\langle k\rangle }}P(k+1),} \)
where \( {\displaystyle {\langle k\rangle }} \) is the mean-degree (average degree) of the model. It follows to that fact that the average degree of the neighbor of any node is greater than the average degree of that node. In social networks, it mean that your friends, on average, have more friends than you. This is famous as the friendship paradox. It can be shown that a network can have a giant component, if its average excess degree is larger than one:
\( {\displaystyle \sum _{k}kq(k)>1\Rightarrow {\langle k^{2}\rangle }-2{\langle k\rangle }>0} \)
Bear in mind that the last two equations are just for the configuration model and to derive the excess degree distribution of a real-word network, we should also add degree correlations into account.[6]
The Generating Functions Method
Generating functions can be used to calculate different properties of random networks. Given the degree distribution and the excess degree distribution of some network, \( {\displaystyle P(k)} \) and \( {\displaystyle q(k)} \) respectively, it is possible to write two power series in the following forms:
\( {\displaystyle G_{0}(x)=\textstyle \sum _{k}\displaystyle P(k)x^{k}} \) and \( {\displaystyle G_{1}(x)=\textstyle \sum _{k}\displaystyle q(k)x^{k}=\textstyle \sum _{k}\displaystyle {\frac {k}{\langle k\rangle }}P(k)x^{k-1}} \)
\( {\displaystyle G_{1}(x)} \) can also be obtained from derivatives of \( {\displaystyle G_{0}(x)} \) :
\( {\displaystyle G_{1}(x)={\frac {G'_{0}(x)}{G'_{0}(1)}}} \)
If we know the generating function for a probability distribution \( {\displaystyle P(k)} \) then we can recover the values of P ( k ) {\displaystyle P(k)} {\displaystyle P(k)} by differentiating:
\( {\displaystyle P(k)={\frac {1}{k!}}{\operatorname {d} ^{k}\!G \over \operatorname {d} \!x^{k}}{\biggl \vert }_{x=0}} \)
Some properties, e.g. the moments, can be easily calculated from \( {\displaystyle G_{0}(x)} \) and its derivatives:
\( {\displaystyle {\langle k\rangle }=G'_{0}(1)} \)
\( {\displaystyle {\langle k^{2}\rangle }=G''_{0}(1)+G'_{0}(1)} \)
And in general:[6]
\( {\displaystyle {\langle k^{m}\rangle }={\Biggl [}{{\bigg (}\operatorname {x} {\operatorname {d} \! \over \operatorname {dx} \!}{\biggl )}^{m}}G_{0}(x){\Biggl ]}_{x=1}} \)
For Poisson-distributed random networks, such as the ER graph, \( {\displaystyle G_{1}(x)=G_{0}(x)} \), that is the reason why the theory of random networks of this type is especially simple. The probability distributions for the 1st and 2nd-nearest neighbors are generated by the functions \( {\displaystyle G_{0}(x)} \) and \( {\displaystyle G_{0}(G_{1}(x))} \). By extension, the distribution of m {\displaystyle m} {\displaystyle m}-th neighbors is generated by:
\( {\displaystyle G_{0}{\bigl (}G_{1}(...G_{1}(x)...){\bigr )}} \) , with \( {\displaystyle m-1} \) iterations of the function \( {\displaystyle G_{1}} \) acting on itself.[7]
The average number of 1st neighbors, \( {\displaystyle c_{1}} \), is \( {\displaystyle {\langle k\rangle }={dG_{0}(x) \over dx}|_{x=1}} \) and the average number of 2nd neighbors is: \( {\displaystyle c_{2}={\biggl [}{d \over dx}G_{0}{\big (}G_{1}(x){\big )}{\biggl ]}_{x=1}=G_{1}'(1)G'_{0}{\big (}G_{1}(1){\big )}=G_{1}'(1)G'_{0}(1)=G''_{0}(1)} \)
Degree distribution for directed networks
In a directed network, each node has some in-degree \( {\displaystyle k_{in}} \) and some out-degree \( {\displaystyle k_{out}} \) which are the number of links which have run into and out of that node respectfully. If \( {\displaystyle P(k_{in},k_{out})} \) is the probability that a randomly chosen node has in-degree \({\displaystyle k_{in}} \) and out-degree \( {\displaystyle k_{out}} \) then the generating function assigned to this joint probability distribution can be written with two valuables \) {\displaystyle x} \) and \( {\displaystyle y} \) as:
\( {\displaystyle {\mathcal {G}}(x,y)=\sum _{k_{in},k_{out}}\displaystyle P({k_{in},k_{out}})x^{k_{in}}y^{k_{out}}.} \)
Since every link in a directed network must leave some node and enter another, the net average number of links entering
a node is zero. Therefore,
\( {\displaystyle \langle {k_{in}-k_{out}}\rangle =\sum _{k_{in},k_{out}}\displaystyle (k_{in}-k_{out})P({k_{in},k_{out}})=0}, \)
which implies that, the generation function must satisfy:
\( {\displaystyle {\partial {\mathcal {G}} \over \partial x}\vert _{x,y=1}={\partial {\mathcal {G}} \over \partial y}\vert _{x,y=1}=c,} \)
where \( {\displaystyle c} \) is the mean degree (both in and out) of the nodes in the network; \( {\displaystyle \langle {k_{in}}\rangle =\langle {k_{out}}\rangle =c.} \)
Using the function \( {\displaystyle {\mathcal {G}}(x,y)} \) , we can again find the generation function for the in/out-degree distribution and in/out-excess degree distribution, as before. \( {\displaystyle G_{0}^{in}(x)} \) can be defined as generating functions for the number of arriving links at a randomly chosen node, and\( {\displaystyle G_{1}^{in}(x)} \) can be defined as the number of arriving links at a node reached by following a randomly chosen link. We can also define generating functions \( {\displaystyle G_{0}^{out}(y)} \) and \( {\displaystyle G_{1}^{out}(y)} \) for the number leaving such a node:[7]
\( {\displaystyle G_{0}^{in}(x)={\mathcal {G}}(x,1)} \)
\( {\displaystyle G_{1}^{in}(x)={\frac {1}{c}}{\partial {\mathcal {G}} \over \partial x}\vert _{y=1}} \)
\( {\displaystyle G_{0}^{out}(y)={\mathcal {G}}(1,y)} \)
\( {\displaystyle G_{1}^{out}(y)={\frac {1}{c}}{\partial {\mathcal {G}} \over \partial y}\vert _{x=1}} \)
Here, the average number of 1st neighbors, \( {\displaystyle c} \), or as previously introduced as \( {\displaystyle c_{1}} \), is \( {\displaystyle {\partial {\mathcal {G}} \over \partial x}{\biggl \vert }_{x,y=1}={\partial {\mathcal {G}} \over \partial y}{\biggl \vert }_{x,y=1}} \) and the average number of 2nd neighbors reachable from a randomly chosen node is given by: \( {\displaystyle c_{2}=G_{1}'(1)G'_{0}(1)={\partial ^{2}{\mathcal {G}} \over \partial x\partial y}{\biggl \vert }_{x,y=1}} \). These are also the numbers of 1st and 2nd neighbors from which a random node can be reached, since these equations are manifestly symmetric in \( {\displaystyle x} \) and \( {\displaystyle y} \).[7]
See also
Graph theory
Complex network
Scale-free network
Random graph
Structural cut-off
References
Barabási, Albert-László; Albert, Réka (1999-10-15). "Emergence of Scaling in Random Networks". Science. 286 (5439): 509–512. arXiv:cond-mat/9910332. Bibcode:1999Sci...286..509B. doi:10.1126/science.286.5439.509. ISSN 0036-8075. PMID 10521342.
Albert, Réka; Barabási, Albert-László (2000-12-11). "Topology of Evolving Networks: Local Events and Universality" (PDF). Physical Review Letters. 85 (24): 5234–5237. arXiv:cond-mat/0005085. Bibcode:2000PhRvL..85.5234A. doi:10.1103/physrevlett.85.5234. hdl:2047/d20000695. ISSN 0031-9007. PMID 11102229.
Dorogovtsev, S. N.; Mendes, J. F. F.; Samukhin, A. N. (2001-05-21). "Size-dependent degree distribution of a scale-free growing network". Physical Review E. 63 (6): 062101. arXiv:cond-mat/0011115. Bibcode:2001PhRvE..63f2101D. doi:10.1103/physreve.63.062101. ISSN 1063-651X. PMID 11415146.
Pachon, Angelica; Sacerdote, Laura; Yang, Shuyi (2018). "Scale-free behavior of networks with the copresence of preferential and uniform attachment rules". Physica D: Nonlinear Phenomena. 371: 1–12. arXiv:1704.08597. Bibcode:2018PhyD..371....1P. doi:10.1016/j.physd.2018.01.005.
Holme, Petter (2019-03-04). "Rare and everywhere: Perspectives on scale-free networks". Nature Communications. 10 (1): 1016. Bibcode:2019NatCo..10.1016H. doi:10.1038/s41467-019-09038-8. ISSN 2041-1723. PMC 6399274. PMID 30833568.
Newman, Mark (2018-10-18). Networks. 1. Oxford University Press. doi:10.1093/oso/9780198805090.001.0001. ISBN 978-0-19-880509-0.
Newman, M. E. J.; Strogatz, S. H.; Watts, D. J. (2001-07-24). "Random graphs with arbitrary degree distributions and their applications". Physical Review E. 64 (2): 026118. doi:10.1103/PhysRevE.64.026118. ISSN 1063-651X.
Albert, R.; Barabasi, A.-L. (2002). "Statistical mechanics of complex networks". Reviews of Modern Physics. 74 (1): 47–97. arXiv:cond-mat/0106096. Bibcode:2002RvMP...74...47A. doi:10.1103/RevModPhys.74.47.
Dorogovtsev, S.; Mendes, J. F. F. (2002). "Evolution of networks". Advances in Physics. 51 (4): 1079–1187. arXiv:cond-mat/0106144. Bibcode:2002AdPhy..51.1079D. doi:10.1080/00018730110112519.
Newman, M. E. J. (2003). "The structure and function of complex networks". SIAM Review. 45 (2): 167–256. arXiv:cond-mat/0303516. Bibcode:2003SIAMR..45..167N. doi:10.1137/S003614450342480.
Shlomo Havlin & Reuven Cohen (2010). Complex Networks: Structure, Robustness and Function. Cambridge University Press.
Undergraduate Texts in Mathematics
Graduate Studies in Mathematics
Hellenica World - Scientific Library
Retrieved from "http://en.wikipedia.org/"
All text is available under the terms of the GNU Free Documentation License
