Degree distribution of the FKP network model

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2719, Issue , 2003, Pages 725-738

  Berger, Noam ^a   Bollobás, Béla ^b,c,e   Borgs, Christian ^d   Chayes, Jennifer ^d   Riordan, Oliver ^c,e  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b University of Memphis   (United States)

^c TRINITY COLLEGE   (United Kingdom)

^d MICROSOFT RESEARCH   (United States)

^e Department of Pure Mathematics ^*  (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ECONOMIC AND SOCIAL EFFECTS;

DEGREE DISTRIBUTIONS; DEGREE SEQUENCE; EXPONENTIAL DECAYS; INTERNET MODELS; NETWORK MODELING; RELATIVE STRENGTH; SIMPLE MODELING; SINGLE PARAMETER;

INTERNET;

EID: 35248850625     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45061-0_57     Document Type: Article

References (13)

1. R. Albert and A.-L. Barabási, Statistical mechanics of complex networks, Rev. Mod. Phys. 74 (2002), 47-97.
2. A.-L. Barabási and R. Albert, Emergence of scaling in random networks, Science 286 (1999), 509-512.
3. B. Bollobás and O.M. Riordan, The diameter of a scale-free random graph, to appear in Combinatorial. (Preprint available from http://www.dpmms.cam.ac.uk/∼omr 10/.)
4. B. Bollobás and O. Riordan, Mathematical results on scale-free random graphs, in Handbook of Graphs and Networks, Stefan Bornholdt and Heinz Georg Schuster (eds.), Wiley-VCH, Weinheim (2002), 1-34.
5. J.M. Carlson and J. Doyle, Highly optimized tolerance: a mechanism for power laws in designed systems. Phys. Rev. E 60 (1999), 1412-1427.
6. S.N. Dorogovtsev and J.F.F. Mendes, Evolution of networks, Adv. Phys. 51 (2002), 1079.
7. A. Fabrikant, E. Koutsoupias and C.H. Papadimitriou, Heuristically optimized trade-offs: a new paradigm for power laws in the internet ICALP 2002, LNCS 2380, pp. 110-122.
8. M. Faloutsos, P. Faloutsos and C. Faloutsos, On power-law relationships of the internet topology, SIGCOMM 1999, Comput. Commun. Rev. 29 (1999), 251.
9. R. Kumar, P. Raghavan, S. Rajagopalan, D. Sivakumar, A. Tomkins and E. Upfal, Stochastic models for the web graph, FOCS 2000.
10. H.M. Mahmoud and R.T. Smythe, A survey of recursive trees, Th. of Probability and Math. Statistics 51 (1995), 1-27.
11. M.D. Penrose, A strong law for the largest nearest-neighbour link between random points, J. London Math. Soc. (2) 60 (1999), 951-960.
12. M.D. Penrose, A strong law for the longest edge of the minimal spanning tree. Ann. Probab. 27 (1999), 246-260.
13. B. Pittel, Note on the heights of random recursive trees and random m-ary search trees, Random Struct. Alg. 6 (1994), 337-347.