Enumeration of graphs with a heavy-tailed degree sequence

Advances in Mathematics

Volumn 287, Issue , 2016, Pages 412-450

  Gao, Pu ^a   Wormald, Nicholas ^b  

^a UNIVERSITY OF TORONTO   (Canada)

^b MONASH UNIVERSITY   (Australia)

Author keywords

Asymptotic enumeration of graphs; Degree sequence; Power law degree sequence; Switchings

Indexed keywords

EID: 84944755041     PISSN: 00018708     EISSN: 10902082     Source Type: Journal    
DOI: 10.1016/j.aim.2015.09.002     Document Type: Article

References (21)

1. Aiello W., Chung F., Lu L. Random evolution in massive graphs. 42nd IEEE Symposium on Foundations of Computer Science 2001, 510-519.
2. Aiello W., Chung F., Lu L. A random graph model for power law graphs. Exp. Math. 2001, 10(1):53-66.
3. Albert R., Barabási A. Statistical mechanics of complex networks. Rev. Modern Phys. 2002.
4. Bender E.A., Canfield E.R. The asymptotic number of labeled graphs with given degree sequences. J. Combin. Theory Ser. A 1978, 24:296-307.
5. Boguñá M., Papadopoulos F., Kriouko D. Sustaining the Internet with hyperbolic mapping. Nat. Commun. 2010, 1(62).
6. Bollobás B. A probabilistic proof of an asymptotic formula for the number of labelled regular graphs. European J. Combin. 1980, 1:311-316.
7. Bollobás B., Riordan O., Spencer J., Tusnády G. The degree sequence of a scale-free random graph process. Random Structures Algorithms 2001, 18(3):279-290.
8. Borgs C., Chayes J., Daskalakis C., Roch S. First to market is not everything: an analysis of preferential attachment with fitness. STOC'07 - Proceedings of the 39th Annual ACM Symposium on Theory of Computing 2007, 135-144.
9. Cooper C., Frieze A. A general model of web graphs. Random Structures Algorithms 2003, 22(3):311-335.
10. Chung F., Lu L. The volume of the giant component of a random graph with given expected degrees. SIAM J. Discrete Math. 2006, 20(2):395-411.
11. Erdos P., Rényi A. On random graphs. I. Publ. Math. Debrecen 1959, 6:290-297.
12. Faloutsos M., Faloutsos P., Faloutsos C. On power-law relationships of the Internet topology. ACM SIGCOMM Comput. Commun. Rev. 1999, 29(4):251-262.
13. Gugelmann L., Panagiotou K., Peter U. Random hyperbolic graphs: degree sequence and clustering. ICALP'12 Proceedings of the 39th International Colloquium Conference on Automata, Languages, and Programming, vol. II 2012, 573-585.
14. Janson S. The probability that a random multigraph is simple. Combin. Probab. Comput. 2009, 18(1-2):205-225.
15. Janson S. The probability that a random multigraph is simple, II arxiv:1307.6344.
16. Kleinberg R. Geographic routing using hyperbolic space. Proceedings of the 26th IEEE International Conference on Computer Communications, INFOCOM07 2007, 1902-1909.
17. McKay B.D. Asymptotics for symmetric 0-1 matrices with prescribed row sums. Ars Combin. 1985, 19A:15-25.
18. McKay B.D., Wormald N.C. Asymptotic enumeration by degree sequence of graphs with degrees o(n). Combinatorica 1991, 11:369-382.
19. Mitzenmacher M. A brief history of generative models for power law and lognormal distributions. Internet Math. 2004, 1(2):226-251.
20. Papadimitriou C.H., Ratajczak D. On a conjecture related to geometric routing. Theoret. Comput. Sci. 2005, 344(1):3-14.
21. Papadopoulos F., Krioukov D., Boguñá M., Vahdat A. Greedy forwarding in dynamic scale-free networks embedded in hyperbolic metric spaces. Proceedings of the 29th IEEE International Conference on Computer Communications 2010, 2973-2981.