Analysis of some weighted networks A' Barrat, LPT, Universit ParisSud, France - PowerPoint PPT Presentation

1 / 36
About This Presentation
Title:

Analysis of some weighted networks A' Barrat, LPT, Universit ParisSud, France

Description:

R. Pastor-Satorras (Barcelona, Spain) A. Vespignani (LPT, France) ... Peaked probability distribution for the weights. Same universality class as unweighted network ... – PowerPoint PPT presentation

Number of Views:64
Avg rating:3.0/5.0
Slides: 37
Provided by: pvI5
Category:

less

Transcript and Presenter's Notes

Title: Analysis of some weighted networks A' Barrat, LPT, Universit ParisSud, France


1
Analysis of some weighted networksA. Barrat,
LPT, Université Paris-Sud, France
M. Barthélémy (CEA, France) R. Pastor-Satorras
(Barcelona, Spain) A. Vespignani (LPT, France)
Thanks L. A. N. Amaral, R. Guimerà
2
Plan of the talk
  • Examples of weighted networks
  • Definitions Topological and Weighted quantities
  • Data analysis
  • Correlations topology/traffic
  • Some new definitions
  • Perspectives

3
A model growing weighted network
S.H. Yook, H. Jeong, A.-L. Barabàsi, Y. Tu P.R.L.
86, 5835 (2001)
  • Growing networks with preferential attachment
  • Weights on links, driven by network connectivity
  • Peaked probability distribution for the weights
  • Same universality class as unweighted network

Here analysis of real data
4
Examples of weighted networks
  • Scientific collaborations
  • Actors' collaborations
  • Internet
  • Emails
  • Airports' network
  • Finance, economic networks

thanks M. Newman IMDB IATA
5
Weighted networks data
  • Scientific collaborations cond-mat archive
    N12722 authors, 39967 links
  • Actors' collaborations IMDB, N374511 actors
  • Airports' network data by IATA N3863 connected
    airports, 18807 links

6
Topological quantities
  • aij Adjacency matrix
  • ki Coordination number of node i P(k)
  • Clustering coefficient

ki5 ci0.
i
7
Topological quantities
  • aij Adjacency matrix
  • ki Coordination number of node i P(k)
  • Clustering coefficient

ki5 ci0.1
i
8
Topological quantities
Assortativity
ki4 knn,i(3447)/44.5
9
Topological quantities
  • Distances dij
  • Centrality
  • Efficiency
  • Betwenness centrality bci

10
Weights (Edge traffic)
  • Scientific or actors' collaborations

(M. Newman, P.R.E. 2001)
i, j authors/actors k paper/film nk number
of actors/authors 1 if author/actor i has
contributed to paper/film k
  • Internet, emails traffic, number of exchanged
    emails
  • Airports number of passengers for the year 2002

11
Weighted quantities
  • Weights, Edge traffic, P(w)
  • Load or Vertex traffic,
    P(L), L(k) (e.g. number
    of papers/films by a given author/actor)
  • Weighted distances
  • Weighted centrality
  • Weighted efficiency

e.g. on a link ij,
12
Global data analysis
Number of authors 12722 Maximum
coordination number 97 Average coordination
number 6.28 Maximum weight 21.33 Average
weight 0.57 Clustering coefficient 0.65
Pearson coefficient (assortativity) 0.16
Average shortest path 6.83
Number of actors374511 Maximum coordination
number 3956 Average coordination number
80.2 Maximum weight 37.7 Average weight
0.048 Clustering coefficient 0.67 Pearson
coefficient 0.226
Number of airports 3863 Maximum coordination
number 318 Average coordination number
9.74 Maximum weight 6167177. Average weight
74509. Clustering coefficient 0.53 Pearson
coefficient 0.07 Average shortest path 4.37
13
Data analysis P(k), P(L)
knumber of collaborators Lnumber of
papers/films
Airports broad P(k), cf. Guimerà et al. 2003
14
Correlations topology/traffic
  • Vertex traffic vs. Coordination number
  • Vertex traffic vs. Betweenness centrality
  • Coordination number vs. Betweenness centrality
  • ...

15
Vertex traffic vs. Coordination number
L(k) proportional to k
N12722 Largest k 97 Largest L 91
16
Vertex traffic vs. Coordination number
L(k) proportional to kb, b1.2
N374511 Largest k 3956 Largest load 645
17
Vertex traffic vs. Coordination number
L(k) proportional to kb, b1.5 Randomized
weights b1
N3863 Largest k 318 Largest Load 54 123 800
Correlations between topology and dynamics
18
Some new definitions weighted quantities
  • Weighted betweenness centrality bci Li
  • Weighted assortativity
  • Weighted clustering coefficient

