network science class 4: scale-free propertymeidanis/courses/mo412/2020s1/slides/… · the largest...
TRANSCRIPT
![Page 1: Network Science Class 4: Scale-free propertymeidanis/courses/mo412/2020s1/slides/… · the largest hub will grab an increasing fraction of links. Anomaly! kmax = kminN 1 g-1. The](https://reader033.vdocuments.us/reader033/viewer/2022053023/6056b5d769a69c37e1399a7d/html5/thumbnails/1.jpg)
Network Science
Class 4: Scale-free property
Albert-László Barabásiwith Emma K. Towlson, Michael M. Danziger,
Sebastian Ruf and Louis Shekhtman
www.BarabasiLab.com
![Page 2: Network Science Class 4: Scale-free propertymeidanis/courses/mo412/2020s1/slides/… · the largest hub will grab an increasing fraction of links. Anomaly! kmax = kminN 1 g-1. The](https://reader033.vdocuments.us/reader033/viewer/2022053023/6056b5d769a69c37e1399a7d/html5/thumbnails/2.jpg)
1. From the WWW to Scale-free networks. Definition.2. Discrete and continuum formalism. Explain its meaning.3. Hubs and the maximum degree.4. What does ‘scale-free’ mean? 5. Universality. Are all networks scale-free?6. From small worlds to ultra small worlds.7. The role of the degree exponent.
Questions Scale-free Property
![Page 3: Network Science Class 4: Scale-free propertymeidanis/courses/mo412/2020s1/slides/… · the largest hub will grab an increasing fraction of links. Anomaly! kmax = kminN 1 g-1. The](https://reader033.vdocuments.us/reader033/viewer/2022053023/6056b5d769a69c37e1399a7d/html5/thumbnails/3.jpg)
Introduction
Section 1
![Page 4: Network Science Class 4: Scale-free propertymeidanis/courses/mo412/2020s1/slides/… · the largest hub will grab an increasing fraction of links. Anomaly! kmax = kminN 1 g-1. The](https://reader033.vdocuments.us/reader033/viewer/2022053023/6056b5d769a69c37e1399a7d/html5/thumbnails/4.jpg)
Nodes: WWW documents Links: URL links
Over 3 billion documents
ROBOT: collects all URL’s found in a document and follows them recursively
WORLD WIDE WEB
R. Albert, H. Jeong, A-L Barabasi, Nature, 401 130 (1999).
![Page 5: Network Science Class 4: Scale-free propertymeidanis/courses/mo412/2020s1/slides/… · the largest hub will grab an increasing fraction of links. Anomaly! kmax = kminN 1 g-1. The](https://reader033.vdocuments.us/reader033/viewer/2022053023/6056b5d769a69c37e1399a7d/html5/thumbnails/5.jpg)
Power laws and scale-free networks
Section 2
![Page 6: Network Science Class 4: Scale-free propertymeidanis/courses/mo412/2020s1/slides/… · the largest hub will grab an increasing fraction of links. Anomaly! kmax = kminN 1 g-1. The](https://reader033.vdocuments.us/reader033/viewer/2022053023/6056b5d769a69c37e1399a7d/html5/thumbnails/6.jpg)
Nodes: WWW documents Links: URL links
Over 3 billion documents
ROBOT: collects all URL’s found in a document and follows them recursively
Exp
ected
R. Albert, H. Jeong, A-L Barabasi, Nature, 401 130 (1999).
WORLD WIDE WEB
Network Science: Scale-Free Property
![Page 7: Network Science Class 4: Scale-free propertymeidanis/courses/mo412/2020s1/slides/… · the largest hub will grab an increasing fraction of links. Anomaly! kmax = kminN 1 g-1. The](https://reader033.vdocuments.us/reader033/viewer/2022053023/6056b5d769a69c37e1399a7d/html5/thumbnails/7.jpg)
Discrete vs. Continuum formalism
Network Science: Scale-Free Property
Discrete Formalism As node degrees are always positive
integers, the discrete formalism captures the probability that a node has exactly k links:
Continuum Formalism In analytical calculations it is often convenient to assume that the degrees can take up any positive real value:
INTERPRETATION:
![Page 8: Network Science Class 4: Scale-free propertymeidanis/courses/mo412/2020s1/slides/… · the largest hub will grab an increasing fraction of links. Anomaly! kmax = kminN 1 g-1. The](https://reader033.vdocuments.us/reader033/viewer/2022053023/6056b5d769a69c37e1399a7d/html5/thumbnails/8.jpg)
80/20 RULE
Vilfredo Federico Damaso Pareto (1848 – 1923), Italian economist, political scientist and philosopher, who had important contributions to our understanding of income distribution and to the analysis of individuals choices. A number of fundamental principles are named after him, like Pareto efficiency, Pareto distribution (another name for a power-law distribution), the Pareto principle (or 80/20 law).
![Page 9: Network Science Class 4: Scale-free propertymeidanis/courses/mo412/2020s1/slides/… · the largest hub will grab an increasing fraction of links. Anomaly! kmax = kminN 1 g-1. The](https://reader033.vdocuments.us/reader033/viewer/2022053023/6056b5d769a69c37e1399a7d/html5/thumbnails/9.jpg)
Hubs
Section 3
![Page 10: Network Science Class 4: Scale-free propertymeidanis/courses/mo412/2020s1/slides/… · the largest hub will grab an increasing fraction of links. Anomaly! kmax = kminN 1 g-1. The](https://reader033.vdocuments.us/reader033/viewer/2022053023/6056b5d769a69c37e1399a7d/html5/thumbnails/10.jpg)
The difference between a power law and an exponential distribution
![Page 11: Network Science Class 4: Scale-free propertymeidanis/courses/mo412/2020s1/slides/… · the largest hub will grab an increasing fraction of links. Anomaly! kmax = kminN 1 g-1. The](https://reader033.vdocuments.us/reader033/viewer/2022053023/6056b5d769a69c37e1399a7d/html5/thumbnails/11.jpg)
The difference between a power law and an exponential distribution
Let us use the WWW to illustrate the properties of the high-k regime. The probability to have a node with k~100 is
• About in a Poisson distribution
• About if pk follows a power law.
• Consequently, if the WWW were to be a random network, according to the Poisson prediction we would expect 10-18 k>100 degree nodes, or none.
• For a power law degree distribution, we expect about k>100 degree nodes
![Page 12: Network Science Class 4: Scale-free propertymeidanis/courses/mo412/2020s1/slides/… · the largest hub will grab an increasing fraction of links. Anomaly! kmax = kminN 1 g-1. The](https://reader033.vdocuments.us/reader033/viewer/2022053023/6056b5d769a69c37e1399a7d/html5/thumbnails/12.jpg)
Network Science: Scale-Free Property
![Page 13: Network Science Class 4: Scale-free propertymeidanis/courses/mo412/2020s1/slides/… · the largest hub will grab an increasing fraction of links. Anomaly! kmax = kminN 1 g-1. The](https://reader033.vdocuments.us/reader033/viewer/2022053023/6056b5d769a69c37e1399a7d/html5/thumbnails/13.jpg)
Finite scale-free networksAll real networks are finite let us explore its consequences. We have an expected maximum degree, kmax
Estimating kmax
Why: the probability to have a node larger than kmax should not exceed the prob. to have one node, i.e. 1/N fraction of all nodes
The size of the biggest hub
P(k)dkkmax
¥
ò »1
N
kmax = kminN1
g -1
P(k)dkkmax
¥
ò = (g -1)kming -1 k-g dk
kmax
¥
ò =(g -1)(-g +1)
kming -1 k-g +1éë ùûkmax
¥=kming -1
kmaxg -1 »
1
N
![Page 14: Network Science Class 4: Scale-free propertymeidanis/courses/mo412/2020s1/slides/… · the largest hub will grab an increasing fraction of links. Anomaly! kmax = kminN 1 g-1. The](https://reader033.vdocuments.us/reader033/viewer/2022053023/6056b5d769a69c37e1399a7d/html5/thumbnails/14.jpg)
Finite scale-free networksThe size of the biggest hub
kmax = kminN1
g -1
![Page 15: Network Science Class 4: Scale-free propertymeidanis/courses/mo412/2020s1/slides/… · the largest hub will grab an increasing fraction of links. Anomaly! kmax = kminN 1 g-1. The](https://reader033.vdocuments.us/reader033/viewer/2022053023/6056b5d769a69c37e1399a7d/html5/thumbnails/15.jpg)
Finite scale-free networks
Expected maximum degree, kmax
• kmax, increases with the size of the network the larger a system is, the larger its biggest hub
• For γ>2 kmax increases slower than Nthe largest hub will contain a decreasing fraction of links as N increases.
• For γ=2 kmax~N. The size of the biggest hub is O(N)
• For γ<2 kmax increases faster than N: condensation phenomena the largest hub will grab an increasing fraction of links. Anomaly!
kmax = kminN1
g -1
![Page 16: Network Science Class 4: Scale-free propertymeidanis/courses/mo412/2020s1/slides/… · the largest hub will grab an increasing fraction of links. Anomaly! kmax = kminN 1 g-1. The](https://reader033.vdocuments.us/reader033/viewer/2022053023/6056b5d769a69c37e1399a7d/html5/thumbnails/16.jpg)
Finite scale-free networksThe size of the largest hub
kmax = kminN1
g -1
![Page 17: Network Science Class 4: Scale-free propertymeidanis/courses/mo412/2020s1/slides/… · the largest hub will grab an increasing fraction of links. Anomaly! kmax = kminN 1 g-1. The](https://reader033.vdocuments.us/reader033/viewer/2022053023/6056b5d769a69c37e1399a7d/html5/thumbnails/17.jpg)
The meaning of scale-free
Section 4
![Page 18: Network Science Class 4: Scale-free propertymeidanis/courses/mo412/2020s1/slides/… · the largest hub will grab an increasing fraction of links. Anomaly! kmax = kminN 1 g-1. The](https://reader033.vdocuments.us/reader033/viewer/2022053023/6056b5d769a69c37e1399a7d/html5/thumbnails/18.jpg)
Definition:
Networks with a power law tail in their degree distribution are called ‘scale-free networks’
Where does the name come from?
Critical Phenomena and scale-invariance (a detour)
Slides after Dante R. Chialvo
Scale-free networks: Definition
Network Science: Scale-Free Property
![Page 19: Network Science Class 4: Scale-free propertymeidanis/courses/mo412/2020s1/slides/… · the largest hub will grab an increasing fraction of links. Anomaly! kmax = kminN 1 g-1. The](https://reader033.vdocuments.us/reader033/viewer/2022053023/6056b5d769a69c37e1399a7d/html5/thumbnails/19.jpg)
Phase transitions in complex systems I: Magnetism
T = 0.99 TcT = 0.999 Tc
ξ ξ
T = Tc T = 1.5 Tc T = 2 Tc
Network Science: Scale-Free Property
![Page 20: Network Science Class 4: Scale-free propertymeidanis/courses/mo412/2020s1/slides/… · the largest hub will grab an increasing fraction of links. Anomaly! kmax = kminN 1 g-1. The](https://reader033.vdocuments.us/reader033/viewer/2022053023/6056b5d769a69c37e1399a7d/html5/thumbnails/20.jpg)
At T = Tc:
correlation length diverges
Fluctuations emerge at all scales:
scale-free behavior
Scale-free behavior in space
Network Science: Scale-Free Property
![Page 21: Network Science Class 4: Scale-free propertymeidanis/courses/mo412/2020s1/slides/… · the largest hub will grab an increasing fraction of links. Anomaly! kmax = kminN 1 g-1. The](https://reader033.vdocuments.us/reader033/viewer/2022053023/6056b5d769a69c37e1399a7d/html5/thumbnails/21.jpg)
• Correlation length diverges at the critical point: the whole system is correlated!
• Scale invariance: there is no characteristic scale for the fluctuation (scale-free behavior).
• Universality: exponents are independent of the system’s details.
CRITICAL PHENOMENA
Network Science: Scale-Free Property
![Page 22: Network Science Class 4: Scale-free propertymeidanis/courses/mo412/2020s1/slides/… · the largest hub will grab an increasing fraction of links. Anomaly! kmax = kminN 1 g-1. The](https://reader033.vdocuments.us/reader033/viewer/2022053023/6056b5d769a69c37e1399a7d/html5/thumbnails/22.jpg)
Divergences in scale-free distributions
Network Science: Scale-Free Property
If m-γ+1<0:
If m-γ+1>0, the integral diverges.
For a fixed γ this means that all moments with m>γ-1 diverge.
C =1
k-g dkkmin
¥
ò= (g -1)kmin
g -1P(k) = Ck-g k = [kmin ,¥) P(k)
kmin
¥
ò dk = 1
P(k) = (g -1)kming -1k-g
< km >= kmP(k)dkkmin
¥
ò < km >= (g -1)kming -1 km-g dk
kmin
¥
ò =(g -1)
(m -g +1)kming -1 km-g +1éë ùûkmin
¥
< km >= -(g -1)
(m -g +1)kminm
![Page 23: Network Science Class 4: Scale-free propertymeidanis/courses/mo412/2020s1/slides/… · the largest hub will grab an increasing fraction of links. Anomaly! kmax = kminN 1 g-1. The](https://reader033.vdocuments.us/reader033/viewer/2022053023/6056b5d769a69c37e1399a7d/html5/thumbnails/23.jpg)
For a fixed λ this means all moments m>γ-1 diverge.
Many degree exponents are smaller than 3
<k2> diverges in the N∞ limit!!!
DIVERGENCE OF THE HIGHER MOMENTS
Network Science: Scale-Free Property
< km >= (g -1)kming -1 km-l dk
kmin
¥
ò =(g -1)
(m -g +1)kming -1 km-g +1éë ùûkmin
¥
![Page 24: Network Science Class 4: Scale-free propertymeidanis/courses/mo412/2020s1/slides/… · the largest hub will grab an increasing fraction of links. Anomaly! kmax = kminN 1 g-1. The](https://reader033.vdocuments.us/reader033/viewer/2022053023/6056b5d769a69c37e1399a7d/html5/thumbnails/24.jpg)
The meaning of scale-free
![Page 25: Network Science Class 4: Scale-free propertymeidanis/courses/mo412/2020s1/slides/… · the largest hub will grab an increasing fraction of links. Anomaly! kmax = kminN 1 g-1. The](https://reader033.vdocuments.us/reader033/viewer/2022053023/6056b5d769a69c37e1399a7d/html5/thumbnails/25.jpg)
The meaning of scale-free