Properties of Random Networks - chatox.github.io
Transcript of Properties of Random Networks - chatox.github.io
![Page 1: Properties of Random Networks - chatox.github.io](https://reader031.fdocuments.in/reader031/viewer/2022020916/61a24de7f68a8e5b0a4a527d/html5/thumbnails/1.jpg)
1/37
Properties ofRandom Networks
Introduction to Network ScienceCarlos CastilloTopic 08
![Page 2: Properties of Random Networks - chatox.github.io](https://reader031.fdocuments.in/reader031/viewer/2022020916/61a24de7f68a8e5b0a4a527d/html5/thumbnails/2.jpg)
2/37
Contents
● Connectedness under the ER model● Distances under the ER model● Clustering coefficient under the ER model
![Page 3: Properties of Random Networks - chatox.github.io](https://reader031.fdocuments.in/reader031/viewer/2022020916/61a24de7f68a8e5b0a4a527d/html5/thumbnails/3.jpg)
3/37
Sources
● Albert László Barabási: Network Science. Cambridge University Press, 2016. – Follows almost section-by-section chapter 03
● Data-Driven Social Analytics course by Vicenç Gómez and Andreas Kaltenbrunner
● URLs cited in the footer of specific slides
![Page 4: Properties of Random Networks - chatox.github.io](https://reader031.fdocuments.in/reader031/viewer/2022020916/61a24de7f68a8e5b0a4a527d/html5/thumbnails/4.jpg)
4
Connectivity in ER networks
![Page 5: Properties of Random Networks - chatox.github.io](https://reader031.fdocuments.in/reader031/viewer/2022020916/61a24de7f68a8e5b0a4a527d/html5/thumbnails/5.jpg)
5/37
ER network as <k> increases
● When <k> = 0: only singletons● When <k> < 1: disconnected● When <k> > 1: giant connected component● When <k> = N – 1 complete graph
It’s kind of obvious that to have a giant connected it is necessary that <k> = 1, ER proved it’s sufficient in 1959
![Page 6: Properties of Random Networks - chatox.github.io](https://reader031.fdocuments.in/reader031/viewer/2022020916/61a24de7f68a8e5b0a4a527d/html5/thumbnails/6.jpg)
6/37
Visualization of increasing p
http://networksciencebook.com/images/ch-03/video-3-2.m4v
![Page 7: Properties of Random Networks - chatox.github.io](https://reader031.fdocuments.in/reader031/viewer/2022020916/61a24de7f68a8e5b0a4a527d/html5/thumbnails/7.jpg)
7/37
Sub-critical regime:
![Page 8: Properties of Random Networks - chatox.github.io](https://reader031.fdocuments.in/reader031/viewer/2022020916/61a24de7f68a8e5b0a4a527d/html5/thumbnails/8.jpg)
8/37
Critical point:
![Page 9: Properties of Random Networks - chatox.github.io](https://reader031.fdocuments.in/reader031/viewer/2022020916/61a24de7f68a8e5b0a4a527d/html5/thumbnails/9.jpg)
9/37
Supercritical regime:
![Page 10: Properties of Random Networks - chatox.github.io](https://reader031.fdocuments.in/reader031/viewer/2022020916/61a24de7f68a8e5b0a4a527d/html5/thumbnails/10.jpg)
10/37
Connected regime:
![Page 11: Properties of Random Networks - chatox.github.io](https://reader031.fdocuments.in/reader031/viewer/2022020916/61a24de7f68a8e5b0a4a527d/html5/thumbnails/11.jpg)
11/37
Most real networks are supercritical:
![Page 12: Properties of Random Networks - chatox.github.io](https://reader031.fdocuments.in/reader031/viewer/2022020916/61a24de7f68a8e5b0a4a527d/html5/thumbnails/12.jpg)
12/37
Most real networks are supercritical:
![Page 13: Properties of Random Networks - chatox.github.io](https://reader031.fdocuments.in/reader031/viewer/2022020916/61a24de7f68a8e5b0a4a527d/html5/thumbnails/13.jpg)
13
Small-world phenomenona.k.a. “six degrees of separation”
![Page 14: Properties of Random Networks - chatox.github.io](https://reader031.fdocuments.in/reader031/viewer/2022020916/61a24de7f68a8e5b0a4a527d/html5/thumbnails/14.jpg)
14/37
Milgram’s experiment in 1967● Targets: (1) a stock broker in Boston,
MA and (2) a student in Sharon, MA● Sources: residents of Wichita and
Omaha● Materials: a short summary of the
study’s purpose, a photograph, the name, address and information about the target person
● Request: to forward the letter to a friend, relative or acquaintance who is most likely to know the target person.
● 64 of 296 letters reached destination
![Page 15: Properties of Random Networks - chatox.github.io](https://reader031.fdocuments.in/reader031/viewer/2022020916/61a24de7f68a8e5b0a4a527d/html5/thumbnails/15.jpg)
15/37
![Page 17: Properties of Random Networks - chatox.github.io](https://reader031.fdocuments.in/reader031/viewer/2022020916/61a24de7f68a8e5b0a4a527d/html5/thumbnails/17.jpg)
17/37
“Small-world phenomenon”
● If you choose any two individuals on Earth, they are connected by a relatively short path of acquaintances
● Formally– The expected distance between two randomly
chosen nodes in a network grows much slower than its number of nodes
![Page 18: Properties of Random Networks - chatox.github.io](https://reader031.fdocuments.in/reader031/viewer/2022020916/61a24de7f68a8e5b0a4a527d/html5/thumbnails/18.jpg)
18/37
How many nodes at distance ≤d?
In an ER graph:nodes at distance 1
nodes at distance 2
…
nodes at distance d
![Page 19: Properties of Random Networks - chatox.github.io](https://reader031.fdocuments.in/reader031/viewer/2022020916/61a24de7f68a8e5b0a4a527d/html5/thumbnails/19.jpg)
19/37
What is the maximum distance?
● Assuming
![Page 20: Properties of Random Networks - chatox.github.io](https://reader031.fdocuments.in/reader031/viewer/2022020916/61a24de7f68a8e5b0a4a527d/html5/thumbnails/20.jpg)
20/37
Empirical average and maximum distances
![Page 21: Properties of Random Networks - chatox.github.io](https://reader031.fdocuments.in/reader031/viewer/2022020916/61a24de7f68a8e5b0a4a527d/html5/thumbnails/21.jpg)
21/37
Approximation
● Given that dmax is dominated by a few long paths, while <d> is averaged over all paths, in general we observe that in an ER graph:
![Page 22: Properties of Random Networks - chatox.github.io](https://reader031.fdocuments.in/reader031/viewer/2022020916/61a24de7f68a8e5b0a4a527d/html5/thumbnails/22.jpg)
22/37
Exercise
Write in Nearpod Collaboratehttps://nearpod.com/student/ Code to be given during class
Go to https://oracleofbacon.org/ and find a famous actress
or actor that has a distance from Kevin Bacon larger than
Write the name of the actress/actor and its distance
![Page 23: Properties of Random Networks - chatox.github.io](https://reader031.fdocuments.in/reader031/viewer/2022020916/61a24de7f68a8e5b0a4a527d/html5/thumbnails/23.jpg)
23
Clustering coefficient
or
”a friend of a friend is my friend”
![Page 24: Properties of Random Networks - chatox.github.io](https://reader031.fdocuments.in/reader031/viewer/2022020916/61a24de7f68a8e5b0a4a527d/html5/thumbnails/24.jpg)
24/37
Clustering coefficient Ci of node i
● Remember– Ci = 0 neighbors of i are disconnected⇒
– Ci = 1 neighbors of i are fully connected⇒
![Page 25: Properties of Random Networks - chatox.github.io](https://reader031.fdocuments.in/reader031/viewer/2022020916/61a24de7f68a8e5b0a4a527d/html5/thumbnails/25.jpg)
25/37
Links between neighbors in ER graphs
● The number of nodes that are neighbors of node i is ki
● The number of distinct pairs of nodes that are neighbors of i is ki(ki-1)/2
● The probability that any of those pairs is connected is p● Then, the expected links Li between neighbors of i are:
![Page 26: Properties of Random Networks - chatox.github.io](https://reader031.fdocuments.in/reader031/viewer/2022020916/61a24de7f68a8e5b0a4a527d/html5/thumbnails/26.jpg)
26/37
Clustering coefficient in ER graphs
● Expected links Li betweenneighbors of i:
● Clustering coefficient
![Page 27: Properties of Random Networks - chatox.github.io](https://reader031.fdocuments.in/reader031/viewer/2022020916/61a24de7f68a8e5b0a4a527d/html5/thumbnails/27.jpg)
27/37
In an ER graph
If <k> is fixed, large networks should have smaller clustering coefficient
We should have that <C>/<k> follows 1/N
![Page 28: Properties of Random Networks - chatox.github.io](https://reader031.fdocuments.in/reader031/viewer/2022020916/61a24de7f68a8e5b0a4a527d/html5/thumbnails/28.jpg)
28/37
If in an ER graph Then the clustering coefficient of a node should be
independent of the degree
Internet Science collaborations
Protein interactions
![Page 29: Properties of Random Networks - chatox.github.io](https://reader031.fdocuments.in/reader031/viewer/2022020916/61a24de7f68a8e5b0a4a527d/html5/thumbnails/29.jpg)
29
To re-cap ...
![Page 30: Properties of Random Networks - chatox.github.io](https://reader031.fdocuments.in/reader031/viewer/2022020916/61a24de7f68a8e5b0a4a527d/html5/thumbnails/30.jpg)
30/37
The ER model is a bad model of degree distribution
● Predicted
● ObservedMany nodes with largerdegree than predicted
![Page 31: Properties of Random Networks - chatox.github.io](https://reader031.fdocuments.in/reader031/viewer/2022020916/61a24de7f68a8e5b0a4a527d/html5/thumbnails/31.jpg)
31/37
The ER model is a good model of path length
● Predicted
● Observed
![Page 32: Properties of Random Networks - chatox.github.io](https://reader031.fdocuments.in/reader031/viewer/2022020916/61a24de7f68a8e5b0a4a527d/html5/thumbnails/32.jpg)
32/37
The ER model is a bad model of clustering coefficient
● Predicted
● ObservedClustering coefficient decreasesif degree increases
![Page 33: Properties of Random Networks - chatox.github.io](https://reader031.fdocuments.in/reader031/viewer/2022020916/61a24de7f68a8e5b0a4a527d/html5/thumbnails/33.jpg)
33/37
Why do we study the ER model?
● Starting point● Simple● Instructional● Historically important, and gained prominence
only when large datasets started to become available relevant to Data Science!⇒
![Page 34: Properties of Random Networks - chatox.github.io](https://reader031.fdocuments.in/reader031/viewer/2022020916/61a24de7f68a8e5b0a4a527d/html5/thumbnails/34.jpg)
34/37
Exercise [B. 2016, Ex. 3.11.1]
Consider an ER graph with N=3,000 p=10-3 1) <k> ?≃
2) In which regime is the network?
3) Suppose we want to increase N until there is only one connected component3.1) What is <k> as a function of p and N?3.2) What should N be, then? Let’s call that value Ncr
Write the equation and solve by trial and error
4) What is <k> if the network has Ncr nodes?
5) What is the expected distance <d> with Ncr nodes?
Write in Nearpod Collaboratehttps://nearpod.com/student/ Code to be given during class
![Page 35: Properties of Random Networks - chatox.github.io](https://reader031.fdocuments.in/reader031/viewer/2022020916/61a24de7f68a8e5b0a4a527d/html5/thumbnails/35.jpg)
38
Summary
![Page 36: Properties of Random Networks - chatox.github.io](https://reader031.fdocuments.in/reader031/viewer/2022020916/61a24de7f68a8e5b0a4a527d/html5/thumbnails/36.jpg)
39/37
Things to remember
● The ER model ● Degree distribution in the ER model● Distance distribution in the ER model● Connectivity regimes in the ER model
![Page 37: Properties of Random Networks - chatox.github.io](https://reader031.fdocuments.in/reader031/viewer/2022020916/61a24de7f68a8e5b0a4a527d/html5/thumbnails/37.jpg)
40/37
Practice on your own
● Take an existing network– (e.g., from the slide “Empirical average and maximum distances”)
– Assume it is an ER network– Indicate in which regime is the network– Estimate expected distance– Compare to actual distances, if available
● Write code to create ER networks