Constructing and Sampling Graphs with a Prescribed Joint Degree Distribution

ACM Journal of Experimental Algorithmics

Volumn 17, Issue , 2012, Pages 3.1-3.25

  Stanton, Isabelle ^a   Pinar, Ali ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b SANDIA NATIONAL LABORATORIES   (United States)

Author keywords

Algorithms; Experimentation; graph sampling; Graphs; joint degree distribution; Monte Carlo Markov chain; Theory

Indexed keywords

EID: 84907022006     PISSN: 10846654     EISSN: 10846654     Source Type: Journal    
DOI: 10.1145/2133803.2330086     Document Type: Article

References (59)

1. Aiello, W., Chung, F.R.K., and Lu, L. 2000b. A random graph model for power law graphs. Exp. Math. 10, 53-66.
2. Amaral, L.A.N., Scala, A., Barthelemy, M., and Stanley, H. 2000. Classes of small-world networks. Proc. Nat. Acad. Sci. 97, 11149-11152.
3. Barabasi, A.-L. and Albert, R. 1999. Emergence of scaling in random networks. Science 286, 5439, 509-512
4. Bayati, M., Kim, J.H., and Saberi, A. 2010. A sequential algorithm for generating random graphs. Algorithmica 58, 4, 860-910.
5. Berry, J.W., Fosvedt, L., Nordman, D., Phillips, C.A., and Wilson, A. G. 2011. Listing triangles in expected linear time on power law graphs with exponent at least [formula omitted]. Tech. rep. SAND2010-4474c, Sandia National Laboratories.
6. Bi, Z., Faloutsos, C., and Korn, F. 2001. The dgx distribution for mining massive, skewed data. In Proceedings of the 7th ACM SIGKDD International Conference on Knowledge, Discovery, and Data Mining. 17-26.
7. Blitzstein, J. and Diaconis, P. 2006. A sequential importance sampling algorithm for generating random graphs with prescribed degrees. http://www.people.fas.harvard.edu/~blitz/ BlitzsteinDiaconisGraphAlgorithm.pdf.
8. BollobAs, B. 1980. A probabilistic proof of an asymptotic formula for the number of labelled regular graphs. Eur. J. Comb. 1, 311-316.
9. BollobAs, B., Riordan, O., Spencer, J., and Tusndy, G. 2001. The degree sequence of a scale-free random graph process. Random Struct. Algor. 18, 3, 279-290.
10. Broder, A. Z. 1986. How hard is it to marry at random? (on the approximation of the permanent). In Proceedings ofthe 18th Annual ACM Symposium on Theory ofComputing. 50-58.
11. Chung, F., Lu, L., and Vu, V. 2003. Spectra of random graphs with given expected degrees. Proc. Natl. Acad. Sci. 100, 6313-6318.
12. Chung, F. and Lu, L. 2002. Connected components in random graphs with given expected degree sequences. Ann. Comb., 125-145.
13. Chung, F.R.K. and Lu, L. 2003. The average distance in a random graph with given expected degrees. Internet Math. 1, 1.
14. Clauset, A., Shalizi, C.R., and Newman, M. E. J. 2009. Power-law distributions in empirical data. SIAM Rev. 51, 4, 661-703.
15. Faloutsos, M., Faloutsos, P., and Faloutsos, C. 1999. On power-law relationships of the internet topology. In In Proceedings of the Annual Conference of the Special Interest Group on Data Communication (SIGOMM’99). 251-262.
16. Flaxman, A., Frieze, A., and Vera, J. 2004. A geometric preferential attachment model of networks. In Proceedings of the 3rd International Workshop on Algorithms and Models for the Web-Graph (WAW’04). 44-55.
17. Girvan, M. and Newman, M. E. J. 2002. Community structure in social and biological networks. Proc. Natl. Acad.Sci. 99, 7821-7826.
18. Gkantsidis, C., Mihail, M., and Zegura, E. W. 2003. The markov chain simulation method for generating connected power law random graphs. In Proceedings of the 5th Workshop on Algorithm Engineering and Experiments (ALENEX03). 16-25.
19. Hakimi, S. L. 1962. On the realizability of a set of integers as degrees of the vertices of a graph. SIAM J. Appl. Math. 10, 496-506.
20. Havel, V. 1955. A remark on the existence of finite graphs. Caposis Pest. Mat. 80.
21. Jerrum, M. and Sinclair, A. 1990. Fast uniform generation of regular graphs. Theor. Comput. Sci. 73, 1, 91-100.
22. Jerrum, M., Sinclair, A., and Vigoda, E. 2004. A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries. J. ACM 51, 4, 671-697.
23. Kannan, R., Tetali, P., and Vempala, S. 1999. Simple markov-chain algorithms for generating bipartite graphs and tournaments. Random Struct. Algor. 14, 4, 293-308.
24. Kim, J.H. and Vu, V. 2006. Generating random regular graphs. Combinatorica 26, 6, 683-708.
25. Kleinberg, J. 2001. Small-world phenomena and the dynamics of information. Adv. Neural Process. Syst. 431-438.
26. Knuth, D. E. 1993. The Stanford Graphbase: A Platform for Combinatorial Computing. Addison-Wesley Professional Publishing.
27. Kumar, R., Raghavan, P., Rajagopalan, S., Sivakumar, D., Tomkins, A., and Upfal, E. 2000. Random graph models for the web graph. In Proceedings of the 41st Annual Symposium on Foundations of Computer Science. 57-65.
28. Lancichinetti, A., Fortunato, S., and Radicchi, F. 2008. Benchmark graphs for testing community detection algorithms. Phys. Rev. E 78, 4, 1-5.
29. Leskovec, J., Chakrabarti, D., Kleinberg, J., Faloutsos, C., and Ghahramani, Z. 2010. Kronecker graphs: An approach to modeling networks. J. Mach. Lear. Res. 11, 985-1042.
30. Leskovec, J., Kleinberg, J., and Faloutsos, C. 2005. Graphs over time: densification laws, shrinking diameters and possible explanations. In Proceedings of the 11th ACM SIGKDD International Conference on Knowledge, Discovery, and Data Mining. 177-187.
31. Leskovec, J., Lang, K., Dasgupta, A., and Mahoney, M. 2008. Statistical properties of community structure in large social and information networks. In Proceedings of the 17th International World Wide Web Conference (WWW08). 695-704.
32. Lusseau, D. 2003. The emergent properties of a dolphin social network. Proc. Royal Soc. London Series B, 270, S186-S188.
33. Mahadevan, P., Hubble, C., Krioukov, D.V., and Vahdat, A. 2007. Orbis: rescaling degree correlations to generate annotated internet topologies. In Proceedings of the Annual Conference of the Special Interest Group on Data Communication (SIGOMM’07). 325-336.
34. Mahadevan, P., Krioukov, D., Fall, K., and Vahdat, A. 2006. Systematic topology analysis and generation using degree correlations. In Proceedings of the Annual Conference of the Special Interest Group on Data Communication (SIGOMM 06). 135-146.
35. McKay, B. 1985. Asymptotics for symmetric 0-1 matrices with prescribed row sums. Ars Combinatoria A 19, 15-25.
36. Mihail, M. and Papadimitriou, C. 2002. On the eigenvalue power law. In Proceedings of the 6th International Workshop on Randomization and Approximation Techniques (RANDOM’02). Springer-Verlag, Berlin, 254-262.
37. Mitzenmacher, M. 2001. A brief history of generative models for power law and lognormal distribution. In Proceedings ofthe 39th Annual Allerton Conference on Communication, Control, and Computing.
38. Mitzenmacher, M. and Upfal, E. 2005. Probably and Computing: Randomized Algorithms and Probabilistic Analysis. Cambridge University Press.
39. Newman, M. 2004. Analysis of weighted networks. Phys. Rev. E 70, 5, 056131.
40. Newman, M. 2006a. Modularity and community structure in networks. Proc. Natl. Acad. Sci. 103, 8577-8582.
41. Newman, M. E. J. 2001. The structure of scientific collaboration networks. Proc. Natl. Acad. Sci. 98, 404-409.
42. Newman, M. E. J. 2002a. Assortative mixing in networks. Phys. Rev. Lett. 89, 208-701.
43. Newman, M. E. J. 2002b. Mixing patterns in networks. Phys.Rev. E. 67, 026-126.
44. Newman, M. E. J. 2006b. Finding community structure in networks using the eigenvectors of matrices, 036104. Phys. Rev. E 74.
45. Newman, M. E. J. 2006c. A symmetrized snapshot of the structure of the internet at the level of autonomous systems, reconstructed from bgp tables posted by the university of oregon route views project. www-personal.umich.edu.
46. Pennock, D.M., Flake, G., Lawrence, S., Glover, E.J., and Andgiles, C. 2002. Winners dont take all: Characterizing the competition for links on the web. Proc. Natl. Acad. Sci. 99, 5207-5211.
47. Raftery, A. E. and Lewis, S. M. 1995. The number of iterations, convergence diagnostics and generic metropolis algorithms. In Practical Markov Chain Monte Carlo, 115-130.
48. Ravasz, E. and Barabasi, A. L. 2003. Hierarchical organization in complex networks. Phys. Rev. E 67, 026112.
49. Sala, A., Gaito, S., Rossi, G.P., Zheng, H., and Zhao, B. Y. 2011. Revisiting degree distribution models for social graph analysis. http://arxiv.org/abs/1108.0027.
50. Seshadhri, C., Kolda, T., and Pinar, A. 2012. Community structure and scale-free collections of erdos-rényi graphs. Phys. Rev. E 85, 056109.
51. Seshadhri, C., Pinar, A., and Kolda, T. 2011. An in-depth study of Stochastic Kronecker Graphs. In Proceedings of the IEEE International Conference on Data Mining. IEEE, 587-596.
52. Sinclair, A. and Jerrum, M. 1989. Approximate counting, uniform generation and rapidly mixing markov chains. Inf. Comput. 82, 1, 93-133.
53. Sokal, A. 1996. Monte carlo methods in statistical mechanics: foundations and new algorithms. In Cours de Troisieme Cycle de la Physique en Suisse Romande, Lausanne.
54. Steger, A. and Wormald, N. C. 1999. Generating random regular graphs quickly. Comb. Probab. Comput. 8, 4.
55. Taylor, R. 1982. Constrained switching in graphs. SIAM J. Algebraic Discrete Meth. 3, 1, 115-121.
56. Toroczkai, Z. and Bassler, K. 2004. Network dynamics: jamming is limited in scale-free systems. Nature 428, 716.
57. Watts, D.J. and Strogatz, S. H. 1998. Collective dynamics of “small-world” networks. Nature 393, 440-442.
58. White, J.G., Southgate, E., Thompson, J.N., and Brenner, S. 1986. The structure of the nervous system of the nematode caenorhabditis elegans. Philos. Trans. R. Soc. London 314, 1-340.
59. Zachary, W. W. 1977. An information flow model for conflict and fission in small groups. J. Anthropol. Res. 33, 452-473.