A geometric preferential attachment model of networks

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

Volumn 3243, Issue , 2004, Pages 44-55

  Flaxman, Abraham D ^a   Frieze, Alan M ^a   Vera, Juan ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 35048815993     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30216-2_4     Document Type: Article

References (33)

1. W. Aiello, F. R. K. Chung, and L. Lu, A random graph model for massive graphs, Proc. of the 32nd Annual ACM Symposium on the Theory of Computing, (2000) 171-180.
2. W. Aiello, F. R. K. Chung, and L. Lu, Random Evolution in Massive Graphs, Proc. of IEEE Symposium on Foundations of Computer Science, (2001) 510-519.
3. R. Albert, A. Barabási, and H. Jeong, Diameter of the world wide web, Nature 401 (1999) 103-131.
4. A. Barabasi and R. Albert, Emergence of scaling in random networks, Science 286 (1999) 509-512.
5. N. Berger, B. Bollobas, G. Borgs, J. Chayes, and O. Riordan, Degree distribution of the FKP network model, Proc. of the 30th International Colloquium of Automata, Languages and Programming, (2003) 725-738.
6. N. Berger, C. Borgs, J. Chayes, R. D'Souza, and R. D. Kleinberg, Competition-induced preferential attachment, preprint.
7. D. Blandford, G. E. Blelloch, and I. Kash, Compact Representations of Separable Graphs, Proc. of ACM/SIAM Symposium on Discrete Algorithms (2003) 679-688.
8. B. Bollobás and O. Riordan, Mathematical Results on Scale-free Random Graphs, in Handbook of Graphs and Networks, Wiley-VCH, Berlin, 2002.
9. B. Bollobás and O. Riordan, The diameter of a scale-free random graph, Combinatorica, 4 (2004) 5-34.
10. B. Bollobás and O. Riordan, Coupling scale free and classical random graphs, preprint.
11. B. Bollobás and O. Riordan and J. Spencer and G. Tusanády, The degree sequence of a scale-free random graph process, Random Structures and Algorithms 18 (2001) 279-290.
12. A. Broder, R. Kumar, F. Maghoul, P. Raghavan, S. Rajagopalan, R. Stata, A. Tomkins, and J. Wiener, Graph structure in the web, Proc. of the 9th Intl. World Wide Web Conference (2002) 309-320.
13. G. Buckley and D. Osthus, Popularity based random graph models leading to a scale-free degree distribution, Discrete Mathematics 282 (2004) 53-68.
14. F.R.K. Chung, L. Lu, and V. Vu, Eigenvalues of random power law graphs, Annals of Combinatorics 7 (2003) 21-33.
15. F.R.K. Chung, L. Lu, and V. Vu, The spectra of random graphs with expected degrees, Proceedings of national Academy of Sciences 100 (2003) 6313-6318.
16. C. Cooper and A. M. Frieze, A General Model of Undirected Web Graphs, Random Structures and Algorithms, 22 (2003) 311-335.
17. E. Drinea, M. Enachescu, and M. Mitzenmacher, Variations on Random Graph Models for the Web, Harvard Technical Report TR-06-01 (2001).
18. P. Erdös and A. Rényi, On random graphs I, Publicationes Mathematicae Debrecen 6 (1959) 290-297.
19. A. Fabrikant, E. Koutsoupias, and C. H. Papadimitriou, Heuristically Optimized Trade-Offs: A New Paradigm for Power Laws in the Internet, Proc. of 29th International Colloquium of Automata, Languages and Programming (2002).
20. M. Faloutsos, P. Faloutsos, and C. Faloutsos, On Power-law Relationships of the Internet Topology, ACM SIGCOMM Computer Communication Review 29 (1999) 251-262.
21. B. Hayes, Graph theory in practice: Part II, American Scientist 88 (2000) 104-109.
22. J. M. Kleinberg, R. Kumar, P. Raghavan, S. Rajagopalan, and A. S. Tomkins, The Web as a Graph: Measurements, Models and Methods, Proc. of the 5th Annual Intl. Conf. on Combinatorics and Computing (COCOON) (1999).
23. R. Kumar, P. Raghavan, S. Rajagopalan, D. Sivakumar, A. Tomkins, and E. Upfal, Stochastic Models for the Web Graph, Proc. IEEE Symposium on Foundations of Computer Science (2000) 57.
24. R. Kumar, P. Raghavan, S. Rajagopalan, D. Sivakumar, A. Tomkins, and E. Upfal, The Web as a Graph, Proc. 19th ACM SIGACT-SIGMOD-AIGART Symp. Principles of Database Systems (PODS) (2000) 1-10.
25. R. Kumar, P. Raghavan, S. Rajagopalan, and A. Tomkins, Trawling the Web for emerging cyber-communities, Computer Networks 31 (1999) 1481-1493.
26. C. J. H. McDiarmid, Concentration, in Probabilistic methods in algorithmic discrete mathematics, (1998) 195-248.
27. M. Mihail and C. H. Papadimitriou, On the Eigenvalue Power Law, Proc. of the 6th International Workshop on Randomization and Approximation Techniques (2002) 254-262.
28. M. Mihail, C. H. Papadimitriou, and A. Saberi, On Certain Connectivity Properties of the Internet Topology, Proc. IEEE Symposium on Foundations of Computer Science (2003) 28.
29. M. Mitzenmacher, A brief history of generative models for power law and lognormal distributions, preprint.
30. M. D. Penrose, Random Geometric Graphs, Oxford University Press (2003).
31. H. A. Simon, On a class of skew distribution functions, Biometrika 42 (1955) 425-440.
32. D. J. Watts, Small Worlds: The Dynamics of Networks between Order and Randomness, Princeton: Princeton University Press (1999).
33. G. Yule, A mathematical theory of evolution based on the conclusions of Dr. J.C. Willis, Philosophical Transactions of the Royal Society of London (Series B) 213 (1925) 21-87.