1Other Network ModelsLesson 6 LECTURE SIX Other Network Models.
Lecture 9: Network models
-
Upload
cecilia-porter -
Category
Documents
-
view
37 -
download
1
description
Transcript of Lecture 9: Network models
![Page 1: Lecture 9: Network models](https://reader036.fdocuments.us/reader036/viewer/2022062304/56813518550346895d9c6d38/html5/thumbnails/1.jpg)
Lecture 9:
Network models
CS 765: Complex Networks
Slides are modified from Networks: Theory and Application by Lada Adamic
![Page 2: Lecture 9: Network models](https://reader036.fdocuments.us/reader036/viewer/2022062304/56813518550346895d9c6d38/html5/thumbnails/2.jpg)
Four structural models
Regular networks
Random networks
Small-world networks
Scale-free networks
2
![Page 3: Lecture 9: Network models](https://reader036.fdocuments.us/reader036/viewer/2022062304/56813518550346895d9c6d38/html5/thumbnails/3.jpg)
Regular networks – fully connected
3
![Page 4: Lecture 9: Network models](https://reader036.fdocuments.us/reader036/viewer/2022062304/56813518550346895d9c6d38/html5/thumbnails/4.jpg)
Regular networks – Lattice
4
![Page 5: Lecture 9: Network models](https://reader036.fdocuments.us/reader036/viewer/2022062304/56813518550346895d9c6d38/html5/thumbnails/5.jpg)
Regular networks – Lattice: ring world
5
![Page 6: Lecture 9: Network models](https://reader036.fdocuments.us/reader036/viewer/2022062304/56813518550346895d9c6d38/html5/thumbnails/6.jpg)
modeling networks: random networks
Nodes connected at random Number of edges incident on each node is Poisson
distributed
Poisson distribution
6
![Page 7: Lecture 9: Network models](https://reader036.fdocuments.us/reader036/viewer/2022062304/56813518550346895d9c6d38/html5/thumbnails/7.jpg)
Random networks
7
![Page 8: Lecture 9: Network models](https://reader036.fdocuments.us/reader036/viewer/2022062304/56813518550346895d9c6d38/html5/thumbnails/8.jpg)
Erdos-Renyi random graphs
What happens to the size of the giant component as the density of the network increases?
http://ccl.northwestern.edu/netlogo/models/GiantComponent 8
![Page 9: Lecture 9: Network models](https://reader036.fdocuments.us/reader036/viewer/2022062304/56813518550346895d9c6d38/html5/thumbnails/9.jpg)
Random Networks
9
![Page 10: Lecture 9: Network models](https://reader036.fdocuments.us/reader036/viewer/2022062304/56813518550346895d9c6d38/html5/thumbnails/10.jpg)
modeling networks: small worlds
Small worlds a friend of a friend is also
frequently a friend but only six hops separate any
two people in the world
Arnold S. – thomashawk, Flickr;
http://creativecommons.org/licenses/by-nc/2.0/deed.en10
![Page 11: Lecture 9: Network models](https://reader036.fdocuments.us/reader036/viewer/2022062304/56813518550346895d9c6d38/html5/thumbnails/11.jpg)
Small-world networks
11
![Page 12: Lecture 9: Network models](https://reader036.fdocuments.us/reader036/viewer/2022062304/56813518550346895d9c6d38/html5/thumbnails/12.jpg)
Small world models
Duncan Watts and Steven Strogatz a few random links in an otherwise structured graph make the
network a small world: the average shortest path is short
regular lattice:
my friend’s friend is
always my friend
small world:
mostly structured
with a few random
connections
random graph:
all connections
random
Source: Watts, D.J., Strogatz, S.H.(1998) Collective dynamics of 'small-world' networks. Nature 393:440-442. 12
![Page 13: Lecture 9: Network models](https://reader036.fdocuments.us/reader036/viewer/2022062304/56813518550346895d9c6d38/html5/thumbnails/13.jpg)
Watts Strogatz Small World Model
As you rewire more and more of the links and random, what happens to the clustering coefficient and average shortest path relative to their values for the regular lattice?
http://ccl.northwestern.edu/netlogo/models/SmallWorlds 13
![Page 14: Lecture 9: Network models](https://reader036.fdocuments.us/reader036/viewer/2022062304/56813518550346895d9c6d38/html5/thumbnails/14.jpg)
Scale-free networks
14
![Page 15: Lecture 9: Network models](https://reader036.fdocuments.us/reader036/viewer/2022062304/56813518550346895d9c6d38/html5/thumbnails/15.jpg)
Scale-free networks
Many real world networks contain hubs: highly connected nodes
Usually the distribution of edges is extremely skewed
many nodes with few edges
fat tail: a few nodes with a very large numberof edges
no “typical” number of edges
number of edges
num
ber
of n
odes
with
so
man
y ed
ges
15
![Page 16: Lecture 9: Network models](https://reader036.fdocuments.us/reader036/viewer/2022062304/56813518550346895d9c6d38/html5/thumbnails/16.jpg)
But is it really a power-law?
A power-law will appear as a straight line on a log-log plot:
A deviation from a straight line could indicate a different distribution: exponential lognormal
log(# edges)
log(
# n
odes
)
16
![Page 17: Lecture 9: Network models](https://reader036.fdocuments.us/reader036/viewer/2022062304/56813518550346895d9c6d38/html5/thumbnails/17.jpg)
Scale-free networks
17http://ccl.northwestern.edu/netlogo/models/PreferentialAttachment