Coupling online and offline analyses for random power law graphs

Internet Mathematics

Volumn 1, Issue 4, 2004, Pages 409-461

  Chung, Fan ^a   Lu, Linyuan ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b UNIVERSITY OF SOUTH CAROLINA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84906243778     PISSN: 15427951     EISSN: 19449488     Source Type: Journal    
DOI: 10.1080/15427951.2004.10129094     Document Type: Article

References (25)

1. [Aiello et al. 00] 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.
2. [Aiello et al. 01] W. Aiello, F. Chung, and L. Lu. "A Random Graph Model for Power Law Graphs". Experimental Math. 10:1 (2001), 53-66.
3. [Aiello et al. 02] W. Aiello, F. Chung, and L. Lu. "Random Evolution in Massive Graphs". In Handbook of Massive Data Sets, Vol. 2, edited by J. Abello et al., pp. 97-122. Dordrecht: Kluwer Academic Publishers, 2002.
4. [Barabási and Albert 99] Albert-László Barabási and Réka Albert. "Emergence of Scaling in Random Networks". Science 286 (1999), 509-512.
5. [Barabási et al. 00] A. 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. [Broder et al. 00] A. Broder, R. Kumar, F. Maghoul, P. Raghavan, S. Rajagopalan, R. Stata, A. Tompkins, and J. Wiener. "Graph Structure in the Web". In Proceedings of the 9th International World Wide Web Conference on Computer Networks, pp. 309-320. Amsterdam: North-Holland Publishing Co., 2000.
7. [Bollabás and Riordan 03] B. Bollabás and O. Riordan. "Robustness and Vulnerability of Scale-Free Random Graphs". Internet Mathematics 1:1 (2003), 1-35.
8. [Chung 97] F. Chung. Spectral Graph Theory. Providence, RI: American Mathematical Society, 1997.
9. [Chung and Lu 01] Fan Chung and Linyuan Lu. "The Diameter of Random Sparse Graphs". Advances in Applied Math. 26 (2001), 257-279.
10. [Chung and Lu 02a] Fan Chung and Linyuan Lu. "Connected Components in a Random Graph with Given Degree Sequences". Annals of Combinatorics 6 (2002), 125-145.
11. [Chung and Lu 02b] Fan Chung and Linyuan Lu. "The Average Distance in Random Graphs with Given Expected Degrees". Proceeding of National Academy of Science 99 (2002), 15879-15882.
12. [Chung et al. 03] Fan Chung, Linyuan Lu, and Van Vu. "The Spectra of Random Graphs with Given Expected Degrees". Proceedings of National Academy of Sciences 100:11 (2003), 6313-6318.
13. [Cooper and Frieze 03] Colin Cooper and Alan Frieze. "A General Model of Undirected Web Graphs". Random Structures and Algorithms 22 (2003), 311-335.
14. [Cooper et al. 04] Colin Cooper, Alan Frieze, and Juan Vera. "Random Vertex Deletion in a Scale Free Random Graph". Internet Mathematics 1:4 (2004), 463-483.
15. [Erdo{double acute}s and Gallai 61] P. Erdo{double acute}s and T. Gallai. "Gráfok elo{double acute}írt fokú pontokkal (Graphs with Points of Prescribed Degrees) (in Hungarian). Mat. Lapok 11 (1961), 264-274.
16. [Erdo{double acute}s and Rényi 59] P. Erdo{double acute}s and A. Rényi. "OnRandomGraphs. I". Publ. Math. Debrecen 6 (1959), 290-291.
17. [Janson et al. 00] S. Janson, T. Łuczak, and A. Rucinski. Random Graphs. New York: Wiley-Interscience, 2000.
18. [Jeong et al. 00] H. Jeong, B. Tomber, R. Albert, Z. Oltvai, and A. L. Babárasi. "The Large-Scale Organization of Metabolic Networks". Nature 407 (2000), 378-382.
19. [Kleinberg et al. 99] J. Kleinberg, S. R. Kumar, P. Raphavan, S. Rajagopalan, and A. Tomkins. "The Web as a Graph: Measurements, Models and Methods". Computing and Combinatorics: 5th Annual International Conference, COCOON '99, Tokyo, Japan, July 26-28, 1999, Proceedings, edited by Takao Asano et al., Lecture Notes in Computer Science 1627, pp. 1-17. New York: Springer, 1999.
20. [Kim and Vu 00] J.H. Kim and V. Vu. "Concentration of Multi-Variate Polynomials and its Applications". Combinatorica 20:3 (2000), 417-434.
21. [Lotka 26] A. J. Lotka. "The Frequency Distribution of Scientific Productivity". The Journal of the Washington Academy of the Sciences 16 (1926), 317.
22. [Lu 01] Linyuan Lu. "The Diameter of Random Massive Graphs". In Proceedings of the Twelfth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 912-921. Philadelphia, PA: SIAM, 2001.
23. [McDiarmid 98] Colin McDiarmid. "Concentration". In Probabilistic Methods for Algorithmic Discrete Mathematics, edited by M. Habib et al., Algorithms and Combinatorics 16, pp. 195-248, Berlin: Springer, 1998.
24. [Milgram 67] S. Milgram. "The Small World Problem". Psychology Today 2 (1967), 60-67.
25. [Mitzenmacher 05] Michael Mitzenmacher. "A Brief History of Generative Models for Power Law and Lognormal Distributions". To appear in Internet Mathematics (2005).