Emergence of tempered preferential attachment from optimization

被引:75
作者
D'Souza, Raissa M. [1 ]
Borgs, Christian
Chayes, Jennifer T.
Berger, Noam
Kleinberg, Robert D.
机构
[1] Univ Calif Davis, Dept Mech & Aeronaut Engn, Davis, CA 95616 USA
[2] Univ Calif Los Angeles, Dept Math, Los Angeles, CA 90095 USA
[3] Microsoft Corp, Res, Redmond, WA 98052 USA
[4] Cornell Univ, Dept Comp Sci, Ithaca, NY 14853 USA
关键词
D O I
10.1073/pnas.0606779104
中图分类号
O [数理科学和化学]; P [天文学、地球科学]; Q [生物科学]; N [自然科学总论];
学科分类号
07 ; 0710 ; 09 ;
摘要
We show how preferential attachment can emerge in an optimization framework, resolving a long-standing theoretical controversy. We also show that the preferential attachment model so obtained has two novel features, saturation and viability, which have natural interpretations in the underlying network and lead to a power-law degree distribution with exponential cutoff. Moreover, we consider a generalized version of this preferential attachment model with independent saturation and viability, leading to a broader class of power laws again with exponential cutoff. We present a collection of empirical observations from social, biological, physical, and technological networks, for which such degree distributions give excellent fits. We suggest that, in general, optimization models that give rise to preferential attachment with saturation and viability effects form a good starting point for the analysis of many networks.
引用
收藏
页码:6112 / 6117
页数:6
相关论文
共 39 条
[1]   Classes of small-world networks [J].
Amaral, LAN ;
Scala, A ;
Barthélémy, M ;
Stanley, HE .
PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA, 2000, 97 (21) :11149-11152
[2]  
[Anonymous], 2005, STOC 05: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing, DOI DOI 10.1145/1060590
[3]   Emergence of scaling in random networks [J].
Barabási, AL ;
Albert, R .
SCIENCE, 1999, 286 (5439) :509-512
[4]   Degree distribution of competition-induced preferential attachment graphs [J].
Berger, N ;
Borgs, C ;
Chayes, JT ;
D'Souza, RM ;
Kleinberg, RD .
COMBINATORICS PROBABILITY & COMPUTING, 2005, 14 (5-6) :697-721
[5]  
Berger N, 2004, LECT NOTES COMPUT SC, V3142, P208
[6]   A duplication growth model of gene expression networks [J].
Bhan, A ;
Galas, DJ ;
Dewey, TG .
BIOINFORMATICS, 2002, 18 (11) :1486-1493
[7]   The degree sequence of a scale-free random graph process [J].
Bollobás, B ;
Riordan, O ;
Spencer, J ;
Tusnády, G .
RANDOM STRUCTURES & ALGORITHMS, 2001, 18 (03) :279-290
[8]   The simultaneous evolution of author and paper networks [J].
Börner, K ;
Maru, JT ;
Goldstone, RL .
PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA, 2004, 101 :5266-5273
[9]   Popularity based random graph models leading to a scale-free degree sequence [J].
Buckley, PG ;
Osthus, D .
DISCRETE MATHEMATICS, 2004, 282 (1-3) :53-68
[10]   Highly optimized tolerance: A mechanism for power laws in designed systems [J].
Carlson, JM ;
Doyle, J .
PHYSICAL REVIEW E, 1999, 60 (02) :1412-1427