Download presentation
Presentation is loading. Please wait.
1
CS8803-NS Network Science Fall 2013
Instructor: Constantine Dovrolis
2
Disclaimers The following slides include only the figures or videos that we use in class; they do not include detailed the explanations, derivations or descriptions covered in class. Many of the following figures are copied from open sources at the Web. I do not claim any intellectual property for the following material.
3
Outline Basic concepts Weighted networks Spatial networks
Graphs, paths, adjacency matrix, etc Centrality metrics Clustering metrics Cliques and cores Assortativity metrics Weighted networks Application paper: airline networks Spatial networks Application paper: city networks More about betweenness centrality Betweenness centrality algorithm by Brandes Mini-talk by Oded Green about parallel/streaming BC computation Surprise “visitor” will talk about Network Medicine
5
Undirected, directed, weighted graphs
6
Graph adjacency matrix
7
Graph adjacency matrix (cont’)
Many network properties can be formulated as properties of the adjacency matrix See “algebraic graph theory” For instance: A directed network is acyclic if and only if all eigenvalues of the adjacency matrix are equal to 0 Proof?
8
Planar graphs Here is an example of a famous graph theory result:
Here is an example of a famous graph theory result: Kuratowski: Every non-planar graph contains at least one subgraph that is an expansion of a 5-node clique or of the “utility graph” K3,3 (shown at the top right)
9
Node degree, in-out degrees, degree distribution k’th moment
Directed graphs: aij=1 if edge from i to j
10
Degree distribution
11
Average degree, connectance, sparse and dense graphs
Undirected graph with n nodes and m edges Average node degree: c = 2*m / n Connectance: ρ = c / (n-1) What happens to ρ as n tends to infinity? Sparse graphs: ρ tends to zero Dense graphs: ρ tends to positive constant
12
Paths, Shortest Paths, Diameter, Characteristic Path Length, Graph Efficiency
13
Paths and their length a b d c Number of paths of length r from j to i: Nij(r)=[Ar]ij
14
Cyclic and Acyclic graphs
Number of loops of length r anywhere in network: L(r) = Σi[Ar] ii = Tr[Ar] = Σi[kir] ki eigenvalue of adjacency matrix Proof? Easier for undirected networks
15
Eulerian and Hamiltonian graphs
16
Weakly Connected Components & Strongly Connected Components
17
Min-cut and max-flow For a given (source, sink) pair: the max flow between them is the sum of the weights of the edges of the min-cut-set that separates (source, sink)
18
Network centrality metrics
19
We will talk later about centrality metrics for directed networks, such as PageRank or HITS
20
Cliques, plexes and cores
Clique of size n: maximal subset of nodes, with every node connected to every other member of the subset k-plex of size n: maximal subset of nodes, with every node connected to at least n-k other members of the subset k=1: clique k>1: “approximate clique” k-core of size n: maximal subset of nodes, with every node connected to at least k others in the subset
21
K-core decomposition
22
Transitivity & Clustering coeff
23
Clustering coefficient
24
In general, is knn(k) increasing/decreasing with k?
Degree correlations In general, is knn(k) increasing/decreasing with k?
25
Assortativity – Degree mixing
How would you classify social networks in this axis? Technological networks such as the Internet?
26
Core-periphery networks (“rich club” network)
27
Outline Basic concepts Weighted networks Spatial networks
Graphs, paths, adjacency matrix, etc Centrality metrics Clustering metrics Cliques and cores Assortativity metrics Weighted networks Application paper: airline networks Spatial networks Application paper: city networks More about betweenness centrality Betweenness centrality algorithm by Brandes Mini-talk by Oded Green about parallel/streaming BC computation Surprise “visitor” will talk about Network Medicine
31
Node strength
32
Strength distribution
33
Relation between strength and degree
34
Weighted clustering coefficient
36
Weighted average neighbors degree
38
Outline Basic concepts Weighted networks Spatial networks
Graphs, paths, adjacency matrix, etc Centrality metrics Clustering metrics Cliques and cores Assortativity metrics Weighted networks Application paper: airline networks Spatial networks Application paper: city networks More about betweenness centrality Betweenness centrality algorithm by Brandes Mini-talk by Oded Green about parallel/streaming BC computation Surprise “visitor” will talk about Network Medicine
40
Spatial networks Nodes are embedded in physical space (2d or 3d)
Edges have physical length Planar graphs constraint Spatial embedding affects maximum degree or maximum edge length Spatial networks vs Relational networks
41
Analyzed one-square-mile maps from 18 cities
50
Food for thought How do you explain the (major) difference in the distributions of betweenness centrality and information centrality? What is a good generative model for self-organized cities? How would you cluster similar cities together based on their spatial network properties?
51
Outline Basic concepts Weighted networks Spatial networks
Graphs, paths, adjacency matrix, etc Centrality metrics Clustering metrics Cliques and cores Assortativity metrics Weighted networks Application paper: airline networks Spatial networks Application paper: city networks More about betweenness centrality Betweenness centrality algorithm by Brandes Mini-talk by Oded Green about parallel/streaming BC computation Surprise “visitor” will talk about Network Medicine
55
Counting shortest paths
56
Accumulation of path-dependencies
61
Mini-talk by Oded Green about parallel, streaming BC computation
62
Outline Basic concepts Weighted networks Spatial networks
Graphs, paths, adjacency matrix, etc Centrality metrics Clustering metrics Cliques and cores Assortativity metrics Weighted networks Application paper: airline networks Spatial networks Application paper: city networks More about betweenness centrality Betweenness centrality algorithm by Brandes Mini-talk by Oded Green about parallel/streaming BC computation Surprise “visitor” will talk about Network Medicine
63
A surprise “visitor” will talk to us about Network Medicine
Similar presentations
![1 Representing Graphs. 2 Adjacency Matrix Suppose we have a graph G with n nodes. The adjacency matrix is the n x n matrix A=[a ij ] with: a ij = 1 if.](/15/4821664/big_thumb.jpg "1 Representing Graphs. 2 Adjacency Matrix Suppose we have a graph G with n nodes. The adjacency matrix is the n x n matrix A=[a ij ] with: a ij = 1 if.>")
