Emergence of scale-free behavior in networks from limited-horizon linking and cost trade-offs

Physica A: Statistical Mechanics and its Applications

Volumn 387, Issue 4, 2008, Pages 1016-1024

  Barbosa, Valmir C ^a   Donangelo, Raul ^a   Souza, Sergio R ^a,b  

^a FEDERAL UNIVERSITY OF RIO DE JANEIRO   (Brazil)

^b FEDERAL UNIVERSITY OF RIO GRANDE DO SUL   (Brazil)

Author keywords

Complex networks; Geometric constraints; Scale free behavior

Indexed keywords

COMPUTATIONAL GEOMETRY; CONSTRAINT THEORY; COST BENEFIT ANALYSIS; PARAMETER ESTIMATION; RANDOM PROCESSES;

COMPLEX NETWORKS; GEOMETRIC CONSTRAINTS; MULTIPLICATIVE PARAMETERS; SCALE FREE BEHAVIOR;

LARGE SCALE SYSTEMS;

EID: 36649007295     PISSN: 03784371     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.physa.2007.09.048     Document Type: Article

References (23)

1. Bollobás B. Random Graphs. 2nd edition (2001), Cambridge University Press, Cambridge, UK
2. In: Bornholdt S., and Schuster H.G. (Eds). Handbook of Graphs and Networks (2003), Wiley-VCH, Weinheim, Germany
3. In: Newman M., Barabási A.-L., and Watts D.J. (Eds). The Structure and Dynamics of Networks (2006), Princeton University Press, Princeton, NJ
4. Boccaletti S., Latora V., Moreno Y., Chavez M., and Hwang D.-U. Complex networks: Structure and dynamics. Phys. Rep. 424 (2006) 175-308
5. Barabási A.-L., and Albert R. Emergence of scaling in random networks. Science 286 (1999) 509-512
6. Barabási A.-L., Albert R., and Jeong H. Mean-field theory for scale-free random networks. Physica A 272 (1999) 173-187
7. Dorogovtsev S.N., Mendes J.F.F., and Samukhin A.N. Structure of growing networks with preferential linking. Phys. Rev. Lett. 85 (2000) 4633
8. Krapivsky P.L., Redner S., and Leyvraz F. Connectivity of growing random networks. Phys. Rev. Lett. 85 (2000) 4629-4632
9. Holme P., and Kim B.J. Growing scale-free networks with tunable clustering. Phys. Rev. E 65 (2002) 026107
10. Bollobás B., and Riordan O.M. Mathematical results on scale-free random graphs. In: Bornholdt S., and Schuster H.G. (Eds). Handbook of Graphs and Networks (2003), Wiley-VCH, Weinheim, Germany 1-34
11. Cooper C., and Frieze A. A general model of web graphs. Random Structures Algorithms 22 (2003) 311-335
12. Bollobás B., and Riordan O.M. The diameter of a scale-free random graph. Combinatorica 24 (2004) 5-34
13. Barbosa V.C., Donangelo R., and Souza S.R. Emergence of scale-free networks from local connectivity and communication trade-offs. Phys. Rev. E 74 (2006) 016113
14. Kumar R., Raghavan P., Rajagopalan S., Sivakumar D., Tomkins A., and Upfal E. Stochastic models for the web graph. Proceedings of the Forty-First IEEE Symposium on Foundations of Computer Science (2000), IEEE Computer Society, Los Alamitos, CA 57-65
15. Caldarelli G., Capocci A., De Los Rios P., and Muñoz M.A. Scale-free networks from varying vertex intrinsic fitness. Phys. Rev. Lett. 89 (2002) 258702
16. Rosvall M., and Sneppen K. Modeling dynamics of information networks. Phys. Rev. Lett. 91 (2003) 178701
17. Dall J., and Christensen M. Random geometric graphs. Phys. Rev. E 66 (2002) 016121
18. Penrose M. Random Geometric Graphs (2003), Oxford University Press, Oxford, UK
19. Erdo{double acute}s P., and Rényi A. On random graphs. Publ. Mat. 6 (1959) 290-297
20. Xulvi-Brunet R., and Sokolov I.M. Growing networks under geographical constraints. Phys. Rev. E 75 (2007) 046117
21. Cormen T.H., Leiserson C.E., Rivest R.L., and Stein C. Introduction to Algorithms. 2nd edition (2001), The MIT Press, Cambridge, MA
22. Molloy M., and Reed B. A critical point for random graphs with a given degree sequence. Random Structures Algorithms 6 (1995) 161-180
23. Newman M.E.J., Strogatz S.H., and Watts D.J. Random graphs with arbitrary degree distributions and their applications. Phys. Rev. E 64 (2001) 026118