Aaron Clauset
@aaronclauset
003
Assistant Professor of Computer Science
052
002
051
001
University of Colorado Boulder
External Faculty, Santa Fe Institute
lecture 1: what are networks and how do we talk about them?
}
an approach
a mathematical representation
provide structure to complexity
structure above
individuals / components
structure below
system / population
individuals / components
this course
build intuition
teach technical methods
expose key concepts
highlight big questions its a big field now
network mathematics
network computations
lots of examples and real data sets
course webpage: http://santafe.edu/~aaronc/courses/5352/
003
052
002
051
001
1. defining a network
2. describing a network
vertices edges
what is a vertex?
V distinct objects (vertices / nodes / actors)
vertex: a person
political blogs
ISP network
communication networks
IP-level Internet
Enron email
transportation networks
global shipping
US Interstates
biological networks core metabolism
!"#$%$&'()')*+,$-
whats a network?
pop quiz
whats a network?
Andromeda galaxy
whats a network?
cauliflower fractal
whats a network?
diamond lattice
representing networks
a simple network
3 4
5
6
undirected
unweighted
no self-loops
a simple network
adjacency matrix
A 1 2 3 4 5 6
1 0 1 0 0 1 0
2 2 1 0 1 1 0 0
3 0 1 0 1 1 1
1 4 0 1 1 0 0 0
5 1 0 1 0 0 0
3 4 6 0 0 1 0 0 0
5
6
adjacency list
A
1 {2, 5}
2 {1, 3, 4}
3 {2, 4, 5, 6}
undirected 4 {2, 3}
5 {1, 3}
unweighted 6 {3}
no self-loops
a less simple network
2
Directed edge
Weighted edge
1
3 4
Self-loop
Multi-edge 5
6
Weighted node
undirected
unweighted
no self-loops
a less simple network
adjacency matrix
A 1 2 3 4 5 6
1 0 0 0 0 {1, 1, 2} 0
2 2 1 1
{2, 1} 1 0 0
Directed edge 2
Weighted edge 3 0 {2, 1} 0 2 4 4
1 4 0 1 2 0 0 0
5 {1, 1, 2} 0 4 0 0 0
3 4 6 0 0 4 0 0 2
Self-loop
Multi-edge 5
6
adjacency list
A
Weighted node 1 ! {(5, 1), (5, 1), (5, 2)}
2 ! {(1, 1), (2, 12 ), (3, 2), (3, 1), (4, 1)}
3 ! {(2, 2), (2, 1), (4, 2), (5, 4), (6, 4)}
4 ! {(2, 1), (3, 2)}
5 ! {(1, 1), (1, 1), (1, 2), (3, 4)}
6 ! {(3, 4), (6, 2)}
directed networks
Aij 6= Aji
}
5
1
1 2 3 4 5
4
2
bipartite 3
network
1
1 2 3 4
2 4
no within-type edges
} }
5
1
1 2 3 4 5
4
2
bipartite 3 one-mode
network projections
1
1 2 3 4
2 4
5 5 5
1 1 1 1
4 4 4
2 2 2 2
3 3 3
001
051
002
052
003