Towards a theory of scale-free graphs: Definition, properties, and implications

Internet Mathematics

Volumn 2, Issue 4, 2005, Pages 431-523

  Li, Lun ^a   Alderson, David ^a   Doyle, John C ^a   Willinger, Walter ^b  

^a California Institute of Technology   (United States)

^b AT AND T LABS RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84924181828     PISSN: 15427951     EISSN: None     Source Type: Journal    
DOI: 10.1080/15427951.2005.10129111     Document Type: Article

References (110)

1. D. Achlioptas, A. Clauset, D. Kempe, and C. Moore. "On the Bias of Traceroute Sampling; or, Power-Law Degree Distributions in Regular Graphs." In Proceedings of the Thirty-Seventh Annual ACM Symposium on Theory of Computing, pp. 694–703. New York: ACM Press, 2005.
2. W. Aiello, F. Chung, and L. Lu. "A Random Graph Model for Massive Graphs." In Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, pp. 171–180. New York: ACM Press, 2000.
3. W. Aiello, F. Chung, and L. Lu. "Random Evolution in Massive Graphs." In Handbook on Massive Data Sets, edited by J. Abello et al., pp. 97–122, Massive Computing 4. Berlin: Spinger, 2002.
4. R. Albert and A-L. Barabási. "Statistical Mechanics of Complex Networks." Reviews of Modern Physics 74:1 (2002), 47–97.
5. R. Albert, H. Jeong, and A.-L. Barabási. "Diameter of the World Wide Web." Nature 401 (1999), 130–131.
6. R. Albert, H. Jeong, and A.-L. Barabási. "Attack and Error Tolerance of Complex Networks." Nature 406 (2000), 378–382.
7. D. Alderson. "Technological and Economic Drivers and Constraints in the Internet's 'Last Mile.'" Technical Report CIT-CDS-04-004, California Institute of Technology, 2004.
8. D. Alderson and W. Willinger. "A Contrasting Look at Self-Organization in the Internet and Next-Generation Communication Networks." IEEE Communications Magazine 43:7 (2005), 94–100.
9. D. Alderson, L. Li, W. Willinger, and J. C. Doyle. "Understanding Internet Topology: Principles, Models, and Validation." IEEE/ACM Trans. on Networking 13:6 (2005), 1205–1218.
10. L. A. N. Amaral, A. Scala, M. Barthelemy, and H. E. Stanley. "Classes of Small-World Networks." Proc. Natl. Acad. Sci. USA 97 (2000), 11149-11152.
11. Advanced Network Technology Center. "University of Oregon Route Views Project." Available from World Wide Web (http://www.antc.uoregon.edu/ route-views/), 2005.
12. P. Bak. How Nature Works: The Science of Self-Organized Criticality. New York: Springer-Verlag Telos, 1996.
13. P. Ball. "Networking Can Be Hazardous." Nature Science Update, 9 March 2001.
14. P. Ball. Critical Mass: How One Thing Leads to Another. New York: Farrar, Straus and Giroux, 2004.
15. A.-L. Barabási. Linked: The New Science of Networks. New York: Perseus Publishing, 2002.
16. A.-L. Barabási and R. Albert. "Emergence of Scaling in Random Networks." Science 286 (1999), 509–512.
17. A.-L. Barabási and E. Bonabeau. "Scale-Free Networks." Scientific American 288 (2003), 60–69.
18. A.-L. Barabási and Z. N. Oltvai. "Network Biology: Understanding the Cell's Functional Organization." Nature Reviews Genetics 5 (2004), 101–114.
19. A.-L. Barabási, R. Albert, and H. Jeong. "Mean-Field Theory for Scale-Free Random Networks." Physica A 272 (1999), 173–187.
20. A.-L. Barabási, E. Ravasz, and T. Vicsek. "Deterministic Scale- Free Networks." Physica A 299 (2001), 599–664.
21. A.-L. Barabási, Z. Dezso, E. Ravasz, S. H. Yook, and Z. Oltvai. "Scale-Free and Hierarchical Structures in Complex Networks." AIP Conference Proceedings 661 (2003), 1–16.
22. N. Berger, C. Borgs, J. Chayes and A. Saberi. "On the Spread of Viruses on the Internet." In Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 301–310. Philadelphia: SIAM, 2005.
23. G. Bianconi and A.-L. Barabási "Competition and Multiscaling in Evolving Networks" Europhys. Lett. 54 (2001), 436–442.
24. B. Bollobas. Modern Graph Theory, Graduate Texts in Mathemtics 184. New York: Springer, 1998.
25. B. Bollobás and O. Riordan. "Robustness and Vulnerability of Scale-Free Random Graphs." Internet Math. 1:1 (2003), 1–35.
26. B. Bollobás and O. Riordan. "The Diameter of a Scale-Free Random Graph." Combinatorica 24:1 (2004), 5–34.
27. L. Briesemeister, P. Lincoln, and P. Porras. "Epidemic Profiles and Defense of ScaleFree Networks." In Proceedings of the 2003 ACM Workshop on Rapid Malcode, pp. 67–75. New York: ACM Press, 2003.
28. M. Buchanan. Ubiquity: The Science of History... or Why the World Is Simpler Than We Think. New York: Crown, 2001.
29. J. M. Carlson and J. C. Doyle. "Highly Optimized Tolerance: A Mechanism for Power Laws in Designed Systems." Physics Review E 60 (1999), 1412–1428.
30. J. M. Carlson and J. Doyle. "Complexity and Robustness." PNAS 99, Suppl. 1 (2002), 2539–2545.
31. H. Chang, R. Govindan, S. Jamin, S. Shenker, and W. Willinger. "Towards Capturing Representative AS-Level Internet Topologies." Computer Networks 44:6 (2004), 737–755.
32. G. Chartrand, G. Kubicki, and M. Schultz. "Graph Similarity and Distance in Graphs." Aequationes Mathematicae 55 (1998), 129–145.
33. F. Chung and L. Lu. "The Average Distance in a Random Graph with Given Expected Degrees." Internet Math. 1:1 (2003), 91–113.
34. D. D. Clark. "The Design Philosophy of the DARPA Internet Protocols." ACM Computer Communication Reviews (Proc. of the ACM SIGCOMM’88) 18:4 (1988), 106–114.
35. Cooperative Association for Internet Data Analysis (CAIDA). "Skitter." Available fromWorld WideWeb (http://www.caida.org/tools/measurement/ skitter/), 2005.
36. Z. Dezsö and A.-L. Barabási. "Halting Viruses in Scale-Free Networks." Physical Review E 65 (2002), 055103.
37. S. Dill, R. Kumar, K. McCurley, S. Rajagopalan, D. Sivakumar, and A. Tompkins. "Self-Similarity in the Web." ACM Trans. Internet Technology 2 (2002), 205–223.
38. P. S. Dodds and D. H. Rothman. "Unified View of Scaling Laws in River Networks." Phys. Rev. E 59:5 (1999), 4865–4877.
39. S. N. Dorogovtsev and J. F. F. Mendes. Evolution of Networks: From Biological Nets to the Internet and WWW. Oxford, UK: Oxford University Press, 2003.
40. J. C. Doyle. "Code for Rank vs. Freq Plot Comparisons." Available from World Wide Web (http://hot.caltech.edu/topology/RankVsFreq.m), 2005.
41. J. C. Doyle, D. Alderson, L. Li, S. Low, M. Roughan, S. Shalunov, R. Tanaka, and W. Willinger. "The 'Robust yet Fragile' Nature of the Internet." PNAS 102:41 (2005), 14497–14502.
42. P. Erdös and T. Gallai. "Graphs with Prescribed Degrees of Vertices." Mat. Lapok (Hungarian) 11 (1960), 264–274.
43. P. Erdös and A. Renyi. "On Random Graphs I." Publ. Math. (Debrecen) 9 (1959), 290–297.
44. A. Fabrikant, E. Koutsoupias, and C. Papadimitriou. "Heuristically Optimized Trade-Offs: A New Paradigm for Power-Laws in the Internet." In Automata, Language, and Programming: 29th Interntational Colloquium, ICALP 2002, Málaga, Spain, July 8–13, 2002, Proceedings, pp. 110–122, Lecture Notes in Computer Science 238. Berlin: Springer, 2002.
45. S. M. Fall. "Galaxy Correlations and Cosmology." Reviews of Modern Physics 51:1 (1979), 21–42.
46. I. Farkas, I. Dernyi, G. Palla, and T. Vicsek. "Equilibrium Statistical Mechanics of Network Structures." In Complex Networks, pp. 163–187, Lecture Notes in Physics 650. Berlin: Springer, 2004.
47. W. Feller. An Introduction to Probability Theory and Its Applications, Vol. 2. New York: John Wiley & Sons, 1971.
48. C. Gkantsidis, M. Mihail, and E. Zegura. "The Markov Chain Simulation Method for Generating Connected Power Law Random Graphs." In Proceedings of the Fifth Workshop on Algorithm Engineering and Experiments, pp. 16–25. Philadelphia: SIAM, 2003.
49. R. Govindan and H. Tangmunarunkit. "Heuristics for Internet Map Discovery." In Proceedings IEEE INFOCOM 2000: The Conference on Computer Communications, Vol. 3, pp. 1371–1380. Los Alamitos, CA: IEEE Press, 2000.
50. E. J. Groth and P. J. E. Peebles. "The Large Scale Structure of the Universe." Astrophysics Journal 217 (1977), 385.
51. J. T. Hack. "Studies of Longitudinal Stream Profiles in Virginia and Maryland." US Geol. Survey Prof. Paper 294-B (1957), 45–94.
52. R. E. Horton. "Erosional Development of Streams and Their Drainage Basins: Hydrophysical Approach to Quantitative Morphology." Bull. Geol. Soc. America 56 (1945), 275–370.
53. S. Itzkovitz and U. Alon. "Subgroups and Network Motifs in Geometric Networks." Phys. Rev. E 71 (2005), 026117.
54. S. Itzkovitz, R. Levitt, N. Kashtan, R. Milo, M. Itzkovitz, and U. Alon. "Coarse-Graining and Self-Dissimilarity of Complex Networks." Phy. Rev. E 71 (2005), 016127.
55. H. Jeong, B. Tombor, R. Albert, Z. N. Oltvai and A-L. Barabsi. "The Large-Scale Organization of Metabolic Networks." Nature 407 (2000), 651.
56. H. Jeong, Z. Neda, and A-L. Barabási. "Measuring Preferential Attachment in Evolving Networks." Europhys. Letter 61 (2003), 567–572.
57. N. L. Johnson, S. Kotz, and N. Balakrishnan. Continuous Univariate Distributions, Second edition, Vol. 1. New York: John Wiley & Sons, 1994.
58. J. W. Kirchner. "Statistical Inevitability of Horton's Laws and the Apparent Randomness of Stream Channel Networks." Geology 21 (1993), 591–594.
59. J. W. Kirchner. "Statistical Inevitability of Horton's Laws and the Apparent Randomness of Stream Channel Networks—Reply to Masek and Turcotte." Geology 22 (1994), 380–381.
60. J. W. Kirchner. "Statistical Inevitability of Horton's Laws and the Apparent Randomness of Stream Channel Networks—Reply to Troutman and Karlinger." Geology 22 (1994), 574–575.
61. H.-P. Kriegel and S. Schonauer. "Similarity Search in Structured Data." In Data Warehousing and Knowledge Discovery: 5th International Conference, DaWaK 2003, Prague, Czech Republic, September 3–5, 2003, Proceedings, pp. 224–233, Lecture Notes in Computer Science 2737. Berlin: Springer, 2003.
62. A. Lakhina, J. W. Byers, M. Crovella, and P. Xie. "Sampling Biases in IP Topology Measurements." Available from World Wide Web (http://www. ieee-infocom.org/2003/papers/09 01.pdf), 2003.
63. L. Li, D. Alderson, J. Doyle, and W. Willinger. "A First-Principles Approach to Understanding the Internet's Router-Level Topology." In Proceedings of the 2004 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, pp. 3–14. New York: ACM Press, 2004.
64. S. E. Luria and M. Delbrück. "Mutations of Bacteria from Virus Sensitivity to Virus Resistance." Genetics 28 (1943), 491–511.
65. B. B. Mandelbrot. Fractals and Scaling in Finance: Discontinuity, Concentration, Risk. New York: Springer-Verlag, 1997.
66. A. Marani, R. Rigon, and A. Rinaldo. "A Note on Fractal Channel Networks." Water Resources Research 27:12 (1991), 3041–3049.
67. R. Milo, S. Shen-Orr, S. Itzkovitz, N. Kashtan, D. Chklovskii, and U. Alon. "Network Motifs: Simple Building Blocks of Complex Networks." Science 298 (2002), 824–827.
68. M. Mitzenmacher. "A Brief History of Generative Models for Power Law and Lognormal Distributions." Internet Math. 1:2 (2004), 226–251.
69. M. E. J. Newman "Assortative Mixing in Networks." Phys. Rev. Lett. 89 (2002), 208701.
70. M. E. J. Newman. "The Structure and Function of Complex Networks." SIAM Review 45 (2003), 167–256.
71. M. E. J. Newman. "A Measure of Betweenness Centrality Based on Random Walks." Social Networks 27 (2005), 39–54.
72. M. E. J. Newman. "Power Laws, Pareto Distributions and Zipf's Law." Contemporary Physics 46:5 (2005), 323–351.
73. J. Ottino. "Engineering Complex Systems." Nature 427:29 (2004), 399.
74. J. Park and M. E. J. Newman. "The Origin of Degree Correlations in the Internet and Other Networks." Phys. Rev. E. 68 (2003), 026112.
75. R. Pastor-Satorras and A. Vespignani. "Epidemic Spreading in Scale-Free Networks Physical Review Letters 86:14 (2001), 3200-3203.
76. R. Pastor-Satorras and A. Vespignani. Evolution and Structure of the Internet: A Statistical Physics Approach. Cambridge, UK: Cambridge University Press, 2004.
77. K. Patch. "Net Inherently Virus Prone." Technology Research News, March 21, 2001.
78. V. Paxson. "Strategies for Sound Internet Measurement." In Proceedings of the 4th ACM SIGCOMM Conference on Internet Measurement, pp. 263–271. New York: ACM Press, 2004.
79. S. D. Peckham. "New Results for Self-Similar Tree with Applications to River Networks." Water Resources Research 31:4 (1995), 1023–1029.
80. E. Petrakis. "Design and Evaluation of Spatial Similarity Approaches for Image Retrieval." Image and Vision Computing 20 (2002), 59–76.
81. E. Ravasz, A. L. Somera, D. A. Mongru, Z. N. Oltvai, and A-L. Barabási. "Hierarchical Organization of Modularity in Metabolic Networks." Science 297 (2002), 1551–1555.
82. S. I. Resnick. "Heavy Tail Modeling and Teletraffic Data." Annals of Statistics 25 (1997), 1805–1869.
83. A. Rinaldo, I. Rodríguez-Iturbe, R. Rigon, R. L. Bras, E. Ijjász-Vásquez, and A. Marani. "Minimum Energy and Fractal Structures of Drainage Networks." Water Resources Research 28:9 (1992), 2183–2195.
84. I. Rodríguez-Iturbe, A. Rinaldo, R. Rigon, R. L. Bras, A. Marani, and E. Ijjász-Vásquez. "Energy Dissipation, Runoff Production, and the Three-Dimensional Structure of River Basins." Water Resources Research 28:4 (1992), 1095–1103.
85. G. Samorodnitsky, and M. S. Taqqu. Stable Non- Gaussian Random Processes: Stochastic Models with Infinite Variance. New York: Chapman and Hall, 1994.
86. A. Sanfeliu and K. S. Fu. "A Distance Measure Between Attributed Relational Graph." IEEE Trans. Systems, Man, and Cybernetics 13 (1983), 353–362.
87. T. Seidl. "References for Graph Similarity." Available from World Wide Web (http://www.dbs.informatik.uni-muenchen.de/∼seidl/graphs/), 1999.
88. S. S. Shen-Orr, R. Milo, S. Mangan, and U. Alon. "Network Motifs in the Transcriptional Regulation Network of Escherichia Coli." Nature Genetics 31:1 (2002), 64–68.
89. S. S. Skiena. The Algorithm Design Manual. New York: Springer- Verlag, 1997. Available from World Wide Web (http://www2.toki.or.id/book/ AlgDesignManual/), 1997.
90. H. A. Simon. "On a Class of Skew Distribution Functions." Biometrika 42:3/4 (1955), 425–440.
91. N. Spring, M. Dontcheva, M. Rodrig, and D. Wetherall. "How to Resolve IP Aliases." Technical Report 04-05-04, University of Washington Computer Science and Engineering, 2004.
92. N. Spring, R. Mahajan, D. Wetherall, and T. Anderson. "Measuring ISP Topologies with Rocketfuel." IEEE/ACM Transactions on Networking 12 (2004), 2–16.
93. R. Solé and S. Valverde. "Information Transfer and Phase Transitions in a Model of Internet Traffic." Physica A 289 (2001), 595–695.
94. D. Stauffer and A. Aharony. Introduction to Percolation Theory, Second Edition. London: Taylor and Francis, 1992.
95. J. W. Stewart III. BGP4: Inter-Domain Routing in the Internet. Boston: Addison-Wesley, 1999.
96. A. N. Strahler. "Quantitative Analysis of Watershed Geomorphology." Trans. Am. Geophy. Union 38:6 (1957), 913–920.
97. R. Tanaka. "Scale-Rich Metabolic Networks." Physical Review Letters 94 (2005), 168101.
98. R. Tanaka and J. Doyle. "Global Organization of Metabolic Networks and Implications for Complex Biologic Systems." In Preparation, 2005.
99. D. G. Tarboton. "Fractal River Networks, Horton's Laws, and Tokunaga Cyclicity." Hydrology 187 (1996), 105–117.
100. R. Teixeira, K. Marzullo, S. Savage, and G. M. Voelker. "In Search of Path Diversity in ISP Networks." In Proceedings of the 3rd ACM SIGCOMM Conference on Internet Measurement, pp. 313–318. New York: ACM Press, 2003.
101. A. Tripathi and S. Vijay. "A Note on a Theorem of Erdös & Gallai." Discrete Mathematics 265:1–3 (2003), 417–420.
102. D. J. Watts and S. H. Strogatz. "Collective Dynamics of 'Small World' Networks." Nature 393 (June 1998), 440–442.
103. W. Willinger, D. Alderson, and L. Li. "A Pragmatic Approach to Dealing with High Variability in Network Measurements." In Proceedings of the 4th ACM SIGCOMM Conference on Internet Measurement, pp. 88–100. New York: ACM Press, 2004.
104. W. Willinger, D. Alderson, J. C. Doyle, and L. Li. "More 'Normal' than Normal: Scaling Distributions and Complex Systems." In Proceedings of the 2004 Winter Simulation Conference, edited by R. G. Ingalls, M. D. Rossetti, J. S. Smith, and B. A. Peters, pp. 130–141. New York: ACM Press, 2004.
105. D. H. Wolpert and W. Macready. "Self-Dissimilarity: An Empirically Observable Complexity Measure." In Unifying Themes in Complex Systems, edited by Y. Bar-Yang, pp. 626–643. Cambridge, MA: New England Complex Systems Institute, 2000.
106. D. H. Wolpert and W. Macready. "Self-Dissimilarity as a High-Dimensional Complexity Measure." Preprint, 2004.
107. K. Wu and A. Liu. "Rearrangement Inequality." Mathematics Competitions 8:1 (1995), 53–60.
108. S.-H. Yook, H. Jeong, and A.-L. Barabási. "Modeling the Internets Large-Scale Topology." PNAS 99 (2002), 13382–13386.
109. G. Yule. "A Mathematical Theory of Evolution Based on the Conclusions of Dr. J.C. Willis." F. R. S. Philosophical Transactions of the Royal Society of London (Series B) 213 (1925), 21–87.
110. Y. Zhang, M. Roughan, C. Lund, and D. Donoho. "An Information- Theoretic Approach to Traffic Matrix Estimation." In Proceedings of the 2003 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, pp. 301–312. New York: ACM Press, 2003.