![Page 1: A connected simple graph is Eulerian iff every graph vertex has even degree. The numbers of Eulerian graphs with, 2,... nodes are 1, 1, 2, 3, 7, 16, 54,](https://reader035.vdocument.in/reader035/viewer/2022062301/5697bfb61a28abf838c9e506/html5/thumbnails/1.jpg)
![Page 2: A connected simple graph is Eulerian iff every graph vertex has even degree. The numbers of Eulerian graphs with, 2,... nodes are 1, 1, 2, 3, 7, 16, 54,](https://reader035.vdocument.in/reader035/viewer/2022062301/5697bfb61a28abf838c9e506/html5/thumbnails/2.jpg)
A connected simple graph is Eulerian iff every graph vertex has even degree. The numbers of Eulerian graphs with , 2, ... nodes are 1, 1, 2, 3, 7, 16, 54, 243, 243, 2038, ... (Sloane's A002854; Robinson 1969; Mallows and Sloane 1975; Buekenhout 1995, p. 881; Colbourn and Dinitz 1996, p. 687). There is an explicit formula giving these numbers.
![Page 3: A connected simple graph is Eulerian iff every graph vertex has even degree. The numbers of Eulerian graphs with, 2,... nodes are 1, 1, 2, 3, 7, 16, 54,](https://reader035.vdocument.in/reader035/viewer/2022062301/5697bfb61a28abf838c9e506/html5/thumbnails/3.jpg)
Everything you've learned in school as "obvious" becomes less and less obvious as you begin to study the universe.
For example, there are no solids in the universe. There's not even a suggestion of a solid. There are no absolute continuums. There are no surfaces. There are no straight lines.
R. Buckminster Fuller
![Page 4: A connected simple graph is Eulerian iff every graph vertex has even degree. The numbers of Eulerian graphs with, 2,... nodes are 1, 1, 2, 3, 7, 16, 54,](https://reader035.vdocument.in/reader035/viewer/2022062301/5697bfb61a28abf838c9e506/html5/thumbnails/4.jpg)
1nk
Power-Law Distribution
![Page 5: A connected simple graph is Eulerian iff every graph vertex has even degree. The numbers of Eulerian graphs with, 2,... nodes are 1, 1, 2, 3, 7, 16, 54,](https://reader035.vdocument.in/reader035/viewer/2022062301/5697bfb61a28abf838c9e506/html5/thumbnails/5.jpg)
The longest shortest path from v5 (5) to v7 (7). Diameter is 5.
N=20
Av degree = 4
Paper I Fig 1
Random Net
![Page 6: A connected simple graph is Eulerian iff every graph vertex has even degree. The numbers of Eulerian graphs with, 2,... nodes are 1, 1, 2, 3, 7, 16, 54,](https://reader035.vdocument.in/reader035/viewer/2022062301/5697bfb61a28abf838c9e506/html5/thumbnails/6.jpg)
Random Net
Resilience
![Page 7: A connected simple graph is Eulerian iff every graph vertex has even degree. The numbers of Eulerian graphs with, 2,... nodes are 1, 1, 2, 3, 7, 16, 54,](https://reader035.vdocument.in/reader035/viewer/2022062301/5697bfb61a28abf838c9e506/html5/thumbnails/7.jpg)
![Page 8: A connected simple graph is Eulerian iff every graph vertex has even degree. The numbers of Eulerian graphs with, 2,... nodes are 1, 1, 2, 3, 7, 16, 54,](https://reader035.vdocument.in/reader035/viewer/2022062301/5697bfb61a28abf838c9e506/html5/thumbnails/8.jpg)
N=8
Av degree = 3
The longest shortest path from v1 (1) to v7 (7). Diameter is 3.
Random Net
“Diameter”
![Page 9: A connected simple graph is Eulerian iff every graph vertex has even degree. The numbers of Eulerian graphs with, 2,... nodes are 1, 1, 2, 3, 7, 16, 54,](https://reader035.vdocument.in/reader035/viewer/2022062301/5697bfb61a28abf838c9e506/html5/thumbnails/9.jpg)
![Page 10: A connected simple graph is Eulerian iff every graph vertex has even degree. The numbers of Eulerian graphs with, 2,... nodes are 1, 1, 2, 3, 7, 16, 54,](https://reader035.vdocument.in/reader035/viewer/2022062301/5697bfb61a28abf838c9e506/html5/thumbnails/10.jpg)
Bell-Shaped Distribution
![Page 11: A connected simple graph is Eulerian iff every graph vertex has even degree. The numbers of Eulerian graphs with, 2,... nodes are 1, 1, 2, 3, 7, 16, 54,](https://reader035.vdocument.in/reader035/viewer/2022062301/5697bfb61a28abf838c9e506/html5/thumbnails/11.jpg)
Power-Law Distribution
![Page 12: A connected simple graph is Eulerian iff every graph vertex has even degree. The numbers of Eulerian graphs with, 2,... nodes are 1, 1, 2, 3, 7, 16, 54,](https://reader035.vdocument.in/reader035/viewer/2022062301/5697bfb61a28abf838c9e506/html5/thumbnails/12.jpg)
![Page 13: A connected simple graph is Eulerian iff every graph vertex has even degree. The numbers of Eulerian graphs with, 2,... nodes are 1, 1, 2, 3, 7, 16, 54,](https://reader035.vdocument.in/reader035/viewer/2022062301/5697bfb61a28abf838c9e506/html5/thumbnails/13.jpg)
Network Resilience
![Page 14: A connected simple graph is Eulerian iff every graph vertex has even degree. The numbers of Eulerian graphs with, 2,... nodes are 1, 1, 2, 3, 7, 16, 54,](https://reader035.vdocument.in/reader035/viewer/2022062301/5697bfb61a28abf838c9e506/html5/thumbnails/14.jpg)
Network Resilience
![Page 15: A connected simple graph is Eulerian iff every graph vertex has even degree. The numbers of Eulerian graphs with, 2,... nodes are 1, 1, 2, 3, 7, 16, 54,](https://reader035.vdocument.in/reader035/viewer/2022062301/5697bfb61a28abf838c9e506/html5/thumbnails/15.jpg)
Network Resilience
![Page 16: A connected simple graph is Eulerian iff every graph vertex has even degree. The numbers of Eulerian graphs with, 2,... nodes are 1, 1, 2, 3, 7, 16, 54,](https://reader035.vdocument.in/reader035/viewer/2022062301/5697bfb61a28abf838c9e506/html5/thumbnails/16.jpg)
Network Resilience
![Page 17: A connected simple graph is Eulerian iff every graph vertex has even degree. The numbers of Eulerian graphs with, 2,... nodes are 1, 1, 2, 3, 7, 16, 54,](https://reader035.vdocument.in/reader035/viewer/2022062301/5697bfb61a28abf838c9e506/html5/thumbnails/17.jpg)
Network Resilience
![Page 18: A connected simple graph is Eulerian iff every graph vertex has even degree. The numbers of Eulerian graphs with, 2,... nodes are 1, 1, 2, 3, 7, 16, 54,](https://reader035.vdocument.in/reader035/viewer/2022062301/5697bfb61a28abf838c9e506/html5/thumbnails/18.jpg)
![Page 19: A connected simple graph is Eulerian iff every graph vertex has even degree. The numbers of Eulerian graphs with, 2,... nodes are 1, 1, 2, 3, 7, 16, 54,](https://reader035.vdocument.in/reader035/viewer/2022062301/5697bfb61a28abf838c9e506/html5/thumbnails/19.jpg)
N=20
M0=3
Rewire lines =1
P=0.2
Q=0.4
Paper SW-C
![Page 20: A connected simple graph is Eulerian iff every graph vertex has even degree. The numbers of Eulerian graphs with, 2,... nodes are 1, 1, 2, 3, 7, 16, 54,](https://reader035.vdocument.in/reader035/viewer/2022062301/5697bfb61a28abf838c9e506/html5/thumbnails/20.jpg)
Scale Free Net
Resilience
![Page 21: A connected simple graph is Eulerian iff every graph vertex has even degree. The numbers of Eulerian graphs with, 2,... nodes are 1, 1, 2, 3, 7, 16, 54,](https://reader035.vdocument.in/reader035/viewer/2022062301/5697bfb61a28abf838c9e506/html5/thumbnails/21.jpg)
N=20
M0=3
Rewirelines =1
P=0.2
Q=0.4
Paper C
ScaleFree1
![Page 22: A connected simple graph is Eulerian iff every graph vertex has even degree. The numbers of Eulerian graphs with, 2,... nodes are 1, 1, 2, 3, 7, 16, 54,](https://reader035.vdocument.in/reader035/viewer/2022062301/5697bfb61a28abf838c9e506/html5/thumbnails/22.jpg)
N=8
M0=3
Rewirelines =1
P=0.2
Q=0.4
Paper C
![Page 23: A connected simple graph is Eulerian iff every graph vertex has even degree. The numbers of Eulerian graphs with, 2,... nodes are 1, 1, 2, 3, 7, 16, 54,](https://reader035.vdocument.in/reader035/viewer/2022062301/5697bfb61a28abf838c9e506/html5/thumbnails/23.jpg)
v1 v2 v3 v4 v5 v6 v7 V8
v1
v2
v3
v4
v5
v6
v7
v8
![Page 24: A connected simple graph is Eulerian iff every graph vertex has even degree. The numbers of Eulerian graphs with, 2,... nodes are 1, 1, 2, 3, 7, 16, 54,](https://reader035.vdocument.in/reader035/viewer/2022062301/5697bfb61a28abf838c9e506/html5/thumbnails/24.jpg)
The longest shortest path from v2 (2) to v3 (3). Diameter is 4.
![Page 25: A connected simple graph is Eulerian iff every graph vertex has even degree. The numbers of Eulerian graphs with, 2,... nodes are 1, 1, 2, 3, 7, 16, 54,](https://reader035.vdocument.in/reader035/viewer/2022062301/5697bfb61a28abf838c9e506/html5/thumbnails/25.jpg)
The longest shortest path from v13 (13) to v19 (19). Diameter is 9.
Number of unreachable pairs: 212
Average distance among reachable pairs: 3.64286
![Page 26: A connected simple graph is Eulerian iff every graph vertex has even degree. The numbers of Eulerian graphs with, 2,... nodes are 1, 1, 2, 3, 7, 16, 54,](https://reader035.vdocument.in/reader035/viewer/2022062301/5697bfb61a28abf838c9e506/html5/thumbnails/26.jpg)
P(k) prob that node is connected to k other nodes
Web
1nk
![Page 27: A connected simple graph is Eulerian iff every graph vertex has even degree. The numbers of Eulerian graphs with, 2,... nodes are 1, 1, 2, 3, 7, 16, 54,](https://reader035.vdocument.in/reader035/viewer/2022062301/5697bfb61a28abf838c9e506/html5/thumbnails/27.jpg)
P(k) prob that node is connected to k other nodes
Web
1nk
![Page 28: A connected simple graph is Eulerian iff every graph vertex has even degree. The numbers of Eulerian graphs with, 2,... nodes are 1, 1, 2, 3, 7, 16, 54,](https://reader035.vdocument.in/reader035/viewer/2022062301/5697bfb61a28abf838c9e506/html5/thumbnails/28.jpg)
0.35 2.06log( )l N
Diameter of the WebAlbert, Jeong & Barabasi (1999) Nature.
For Web searching, the important quantity is l the smallest number of URL links that connect document A to document B. If we have N web-pages then we find (by experiment) the average of l over all pairs of links is given by
![Page 29: A connected simple graph is Eulerian iff every graph vertex has even degree. The numbers of Eulerian graphs with, 2,... nodes are 1, 1, 2, 3, 7, 16, 54,](https://reader035.vdocument.in/reader035/viewer/2022062301/5697bfb61a28abf838c9e506/html5/thumbnails/29.jpg)
Scale-Free Model Barabasi et al. (2000)
• Growth
• Preferential Attachment
• Matthew Effect
![Page 30: A connected simple graph is Eulerian iff every graph vertex has even degree. The numbers of Eulerian graphs with, 2,... nodes are 1, 1, 2, 3, 7, 16, 54,](https://reader035.vdocument.in/reader035/viewer/2022062301/5697bfb61a28abf838c9e506/html5/thumbnails/30.jpg)
Scale-Free Model Barabasi et al. (2000)
Results of Model
![Page 31: A connected simple graph is Eulerian iff every graph vertex has even degree. The numbers of Eulerian graphs with, 2,... nodes are 1, 1, 2, 3, 7, 16, 54,](https://reader035.vdocument.in/reader035/viewer/2022062301/5697bfb61a28abf838c9e506/html5/thumbnails/31.jpg)
Classification of Networks Newman (2003)
• Social Networks
• Friendships, business relationships, sexual contacts
• Miligram’s “small world” networks, “6 degrees of separation”
• Information Networks
• Citations between academic papers.
• World Wide Web
• Peer to Peer Networks
• Technological Networks
• Electric Power Grid
• Communication: Airline, Road, Rail
• Telephone
• Internet
![Page 32: A connected simple graph is Eulerian iff every graph vertex has even degree. The numbers of Eulerian graphs with, 2,... nodes are 1, 1, 2, 3, 7, 16, 54,](https://reader035.vdocument.in/reader035/viewer/2022062301/5697bfb61a28abf838c9e506/html5/thumbnails/32.jpg)
Classification of Networks Newman (2003)
• Biological Networks
• Metabolic Pathways
• Physical Interaction between proteins
• Gene regulatory network
• Food Web
• Neural Networks
• Blood vessels and vascular system
![Page 33: A connected simple graph is Eulerian iff every graph vertex has even degree. The numbers of Eulerian graphs with, 2,... nodes are 1, 1, 2, 3, 7, 16, 54,](https://reader035.vdocument.in/reader035/viewer/2022062301/5697bfb61a28abf838c9e506/html5/thumbnails/33.jpg)
Scientific Collaboration
Girvan & Newman (2002)
![Page 34: A connected simple graph is Eulerian iff every graph vertex has even degree. The numbers of Eulerian graphs with, 2,... nodes are 1, 1, 2, 3, 7, 16, 54,](https://reader035.vdocument.in/reader035/viewer/2022062301/5697bfb61a28abf838c9e506/html5/thumbnails/34.jpg)
Sexual Contact
Potterat et al. (2002)
![Page 35: A connected simple graph is Eulerian iff every graph vertex has even degree. The numbers of Eulerian graphs with, 2,... nodes are 1, 1, 2, 3, 7, 16, 54,](https://reader035.vdocument.in/reader035/viewer/2022062301/5697bfb61a28abf838c9e506/html5/thumbnails/35.jpg)
Stats for several published networks Newman
![Page 36: A connected simple graph is Eulerian iff every graph vertex has even degree. The numbers of Eulerian graphs with, 2,... nodes are 1, 1, 2, 3, 7, 16, 54,](https://reader035.vdocument.in/reader035/viewer/2022062301/5697bfb61a28abf838c9e506/html5/thumbnails/36.jpg)
Community Structure
Moody (2001)
![Page 37: A connected simple graph is Eulerian iff every graph vertex has even degree. The numbers of Eulerian graphs with, 2,... nodes are 1, 1, 2, 3, 7, 16, 54,](https://reader035.vdocument.in/reader035/viewer/2022062301/5697bfb61a28abf838c9e506/html5/thumbnails/37.jpg)
Community Structure
![Page 38: A connected simple graph is Eulerian iff every graph vertex has even degree. The numbers of Eulerian graphs with, 2,... nodes are 1, 1, 2, 3, 7, 16, 54,](https://reader035.vdocument.in/reader035/viewer/2022062301/5697bfb61a28abf838c9e506/html5/thumbnails/38.jpg)
Netw
ork T
ype
<L>
P(k)
C D comm
unity
Notes
Real World (RW)
Long right tail C prop k^-1
Random Poisson bell-shape
Small C = O(N^-1)
K^D=N
D=logN/logk
no Shows SW effect
Regular N/4k 2k/N
Scale Free (SF)
Log(N) P(K) prop k^-gam
C prop k^-1 Log(N) or log(log(N))
No SW effect
Small World (SW)
(i) Log(N) for fixed k
(ii) <L> << N
D=logN/logk P(k) does not match RW
![Page 39: A connected simple graph is Eulerian iff every graph vertex has even degree. The numbers of Eulerian graphs with, 2,... nodes are 1, 1, 2, 3, 7, 16, 54,](https://reader035.vdocument.in/reader035/viewer/2022062301/5697bfb61a28abf838c9e506/html5/thumbnails/39.jpg)
Small-World Network
• Average path length small compared to size of network
• Net has many tightly connected groups, small tieds to outsiders
• Clustering. Friends: friends of a person are also likely to be friends.
![Page 40: A connected simple graph is Eulerian iff every graph vertex has even degree. The numbers of Eulerian graphs with, 2,... nodes are 1, 1, 2, 3, 7, 16, 54,](https://reader035.vdocument.in/reader035/viewer/2022062301/5697bfb61a28abf838c9e506/html5/thumbnails/40.jpg)
Small-World Network
• Power law distribution – vast number of nodes have only few connexions, but small number are highly connected and therefore play significant role in networking.
• “Clustering coefficient” .. See numerical graph.
• Explained by “growth” – connect to nodes that are well connected!
![Page 41: A connected simple graph is Eulerian iff every graph vertex has even degree. The numbers of Eulerian graphs with, 2,... nodes are 1, 1, 2, 3, 7, 16, 54,](https://reader035.vdocument.in/reader035/viewer/2022062301/5697bfb61a28abf838c9e506/html5/thumbnails/41.jpg)
WWW (2000)
![Page 42: A connected simple graph is Eulerian iff every graph vertex has even degree. The numbers of Eulerian graphs with, 2,... nodes are 1, 1, 2, 3, 7, 16, 54,](https://reader035.vdocument.in/reader035/viewer/2022062301/5697bfb61a28abf838c9e506/html5/thumbnails/42.jpg)
Measurement and Analysis of Online Social Networks
Mislove et al. (2007)
• How users browse Flickr
• 81% of viewers came from within Flickr
• 6% of viewers used the Flickr photo search
• 13% of viewers came in from an external link
![Page 43: A connected simple graph is Eulerian iff every graph vertex has even degree. The numbers of Eulerian graphs with, 2,... nodes are 1, 1, 2, 3, 7, 16, 54,](https://reader035.vdocument.in/reader035/viewer/2022062301/5697bfb61a28abf838c9e506/html5/thumbnails/43.jpg)
Network Resilience
Homogeneous net
Internet net
![Page 44: A connected simple graph is Eulerian iff every graph vertex has even degree. The numbers of Eulerian graphs with, 2,... nodes are 1, 1, 2, 3, 7, 16, 54,](https://reader035.vdocument.in/reader035/viewer/2022062301/5697bfb61a28abf838c9e506/html5/thumbnails/44.jpg)
Interconnect Topologies
Bus
Mesh
Ring
Complete
Point to Point
Star
![Page 45: A connected simple graph is Eulerian iff every graph vertex has even degree. The numbers of Eulerian graphs with, 2,... nodes are 1, 1, 2, 3, 7, 16, 54,](https://reader035.vdocument.in/reader035/viewer/2022062301/5697bfb61a28abf838c9e506/html5/thumbnails/45.jpg)
Internet Mapping Project by Hal Burch and Bill Cheswick (LUMETA)
![Page 46: A connected simple graph is Eulerian iff every graph vertex has even degree. The numbers of Eulerian graphs with, 2,... nodes are 1, 1, 2, 3, 7, 16, 54,](https://reader035.vdocument.in/reader035/viewer/2022062301/5697bfb61a28abf838c9e506/html5/thumbnails/46.jpg)
![Page 47: A connected simple graph is Eulerian iff every graph vertex has even degree. The numbers of Eulerian graphs with, 2,... nodes are 1, 1, 2, 3, 7, 16, 54,](https://reader035.vdocument.in/reader035/viewer/2022062301/5697bfb61a28abf838c9e506/html5/thumbnails/47.jpg)
![Page 48: A connected simple graph is Eulerian iff every graph vertex has even degree. The numbers of Eulerian graphs with, 2,... nodes are 1, 1, 2, 3, 7, 16, 54,](https://reader035.vdocument.in/reader035/viewer/2022062301/5697bfb61a28abf838c9e506/html5/thumbnails/48.jpg)
Networks
![Page 49: A connected simple graph is Eulerian iff every graph vertex has even degree. The numbers of Eulerian graphs with, 2,... nodes are 1, 1, 2, 3, 7, 16, 54,](https://reader035.vdocument.in/reader035/viewer/2022062301/5697bfb61a28abf838c9e506/html5/thumbnails/49.jpg)
Some Definitions
Degree k Number of edges connected to a vertex
Diameter D The longest of the shortest path from one node to another
<l> Average of all shortest paths
Cluster Coefficient C Measures the density of triangles in the network
![Page 50: A connected simple graph is Eulerian iff every graph vertex has even degree. The numbers of Eulerian graphs with, 2,... nodes are 1, 1, 2, 3, 7, 16, 54,](https://reader035.vdocument.in/reader035/viewer/2022062301/5697bfb61a28abf838c9e506/html5/thumbnails/50.jpg)
High School Dating
![Page 51: A connected simple graph is Eulerian iff every graph vertex has even degree. The numbers of Eulerian graphs with, 2,... nodes are 1, 1, 2, 3, 7, 16, 54,](https://reader035.vdocument.in/reader035/viewer/2022062301/5697bfb61a28abf838c9e506/html5/thumbnails/51.jpg)
Politics
![Page 52: A connected simple graph is Eulerian iff every graph vertex has even degree. The numbers of Eulerian graphs with, 2,... nodes are 1, 1, 2, 3, 7, 16, 54,](https://reader035.vdocument.in/reader035/viewer/2022062301/5697bfb61a28abf838c9e506/html5/thumbnails/52.jpg)
Given a network, there are a number of structural questions we may ask:
1. How many connections does the average node have?2. Are some nodes more connected than others?3. Is the entire network connected?4. On average, how many links are there between nodes?5. Are there clusters or groupings within which the connections are particularlystrong?6. What is the best way to characterize a complex network?7. How can we tell if two networks are “different”?8. Are there useful ways of classifying or categorizing networks?
![Page 53: A connected simple graph is Eulerian iff every graph vertex has even degree. The numbers of Eulerian graphs with, 2,... nodes are 1, 1, 2, 3, 7, 16, 54,](https://reader035.vdocument.in/reader035/viewer/2022062301/5697bfb61a28abf838c9e506/html5/thumbnails/53.jpg)
Network Questions: Communities
1. Are there clusters or groupings within which the connections are particularlystrong?2. What is the best way to discover communities, especially in large networks?3. How can we tell if these communities are statistically significant?4. What do these clusters tell us in specific applications?
![Page 54: A connected simple graph is Eulerian iff every graph vertex has even degree. The numbers of Eulerian graphs with, 2,... nodes are 1, 1, 2, 3, 7, 16, 54,](https://reader035.vdocument.in/reader035/viewer/2022062301/5697bfb61a28abf838c9e506/html5/thumbnails/54.jpg)
Network Questions: Dynamics on
1. How do diseases/computer viruses/innovations/rumors/revolutions propagateon networks?2. What properties of networks are relevant to the answer of the above question?3. If you wanted to prevent (or encourage) spread of something on a network,what should you do?4. What types of networks are robust to random attack or failure?5. What types of networks are robust to directed attack?6. How are dynamics of and dynamics on coupled?
![Page 55: A connected simple graph is Eulerian iff every graph vertex has even degree. The numbers of Eulerian graphs with, 2,... nodes are 1, 1, 2, 3, 7, 16, 54,](https://reader035.vdocument.in/reader035/viewer/2022062301/5697bfb61a28abf838c9e506/html5/thumbnails/55.jpg)
Network Questions: Algorithms
1. What types of networks are searchable or navigable?2. What are good ways to visualize complex networks?3. How does google page rank work?4. If the internet were to double in size, would it still work?There are also many domain-specific questions:1. Are networks a sensible way to think about gene regulation or proteininteractions or food webs?2. What can social networks tell us about how people interact and formcommunities and make friends and enemies?3. Lots and lots of other theoretical and methodological questions...4. What else can be viewed as a network? Many applications await.
![Page 56: A connected simple graph is Eulerian iff every graph vertex has even degree. The numbers of Eulerian graphs with, 2,... nodes are 1, 1, 2, 3, 7, 16, 54,](https://reader035.vdocument.in/reader035/viewer/2022062301/5697bfb61a28abf838c9e506/html5/thumbnails/56.jpg)
Some Questions
• Technological Networks (eg Internet)
• Information Networks (eg WWW)
• Social Networks
![Page 57: A connected simple graph is Eulerian iff every graph vertex has even degree. The numbers of Eulerian graphs with, 2,... nodes are 1, 1, 2, 3, 7, 16, 54,](https://reader035.vdocument.in/reader035/viewer/2022062301/5697bfb61a28abf838c9e506/html5/thumbnails/57.jpg)
• A network model treats all nodes the same and all links or edges the same• In a picture of a network, the spatial location of nodes is arbitrary• Networks are abstractions of connection and relation• Networks have been used to model a vast array of stuff
Vertex / nodeEdge / link
![Page 58: A connected simple graph is Eulerian iff every graph vertex has even degree. The numbers of Eulerian graphs with, 2,... nodes are 1, 1, 2, 3, 7, 16, 54,](https://reader035.vdocument.in/reader035/viewer/2022062301/5697bfb61a28abf838c9e506/html5/thumbnails/58.jpg)
1736 Leonhard Euler wonders, can I walk through the city of Konigsberg and cross each bridge once and only once?
![Page 59: A connected simple graph is Eulerian iff every graph vertex has even degree. The numbers of Eulerian graphs with, 2,... nodes are 1, 1, 2, 3, 7, 16, 54,](https://reader035.vdocument.in/reader035/viewer/2022062301/5697bfb61a28abf838c9e506/html5/thumbnails/59.jpg)
Regular RandomSmall World
![Page 60: A connected simple graph is Eulerian iff every graph vertex has even degree. The numbers of Eulerian graphs with, 2,... nodes are 1, 1, 2, 3, 7, 16, 54,](https://reader035.vdocument.in/reader035/viewer/2022062301/5697bfb61a28abf838c9e506/html5/thumbnails/60.jpg)
Probability (chance) of reconnection
![Page 61: A connected simple graph is Eulerian iff every graph vertex has even degree. The numbers of Eulerian graphs with, 2,... nodes are 1, 1, 2, 3, 7, 16, 54,](https://reader035.vdocument.in/reader035/viewer/2022062301/5697bfb61a28abf838c9e506/html5/thumbnails/61.jpg)
Draw The Internet
![Page 62: A connected simple graph is Eulerian iff every graph vertex has even degree. The numbers of Eulerian graphs with, 2,... nodes are 1, 1, 2, 3, 7, 16, 54,](https://reader035.vdocument.in/reader035/viewer/2022062301/5697bfb61a28abf838c9e506/html5/thumbnails/62.jpg)