Network Science Barab asi: Ch. 2 Graph Theory Lecture 1 Joao - - PowerPoint PPT Presentation

network science
SMART_READER_LITE
LIVE PREVIEW

Network Science Barab asi: Ch. 2 Graph Theory Lecture 1 Joao - - PowerPoint PPT Presentation

Network Science Barab asi: Ch. 2 Graph Theory Lecture 1 Joao Meidanis University of Campinas, Brazil September 20, 2020 Summary Origin of Graph Theory 1 Networks and Graphs 2 Degrees 3 Adjacency Matrix 4 Real Networks are


slide-1
SLIDE 1

Network Science

Barab´ asi: Ch. 2 — Graph Theory — Lecture 1 Joao Meidanis

University of Campinas, Brazil

September 20, 2020

slide-2
SLIDE 2

Summary

1

Origin of Graph Theory

2

Networks and Graphs

3

Degrees

4

Adjacency Matrix

5

Real Networks are Sparse

6

Weighted Networks

7

Bipartite Networks

Meidanis (Unicamp) Network Science September 20, 2020 2 / 27

slide-3
SLIDE 3

Origin of Graph Theory

Meidanis (Unicamp) Network Science September 20, 2020 3 / 27

slide-4
SLIDE 4

The Bridges of K¨

  • nigsberg Problem

Walk across all seven bridges and never cross the same one twice

Figure source: Amusing Planet (amusingplanet.com) Author: Kaushik Patowary

Meidanis (Unicamp) Network Science September 20, 2020 4 / 27

slide-5
SLIDE 5

The Solution

Impossible: 4 nodes of odd degree

Figure source: Wikipedia, Seven Bridges of K¨

  • nigsberg; authors: Bogdan Giu¸

sc˘ a, Chris-martin, Riojajar commonswiki; license: Creative Commons Attribution-Share Alike 3.0 Unported

Meidanis (Unicamp) Network Science September 20, 2020 5 / 27

slide-6
SLIDE 6

Networks and Graphs

Meidanis (Unicamp) Network Science September 20, 2020 6 / 27

slide-7
SLIDE 7

Networks and Graphs

Parameters N = number of nodes L = number of links Type Directed or undirected (or mixed) Terminology Network Science Graph Theory Network Graph Node Vertex Link Edge

Meidanis (Unicamp) Network Science September 20, 2020 7 / 27

slide-8
SLIDE 8

Ten Basic Networks Used in Book

Network Nodes Links Type N L Internet Routers Connections Undir. 192,244 609,066 WWW Web pages Links Dir. 325,729 1,497,134 Power Grid Plants, stations Cables Undir. 4,961 6,594 Mobile Suscribers Calls Dir. 36,595 91,826 Email Addresses Messages Dir. 57,194 103,731 Science Collab. Scientists Co-authors Undir. 23,133 93,437 Hollywood Actors Co-acting Undir. 702,388 29,397,908 Citation Papers Citations Dir. 449,673 4,689,479

  • E. coli

Metabolites Reactions Dir. 1,039 5,802 Cell Proteins Interactions Undir. 2,018 2,930

Meidanis (Unicamp) Network Science September 20, 2020 8 / 27

slide-9
SLIDE 9

Degrees

Meidanis (Unicamp) Network Science September 20, 2020 9 / 27

slide-10
SLIDE 10

Degree, Average Degree

Degree of a node: number of links to other nodes ki = degree of node i, for i = 1 . . . N Links and degree (undirected network) L = 1 2

N

  • i=1

ki Average degree k = 1 N

N

  • i=1

ki = 2L N

Meidanis (Unicamp) Network Science September 20, 2020 10 / 27

slide-11
SLIDE 11

Directed Networks

Total degree is made of incoming degree and outgoing degree ki = kin

i + kout i

Links and degree (directed network) L =

N

  • i=1

kin

i

=

N

  • i=1

kout

i

Average degree kin = 1 N

N

  • i=1

kin

i

= kout = 1 N

N

  • i=1

kout

i

= L N

Meidanis (Unicamp) Network Science September 20, 2020 11 / 27