19
Weighted clustering coefficient
N.B. other definitions are possible, e.g. wjk
(wijwikwjk)/3.
wik
20
Clustering vs. weighted clustering coefficient
ci0.1
(e.g. with ltwgt1)
21
Clustering vs. weighted clustering coefficient
0.2
ciw0.3 gt ci
ciw0.02 lt ci
ci0.1
(e.g. with ltwgt1)
22
Clustering vs. weighted clustering coefficient
k
(wjk)
wik
j
i
wij
Random(ized) weights C Cw C lt Cw more
weights on cliques C gt Cw less weights on
cliques
23
Clustering and weighted clustering
Scientific collaborations C 0.65, Cw1.01
C(k) lt Cw(k) at small k, C(k) gt Cw(k) at large k
larger weights on small cliques
24
Clustering and weighted clustering
Actor's network C 0.67, Cw 1.44
C(k) lt Cw(k) especially at small k larger
weights on small cliques C(k) close to Cw(k) at
larger k
25
Clustering and weighted clustering
Airports' network C 0.53, Cw1.53
C(k) lt Cw(k) larger weights on cliques at all
scales
26
Assortativity vs. weighted assortativity
i
k2
k3
ki2, knn,i2.5
ki4 knn,i4.5
27
Assortativity vs. weighted assortativity
e.g. ltwgt1
0.5
i
k2
1
2
3
k3
1
10
ki2, knn,iw3.5
ki4 knn,iw22.25
28
Assortativity vs. weighted assortativity
e.g. ltwgt1
3
i
k2
1
10
0.5
k3
1
2
ki2, knn,iw18
ki4 knn,iw5.75
29
Assortativity vs. weighted assortativity
Comparison of knn(k) and knnw(k)
Informations on the correlations between topology
and dynamics
30
Perspectives/ work in progress
  • Analysis of other networks internet, emails ?
  • Weights vs. connectivities
  • More detailed study of new weighted quantities
  • Resilience to damage

31
Data analysis P(k), P(L)
kcoordination L vertex traffic broad
distributions
cf. also Guimerà et al. 2003
32
Note on the exponents
If P(k) and P(L) are power-laws, P(k) dk a k-a
dk P(L) dL a L-g dL and L a kb then b
(g - 1) a - 1
NB -true for the actors' network and for the
airports' network -for randomized weights
b1 and one finds indeed ga
33
Betweenness vs. Vertex Traffic
  • Correlations
  • Large fluctuations

(Red 0.1BC lt bci lt 10 BC)
(Similar plot for the airports' network)
(Scientific collaborations loadnumber of papers)
34
Betwenness centrality
Number of shortest paths from j to k
Number of shortest paths from j to k passing
through i
(traffic)
(topology)
larger fluctuations at small values
35
How to characterize the centrality?
Coordination number Betwenness centrality Centrali
ty/efficiency Weighted centrality/efficiency Verte
x traffic
All these quantities are statistically correlated
but can give very different rankings !
Cf also www.santafe.edu/mark/collaboration/ M.
Newman, P.R.E. 2001Amaral et al., preprint 2003
36
Example various rankings of airports
Coordination
Vertex traffic
BC
Weighted centrality
1 Frankfurt 2 Paris-CDG 3
Munich 4 Amsterdam 5 Atlanta 6
London-Heathrow 7 Chicago (O'Hare) 8
Duesseldorf 9 Vienna 10 Brussels 11 Dallas
Ft. Worth 12 Houston
Atlanta Chicago (O'Hare) London-Heathrow
Tokyo-Haneda Los Angeles Dallas Ft. Worth
Paris-CDG Frankfurt Phoenix Denver Hong
Kong Detroit
Frankfurt Paris-CDG Anchorage Tokyo-Narita Port
Moresby London-Heathrow Los Angeles Singapore Vanc
ouver Bangkok Johannesburg Toronto
London-Heathrow Los Angeles Chicago (O'Hare) New
York(Kennedy) Paris-CDG Tokyo-Narita Singapore San
Francisco Hong Kong Las Vegas Dublin Frankfurt

(cf also Guimerà et al., preprint 2003)
Write a Comment
User Comments (0)
About PowerShow.com