The diameter of a scale-free random graph

Combinatorica

Volumn 24, Issue 1, 2004, Pages 5-34

  Bollobás, Béla ^a,b   Riordan, Oliver ^b  

^a University of Memphis   (United States)

^b TRINITY COLLEGE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 2542530739     PISSN: 02099683     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00493-004-0002-2     Document Type: Article

References (29)

1. R. ALBERT, H. JEONG and A.-L. BARABÁSI: Diameter of the world-wide web, Nature 401 (1999), 130-131.
2. R. ALBERT, H. JEONG and A.-L. BARABÁSI: Error and attack tolerance of complex networks, Nature 406 (2000), 378-382.
3. A.-L. BARABÁSI and R. ALBERT: Emergence of scaling in random networks, Science 286 (1999), 509-512.
4. A.-L. BARABÁSI, R. ALBERT and H. JEONG: Mean-field theory for scale-free random networks, Physica A 272 (1999), 173-187.
5. A.-L. BARABÁSI, R. ALBERT and H. JEONG: Scale-free characteristics of random networks: the topology of the world-wide web, Physica A 281 (2000), 69-77.
6. B. BOLLOBÁS: The diameter of random graphs, Trans. Amer. Math. Soc. 267 (1981), 41-52.
7. B. BOLLOBÁS: Random Graphs, Second Edition, Cambridge studies in advanced mathematics, vol. 73, Cambridge University Press, Cambridge, 2001, xviii + 498 pp.
8. B. BOLLOBÁS and F. R. K. CHUNG: The diameter of a cycle plus a random matching, SIAM J. Discrete Math. 1 (1988), 328-333.
9. B. BOLLOBÁS and W. FERNANDEZ DE LA VEGA: The diameter of random regular graphs, Combinatorica 2 (1982), 125-134.
10. B. BOLLOBÁS and V. KLEE: Diameters of random bipartite graphs, Combinatorica 4 (1984), 7-19.
11. B. BOLLOBÁS and O. M. RIORDAN: Linearized chord diagrams and an upper bound for Vassiliev invariants, J. Knot Theory Ramifications 9 (2000), 847-853.
12. B. BOLLOBÁS, O. M. RIORDAN, J. SPENCER and G. TUSNÁDY: The degree sequence of a scale-free random graph process, Random Structures and Algorithms 18 (2001), 279-290.
13. JU. D. BURTIN: Asymptotic estimates of the diameter and the independence and domination numbers of a random graph, Dokl. Akad. Nauk SSSR 209 (1973), 765-768, translated in Soviet Math. Dokl. 14 (1973), 497-501.
14. JU. D. BURTIN: Asymptotic estimates of the diameter and the independence and domination numbers of a random graph, Dokl. Akad. Nauk SSSR 209 (1973), 765-768, translated in Soviet Math. Dokl. 14 (1973), 497-501.
15. JU. D. BURTIN: Extremal metric characteristics of a random graph. I, Teor. Verojatnost. i Primenen. 19 (1974), 740-754.
16. H. CHERNOFF: A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations, Ann. Math. Statistics 23 (1952) 493-507.
17. L. DEVROYE: Branching processes and their applications in the analysis of tree structures and tree algorithms, in Probabilistic methods for algorithmic discrete mathematics, Algorithms Combin. 16 (1998), 249-314.
18. S. JANSON: On concentration of probability, in Contemporary Combinatorics, Bolyai Soc. Math. Stud. 10, B. Bollobás ed., pp. 289-301.
19. V. KLEE and D. G. LARMAN: Diameters of random graphs, Canad. J. Math. 33 (1981), 618-640.
20. V. KLEE, D. G. LARMAN AND E. M. WRIGHT: The diameter of almost all bipartite graphs, Studia Sci. Math. Hungar. 15 (1980), 39-43.
21. J. KLEINBERG: The small-world phenomenon: an algorithmic perspective, Cornell Computer Science Technical Report 99-1776 (October 1999).
22. H. M. MAHMOUD, R. T. SMYTHE and J. SZYMAŃSKI: On the structure of random plane-oriented recursive trees and their branches, Random Structures and Algorithms 4 (1993), 151-176.
23. H. M. MAHMOUD and R. T. SMYTHE: A survey of recursive trees, Th. of Probability and Math. Statistics 51 (1995), 1-27.
24. M. E. J. NEWMAN, S. H. STROGATZ and D. J. WATTS: Random graphs with arbitrary degree distribution and their applications, Physical Review E 64 (2001), 026118.
25. B. PITTEL: Note on the heights of random recursive trees and random m-ary search trees, Random Structures and Algorithms 5 (1994), 337-347.
26. d, in Random walks (Budapest, 1998), Bolyai Soc. Math. Stud. 9 (1999), 299-348.
27. A. STOIMENOW: Enumeration of chord diagrams and an upper bound for Vassiliev invariants, J. Knot Theory Ramifications 7 (1998), 93-114.
28. J. SZYMAŃSKI: On a nonuniform random recursive tree, Annals of Discrete Math. 33 (1987), 297-306.
29. D. J. WATTS and S. H. STROGATZ: Collective dynamics of 'small-world' networks, Nature 393 (1998), 440-442.