Weighted networks: analysis, modeling A. Barrat, LPT, Université ...
Transcript of Weighted networks: analysis, modeling A. Barrat, LPT, Université ...
![Page 1: Weighted networks: analysis, modeling A. Barrat, LPT, Université ...](https://reader031.fdocuments.us/reader031/viewer/2022022415/5850ecd01a28abfa398b83f6/html5/thumbnails/1.jpg)
Weighted networks: analysis, modeling
A. Barrat, LPT, Université Paris-Sud, France
M. Barthélemy (CEA, France)R. Pastor-Satorras (Barcelona, Spain)A. Vespignani (LPT, France)
cond-mat/0311416 PNAS 101 (2004) 3747cond-mat/0401057 PRL 92 (2004) 228701cs.NI/0405070
http://www.th.u-psud.fr/page_perso/Barrat
![Page 2: Weighted networks: analysis, modeling A. Barrat, LPT, Université ...](https://reader031.fdocuments.us/reader031/viewer/2022022415/5850ecd01a28abfa398b83f6/html5/thumbnails/2.jpg)
●Complex networks: examples, models, topological correlations
●Weighted networks: ●examples, empirical analysis●new metrics: weighted correlations●a model for weighted networks
●Perspectives
Plan of the talk
![Page 3: Weighted networks: analysis, modeling A. Barrat, LPT, Université ...](https://reader031.fdocuments.us/reader031/viewer/2022022415/5850ecd01a28abfa398b83f6/html5/thumbnails/3.jpg)
Examples of complex networks
● Internet● WWW● Transport networks● Power grids● Protein interaction networks● Food webs● Metabolic networks● Social networks● ...
![Page 4: Weighted networks: analysis, modeling A. Barrat, LPT, Université ...](https://reader031.fdocuments.us/reader031/viewer/2022022415/5850ecd01a28abfa398b83f6/html5/thumbnails/4.jpg)
Connectivity distribution P(k) = probability that a node has k links
Usual random graphs: Erdös-Renyi model (1960)
BUT...
N points, links with proba p:static random graphs
![Page 5: Weighted networks: analysis, modeling A. Barrat, LPT, Université ...](https://reader031.fdocuments.us/reader031/viewer/2022022415/5850ecd01a28abfa398b83f6/html5/thumbnails/5.jpg)
Airplane route network
![Page 6: Weighted networks: analysis, modeling A. Barrat, LPT, Université ...](https://reader031.fdocuments.us/reader031/viewer/2022022415/5850ecd01a28abfa398b83f6/html5/thumbnails/6.jpg)
CAIDA AS cross section map
![Page 7: Weighted networks: analysis, modeling A. Barrat, LPT, Université ...](https://reader031.fdocuments.us/reader031/viewer/2022022415/5850ecd01a28abfa398b83f6/html5/thumbnails/7.jpg)
Scale-free properties
P(k) = probability that a node has k links
P(k) ~ k - ( 3)
• <k>= const• <k2>
Diverging fluctuations
•The Internet and the World-Wide-Web•Protein networks•Metabolic networks•Social networks•Food-webs and ecological networks
Are Heterogeneous networks
Topological characterization
![Page 8: Weighted networks: analysis, modeling A. Barrat, LPT, Université ...](https://reader031.fdocuments.us/reader031/viewer/2022022415/5850ecd01a28abfa398b83f6/html5/thumbnails/8.jpg)
Models for growing scale-free graphs
Barabási and Albert, 1999: growth + preferential attachment
P(k) ~ k -3
Generalizations and variations:Non-linear preferential attachment : (k) ~ k
Initial attractiveness : (k) ~ A+k
Highly clustered networksFitness model: (k) ~ iki
Inclusion of space
Redner et al. 2000, Mendes et al. 2000, Albert et al. 2000, Dorogovtsev et al. 2001, Bianconi et al. 2001, Barthélemy 2003, etc...
(....) => many available models
P(k) ~ k -
![Page 9: Weighted networks: analysis, modeling A. Barrat, LPT, Université ...](https://reader031.fdocuments.us/reader031/viewer/2022022415/5850ecd01a28abfa398b83f6/html5/thumbnails/9.jpg)
Topological correlations: clustering
i
ki=5ci=0.ki=5ci=0.1
aij: Adjacency matrix
![Page 10: Weighted networks: analysis, modeling A. Barrat, LPT, Université ...](https://reader031.fdocuments.us/reader031/viewer/2022022415/5850ecd01a28abfa398b83f6/html5/thumbnails/10.jpg)
Topological correlations: assortativity
ki=4knn,i=(3+4+4+7)/4=4.5
i
k=3k=7
k=4k=4
![Page 11: Weighted networks: analysis, modeling A. Barrat, LPT, Université ...](https://reader031.fdocuments.us/reader031/viewer/2022022415/5850ecd01a28abfa398b83f6/html5/thumbnails/11.jpg)
Assortativity
● Assortative behaviour: growing knn(k)Example: social networks
Large sites are connected with large sites
● Disassortative behaviour: decreasing knn(k)Example: internet
Large sites connected with small sites, hierarchical structure
![Page 12: Weighted networks: analysis, modeling A. Barrat, LPT, Université ...](https://reader031.fdocuments.us/reader031/viewer/2022022415/5850ecd01a28abfa398b83f6/html5/thumbnails/12.jpg)
Beyond topology: Weighted networks
● Internet● Emails● Social networks● Finance, economic networks (Garlaschelli et al. 2003)● Metabolic networks (Almaas et al. 2004)● Scientific collaborations (Newman 2001)● Airports' network*● ...
*: data from IATA www.iata.org
are weighted heterogeneous networks,
with broad distributions of weights
![Page 13: Weighted networks: analysis, modeling A. Barrat, LPT, Université ...](https://reader031.fdocuments.us/reader031/viewer/2022022415/5850ecd01a28abfa398b83f6/html5/thumbnails/13.jpg)
Weights
● Scientific collaborations:
i, j: authors; k: paper; nk: number of authors
: 1 if author i has contributed to paper k
(Newman, P.R.E. 2001)
●Internet, emails: traffic, number of exchanged emails●Airports: number of passengers for the year 2002●Metabolic networks: fluxes●Financial networks: shares
![Page 14: Weighted networks: analysis, modeling A. Barrat, LPT, Université ...](https://reader031.fdocuments.us/reader031/viewer/2022022415/5850ecd01a28abfa398b83f6/html5/thumbnails/14.jpg)
Weighted networks: data
●Scientific collaborations: cond-mat archive; N=12722 authors, 39967 links
●Airports' network: data by IATA; N=3863 connected airports, 18807 links
![Page 15: Weighted networks: analysis, modeling A. Barrat, LPT, Université ...](https://reader031.fdocuments.us/reader031/viewer/2022022415/5850ecd01a28abfa398b83f6/html5/thumbnails/15.jpg)
Global data analysis
Number of authors 12722 Maximum coordination number 97Average coordination number 6.28Maximum weight 21.33Average weight 0.57 Clustering coefficient 0.65 Pearson coefficient (assortativity) 0.16 Average shortest path 6.83
Number of airports 3863Maximum coordination number 318Average coordination number 9.74Maximum weight 6167177.Average weight 74509.Clustering coefficient 0.53Pearson coefficient 0.07Average shortest path 4.37
![Page 16: Weighted networks: analysis, modeling A. Barrat, LPT, Université ...](https://reader031.fdocuments.us/reader031/viewer/2022022415/5850ecd01a28abfa398b83f6/html5/thumbnails/16.jpg)
Data analysis: P(k), P(s)
Generalization of ki: strength
Broad distributions
![Page 17: Weighted networks: analysis, modeling A. Barrat, LPT, Université ...](https://reader031.fdocuments.us/reader031/viewer/2022022415/5850ecd01a28abfa398b83f6/html5/thumbnails/17.jpg)
Correlations topology/traffic Strength vs. Coordination
S(k) proportional to k
N=12722Largest k: 97Largest s: 91
![Page 18: Weighted networks: analysis, modeling A. Barrat, LPT, Université ...](https://reader031.fdocuments.us/reader031/viewer/2022022415/5850ecd01a28abfa398b83f6/html5/thumbnails/18.jpg)
S(k) proportional to k=1.5
Randomized weights: =1
N=3863Largest k: 318Largest strength: 54 123 800
Strong correlations between topology and dynamics
Correlations topology/traffic Strength vs. Coordination
![Page 19: Weighted networks: analysis, modeling A. Barrat, LPT, Université ...](https://reader031.fdocuments.us/reader031/viewer/2022022415/5850ecd01a28abfa398b83f6/html5/thumbnails/19.jpg)
Correlations topology/traffic Weights vs. Coordination
See also Macdonald et al., cond-mat/0405688
wij ~ (kikj)si = wij ; s(k) ~ k
WAN: no degree correlations => = 1 + SCN:
![Page 20: Weighted networks: analysis, modeling A. Barrat, LPT, Université ...](https://reader031.fdocuments.us/reader031/viewer/2022022415/5850ecd01a28abfa398b83f6/html5/thumbnails/20.jpg)
Some new definitions: weighted metrics
● Weighted clustering coefficient
● Weighted assortativity
![Page 21: Weighted networks: analysis, modeling A. Barrat, LPT, Université ...](https://reader031.fdocuments.us/reader031/viewer/2022022415/5850ecd01a28abfa398b83f6/html5/thumbnails/21.jpg)
Clustering vs. weighted clustering coefficient
si=16ci
w=0.625 > ci
ki=4ci=0.5
si=8ci
w=0.25 < ci
wij=1
wij=5
i i
![Page 22: Weighted networks: analysis, modeling A. Barrat, LPT, Université ...](https://reader031.fdocuments.us/reader031/viewer/2022022415/5850ecd01a28abfa398b83f6/html5/thumbnails/22.jpg)
Clustering vs. weighted clustering coefficient
Random(ized) weights: C = Cw
C < Cw : more weights on cliques
C > Cw : less weights on cliques
ij
k(wjk)
wij
wik
![Page 23: Weighted networks: analysis, modeling A. Barrat, LPT, Université ...](https://reader031.fdocuments.us/reader031/viewer/2022022415/5850ecd01a28abfa398b83f6/html5/thumbnails/23.jpg)
Clustering and weighted clusteringScientific collaborations: C= 0.65, Cw ~ C
C(k) ~ Cw(k) at small k, C(k) < Cw(k) at large k: larger weights on large cliques
![Page 24: Weighted networks: analysis, modeling A. Barrat, LPT, Université ...](https://reader031.fdocuments.us/reader031/viewer/2022022415/5850ecd01a28abfa398b83f6/html5/thumbnails/24.jpg)
Clustering and weighted clustering
Airports' network: C= 0.53, Cw=1.1 C
C(k) < Cw(k): larger weights on cliques at all scales
![Page 25: Weighted networks: analysis, modeling A. Barrat, LPT, Université ...](https://reader031.fdocuments.us/reader031/viewer/2022022415/5850ecd01a28abfa398b83f6/html5/thumbnails/25.jpg)
Assortativity vs. weighted assortativity
ki=5; knn,i=1.8
5
11
1
1
1
55
5
5i
![Page 26: Weighted networks: analysis, modeling A. Barrat, LPT, Université ...](https://reader031.fdocuments.us/reader031/viewer/2022022415/5850ecd01a28abfa398b83f6/html5/thumbnails/26.jpg)
Assortativity vs. weighted assortativity
ki=5; si=21; knn,i=1.8 ; knn,iw=1.2: knn,i > knn,i
w
1
55
5
5i
![Page 27: Weighted networks: analysis, modeling A. Barrat, LPT, Université ...](https://reader031.fdocuments.us/reader031/viewer/2022022415/5850ecd01a28abfa398b83f6/html5/thumbnails/27.jpg)
Assortativity vs. weighted assortativity
ki=5; si=9; knn,i=1.8 ; knn,iw=3.2: knn,i < knn,i
w
511
1
1i
![Page 28: Weighted networks: analysis, modeling A. Barrat, LPT, Université ...](https://reader031.fdocuments.us/reader031/viewer/2022022415/5850ecd01a28abfa398b83f6/html5/thumbnails/28.jpg)
Assortativity and weighted assortativity
Airports' network
knn(k) < knnw(k): larger weights between large nodes
![Page 29: Weighted networks: analysis, modeling A. Barrat, LPT, Université ...](https://reader031.fdocuments.us/reader031/viewer/2022022415/5850ecd01a28abfa398b83f6/html5/thumbnails/29.jpg)
Assortativity and weighted assortativity
Scientific collaborations
knn(k) < knnw(k): larger weights between large nodes
![Page 30: Weighted networks: analysis, modeling A. Barrat, LPT, Université ...](https://reader031.fdocuments.us/reader031/viewer/2022022415/5850ecd01a28abfa398b83f6/html5/thumbnails/30.jpg)
Non-weighted vs. Weighted:
Comparison of knn(k) and knnw(k), of C(k) and Cw(k)
Informations on the correlations between topology and dynamics
![Page 31: Weighted networks: analysis, modeling A. Barrat, LPT, Université ...](https://reader031.fdocuments.us/reader031/viewer/2022022415/5850ecd01a28abfa398b83f6/html5/thumbnails/31.jpg)
A model of growing weighted network
S.H. Yook, H. Jeong, A.-L. Barabási, Y. Tu, P.R.L. 86, 5835 (2001)
● Peaked probability distribution for the weights● Same universality class as unweighted network
●Growing networks with preferential attachment●Weights on links, driven by network connectivity●Static weights
See also Zheng et al. Phys. Rev. E (2003)
![Page 32: Weighted networks: analysis, modeling A. Barrat, LPT, Université ...](https://reader031.fdocuments.us/reader031/viewer/2022022415/5850ecd01a28abfa398b83f6/html5/thumbnails/32.jpg)
A new model of growing weighted network
• Growth: at each time step a new node is added with m links to be connected with previous nodes
• Preferential attachment: the probability that a new link is connected to a given node is proportional to the node’s strength
The preferential attachment follows the probability distribution :
Preferential attachment driven by weights
AND...
![Page 33: Weighted networks: analysis, modeling A. Barrat, LPT, Université ...](https://reader031.fdocuments.us/reader031/viewer/2022022415/5850ecd01a28abfa398b83f6/html5/thumbnails/33.jpg)
Redistribution of weights
New node: n, attached to iNew weight wni=w0=1Weights between i and its other neighbours:
si si + w0 +
The new traffic n-i increases the traffic i-j
Onlyparameter
n i
j
![Page 34: Weighted networks: analysis, modeling A. Barrat, LPT, Université ...](https://reader031.fdocuments.us/reader031/viewer/2022022415/5850ecd01a28abfa398b83f6/html5/thumbnails/34.jpg)
Evolution equations (mean-field)
Also: evolution of weights
![Page 35: Weighted networks: analysis, modeling A. Barrat, LPT, Université ...](https://reader031.fdocuments.us/reader031/viewer/2022022415/5850ecd01a28abfa398b83f6/html5/thumbnails/35.jpg)
Analytical results
Power law distributions for k, s and w:P(k) ~ k ; P(s)~s
Correlations topology/weights:wij ~ min(ki,kj)a , a=2/(2+1)
•power law growth of s
•k proportional to s
![Page 36: Weighted networks: analysis, modeling A. Barrat, LPT, Université ...](https://reader031.fdocuments.us/reader031/viewer/2022022415/5850ecd01a28abfa398b83f6/html5/thumbnails/36.jpg)
Numerical results
![Page 37: Weighted networks: analysis, modeling A. Barrat, LPT, Université ...](https://reader031.fdocuments.us/reader031/viewer/2022022415/5850ecd01a28abfa398b83f6/html5/thumbnails/37.jpg)
Numerical results: P(w), P(s)
(N=105)
![Page 38: Weighted networks: analysis, modeling A. Barrat, LPT, Université ...](https://reader031.fdocuments.us/reader031/viewer/2022022415/5850ecd01a28abfa398b83f6/html5/thumbnails/38.jpg)
Numerical results: weights
wij ~ min(ki,kj)a
![Page 39: Weighted networks: analysis, modeling A. Barrat, LPT, Université ...](https://reader031.fdocuments.us/reader031/viewer/2022022415/5850ecd01a28abfa398b83f6/html5/thumbnails/39.jpg)
Numerical results: assortativity
analytics: knn proportional to k(
![Page 40: Weighted networks: analysis, modeling A. Barrat, LPT, Université ...](https://reader031.fdocuments.us/reader031/viewer/2022022415/5850ecd01a28abfa398b83f6/html5/thumbnails/40.jpg)
Numerical results: assortativity
![Page 41: Weighted networks: analysis, modeling A. Barrat, LPT, Université ...](https://reader031.fdocuments.us/reader031/viewer/2022022415/5850ecd01a28abfa398b83f6/html5/thumbnails/41.jpg)
Numerical results: clustering
analytics: C(k) proportional to k(
![Page 42: Weighted networks: analysis, modeling A. Barrat, LPT, Université ...](https://reader031.fdocuments.us/reader031/viewer/2022022415/5850ecd01a28abfa398b83f6/html5/thumbnails/42.jpg)
Numerical results: clustering
![Page 43: Weighted networks: analysis, modeling A. Barrat, LPT, Université ...](https://reader031.fdocuments.us/reader031/viewer/2022022415/5850ecd01a28abfa398b83f6/html5/thumbnails/43.jpg)
Extensions of the model: (i)-heterogeneities
Random redistribution parameter i (i.i.d. with ) self-consistent analytical solution
(in the spirit of the fitness model, cf. Bianconi and Barabási 2001)
Results• si(t) grows as ta(
i)
• s and k proportional• broad distributions of k and s • same kind of correlations
![Page 44: Weighted networks: analysis, modeling A. Barrat, LPT, Université ...](https://reader031.fdocuments.us/reader031/viewer/2022022415/5850ecd01a28abfa398b83f6/html5/thumbnails/44.jpg)
Extensions of the model: (i)-heterogeneities
late-comers can grow faster
![Page 45: Weighted networks: analysis, modeling A. Barrat, LPT, Université ...](https://reader031.fdocuments.us/reader031/viewer/2022022415/5850ecd01a28abfa398b83f6/html5/thumbnails/45.jpg)
Extensions of the model: (i)-heterogeneities
Uniform distributions of
![Page 46: Weighted networks: analysis, modeling A. Barrat, LPT, Université ...](https://reader031.fdocuments.us/reader031/viewer/2022022415/5850ecd01a28abfa398b83f6/html5/thumbnails/46.jpg)
Extensions of the model: (i)-heterogeneities
Uniform distributions of
![Page 47: Weighted networks: analysis, modeling A. Barrat, LPT, Université ...](https://reader031.fdocuments.us/reader031/viewer/2022022415/5850ecd01a28abfa398b83f6/html5/thumbnails/47.jpg)
Extensions of the model: (ii)-non-linearities
n i
j
New node: n, attached to iNew weight wni=w0=1Weights between i and its other neighbours:
Examplewij = (wij/si)(s0 tanh(si/s0))a
i increases with si; saturation effect at s0
wij = f(wij,si,ki)
![Page 48: Weighted networks: analysis, modeling A. Barrat, LPT, Université ...](https://reader031.fdocuments.us/reader031/viewer/2022022415/5850ecd01a28abfa398b83f6/html5/thumbnails/48.jpg)
Extensions of the model: (ii)-non-linearities
s prop. to k with > 1
N=5000s0=104
wij = (wij/si)(s0 tanh(si/s0))a
Broad P(s) and P(k) with different exponents
![Page 49: Weighted networks: analysis, modeling A. Barrat, LPT, Université ...](https://reader031.fdocuments.us/reader031/viewer/2022022415/5850ecd01a28abfa398b83f6/html5/thumbnails/49.jpg)
Summary/ Perspectives/ Work in progress
•Empirical analysis of weighted networksweights heterogeneitiescorrelations weights/topologynew metrics to quantify these correlations
•New model of growing network which couples topology and weightsanalytical+numerical studybroad distributions of weights, strengths, connectivitiesextensions of the model
randomness, non linearitiesspatial network: work in progressother ?
•Influence of weights on the dynamics on the networks: work in progress