slide-12
SLIDE 12

Degree Distribution

Probabilistic distribution of degrees pk = probability of a random node having degree k If Nk = number of nodes with degree k then pk = Nk N Average degree in terms of degree distribution k =

  • k=0

kpk

Meidanis (Unicamp) Network Science September 20, 2020 12 / 27

slide-13
SLIDE 13

Degree Distribution — Examples

Meidanis (Unicamp) Network Science September 20, 2020 13 / 27

slide-14
SLIDE 14

Real Network (Protein Interaction in Yeast)

Meidanis (Unicamp) Network Science September 20, 2020 14 / 27

slide-15
SLIDE 15

Zoom in — Degree Distribution

p1 = 0.48 p92 = 1/N = 0.0005

Meidanis (Unicamp) Network Science September 20, 2020 15 / 27

slide-16
SLIDE 16

Log-Log Plot — Degree Distribution

power law becomes a straight line

Meidanis (Unicamp) Network Science September 20, 2020 16 / 27

slide-17
SLIDE 17

Adjacency Matrix

Meidanis (Unicamp) Network Science September 20, 2020 17 / 27

slide-18
SLIDE 18

Adjacency Matrix

N rows, N columns; elements: Aij = 1 if j → i

  • therwise

Degrees from adjacency matrix (undirected network) ki =

N

  • j=1

Aji =

N

  • j=1

Aij Degrees from adjacency matrix (directed network) kin

i

=

N

  • j=1

Aij, kout =

N

  • j=1

Aji

Meidanis (Unicamp) Network Science September 20, 2020 18 / 27

slide-19
SLIDE 19

Adjacency Matrix

Meidanis (Unicamp) Network Science September 20, 2020 19 / 27

slide-20
SLIDE 20

Real Networks are Sparse

Meidanis (Unicamp) Network Science September 20, 2020 20 / 27

slide-21
SLIDE 21

Number of nodes N varies wildly

  • C. elegans: N ∼ 102 neurons

Human cell: N ∼ 104 genes Social network: N ∼ 108 people Human brain: N ∼ 1011 neurons WWW: N > 1012 documents 0 ≤ L ≤ Lmax = N

2 kmax = N(N−1) 2

Meidanis (Unicamp) Network Science September 20, 2020 21 / 27

slide-22
SLIDE 22

Number of links L also varies wildly

Usually much closer to N than to Lmax Network N L k Internet 192,244 609,066 6.34 WWW 325,729 1,497,134 4.60 Power Grid 4,961 6,594 2.67 Mobile calls 36,595 91,826 2.51 Email 57,194 103,731 1.81 Science Collaboration 23,133 93,437 8.08 Hollywood 702,388 29,397,908 83.71 Citation network 449,673 4,689,479 10.43

  • E. coli metabolism

1,039 5,802 5.58 Cell network 2,018 2,930 2.90

Meidanis (Unicamp) Network Science September 20, 2020 22 / 27

slide-23
SLIDE 23

Adjacency Matrix of Sparse Network

Yeast protein-protein interaction network Dots in positions where Aij = 1 For efficiency, store just list of 1-positions

Meidanis (Unicamp) Network Science September 20, 2020 23 / 27

slide-24
SLIDE 24

Weighted Networks

Meidanis (Unicamp) Network Science September 20, 2020 24 / 27

slide-25
SLIDE 25

Weighted Networks

Aij = wij Metcalfe’s Law (Used in the late 1990’s to evaluate internet companies) The value of a network is proportional to the square of the number of its nodes, i.e., N2 Limitations: The value is in fact proportional to the links created Most real networks are sparse, so L does not grow like N2 Links have different weights Some links are used heavily but the vast majority are rarely utilized

Meidanis (Unicamp) Network Science September 20, 2020 25 / 27

slide-26
SLIDE 26

Bipartite Networks

Meidanis (Unicamp) Network Science September 20, 2020 26 / 27

slide-27
SLIDE 27

Bipartite Networks

All links have one end in U and the other in V

Meidanis (Unicamp) Network Science September 20, 2020 27 / 27