A sequential importance sampling algorithm for generating random graphs with prescribed degrees

Internet Mathematics

Volumn 6, Issue 4, 2011, Pages 489-522

  Blitzstein, Joseph ^a   Diaconis, Persi ^b  

^a HARVARD UNIVERSITY   (United States)

^b STANFORD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84924173104     PISSN: 15427951     EISSN: None     Source Type: Journal    
DOI: 10.1080/15427951.2010.557277     Document Type: Article

References (67)

1. R. Admiraal and M. S. Handcock. “Networksis: A Package to Simulate Bipartite Graphs with Fixed Marginals through Sequential Importance Sampling.” Journal of Statistical Software 24:8 (2008), 1–21.
2. C. Anderson, S. Wasserman, and B. Crouch. “A p∗ Primer: Logit Models for Social Networks.” Social Networks 21 (1999), 37–66.
3. Richard Arratia and Thomas M. Liggett. “How Likely Is an I.I.D. Degree Sequence to Be Graphical?” Ann. Appl. Probab. 15:1 B (2005), 652–670.
4. Daniel Baird and Robert E. Ulanowicz. “The Seasonal Dynamics of the Chesapeake Bay Ecosystem.” Ecological Monographs 59 (1989), 329-364.
5. Barvinok and J. A. Hartigan. “The Number of Graphs and a Random Graph with a Given Degree Sequence.” Preprint, 2010.
6. Frederico Bassetti and Persi Diaconis. “Examples Comparing Importance Sampling and the Metropolis Algorithm.” Illinois Journal of Mathematics 50, 2006.
7. M. Bayati, J. H. Kim, and A. Saberi. “A Sequential Algorithm for Generating Random Graphs.” Algorithmica 58 (2010), 860–910.
8. Beichl and B. Cloteaux. “Measuring the Effectiveness of the s-Metric to Produce Better Network Models.” In Proceedings of the 40th Conference on Winter Simulation, Winter Simulation Conference, pp. 1020–1028, 2008.
9. Edward A. Bender and E. Rodney Canfield. “The Asymptotic Number of Labeled Graphs with Given Degree Sequences.” J. Combinatorial Theory Ser. A, 24:3 (1978), 296–307.
10. Ivona Bezákov´a, Alistair Sinclair, Daniel Štefankovič, and Eric Vigoda. “Analysis of Sequential Importance Sampling for Contingency Tables.” Preprint, 2006.
11. H. Blanchet. “Efficient Importance Sampling for Binary Contingency Tables.” Annals of Applied Probability 19:3 (2009), 949–982.
12. Joseph K. Blitzstein. “Building Random Objects Sequentially: From Characterization to Algorithm.” PhD thesis, Stanford University, 2006.
13. Béla Bollobás. “A Probabilistic Proof of an Asymptotic Formula for the Number of Labelled Regular Graphs.” European J. Combin. 1:4 (1980), 311–316.
14. S. Chatterjee, P. Diaconis, and A. Sly. “Random Graphs with a Given Degree Sequence.” To appear in Annals of Applied Probability, 2011.
15. Yuguo Chen. “Conditional Inference on Tables with Structural Zeros.” Journal of Computational and Graphical Statistics 16:2 (2007), 445–467.
16. Y. Chen, P. Diaconis, S. Holmes, and J. S. Liu. “Sequential Monte Carlo Methods for Statistical Analysis of Tables.” Journal of the American Statistical Association 100 (2005), 109–120.
17. Y. Chen, I. H. Dinwoodie, and S. Sullivant. “Sequential Importance Sampling for Multiway Tables.” Annals of Statistics 34:11 (2006), 523–545.
18. Fan Chung and Linyuan Lu. “The Average Distances in Random Graphs with Given Expected Degrees.” Proc. Natl. Acad. Sci. USA 99:25 (2002) (electronic), 15879–15882.
19. Fan Chung and Linyuan Lu. “Connected Components in Random Graphs with Given Expected Degree Sequences.” Ann. Comb. 6:2 (2002), 125-145.
20. C. Cooper, M. Dyer, and C. Greenhill. “Sampling Regular Graphs and a Peer-to-Peer Network.” Combinatorics, Probability and Computing 16 (2007), 557–594.
21. Persi Diaconis and Anil Gangolli. “Rectangular Arrays with Fixed Margins.” In Discrete Probability and Algorithms (Minneapolis, MN, 1993), IMA Vol. Math. Appl. 72, pp. 15–41. New York: Springer, 1995.
22. Persi Diaconis and Bernd Sturmfels. “Algebraic Algorithms for Sampling from Conditional Distributions.” Ann. Statist. 26:11 (1998), 363–397.
23. Arnaud Doucet, Nando de Freitas, and Neil Gordon. “An Introduction to Sequential Monte Carlo Methods.” In Sequential Monte Carlo Methods in Practice, Stat. Eng. Inf. Sci., pp. 3–14. New York: Springer, 2001.
24. Ellson, E. R. Gansner, E. Koutsofios, S. C. North, and G. Woodhull. “Graphviz and Dynagraph: Static and Dynamic Graph Drawing Tools.” In Graph Drawing Software, edited by M. Junger and P. Mutzel, pp. 127–148. Berlin: Springer, 2003.
25. P. Erdős and T. Gallai. “Graphen mit Punkten vorgeschriebenen Grades.” Mat. Lapok 11 (1960), 264–274.
26. George S. Fishman. Monte Carlo: Concepts, Algorithms, and Applications, Springer Series in Operations Research. New York: Springer, 1996.
27. Ove Frank and David Strauss. “Markov Graphs.” J. Amer. Statist. Assoc. 81:395 (1986), 832–842.
28. Ian P. Goulden and David M. Jackson. Combinatorial Enumeration. Mineola, NY: Dover, 2004.
29. S. L. Hakimi. “On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph I.” J. Soc. Indust. Appl. Math. 10 (1962), 496-506.
30. J. M. Hammersley and D. C. Handscomb. Monte Carlo Methods. London: Methuen & Co. Ltd., 1965.
31. V. Havel. “A Remark on the Existence of Finite Graphs.” Časopis Pěst. Mat. 80 (1955) 477–480.
32. Paul W. Holland and Samuel Leinhardt. “An Exponential Family of Probability Distributions for Directed Graphs.” J. Amer. Statist. Assoc. 76:373 (1981), 33–65.
33. S. Itzkovitz, R. Milo, N. Kashtan, G. Ziv, and U. Alon. “Subgraphs in Random Networks.” Phys. Rev. E (3) 68:2 (2003), 026127, 8.
34. M.O. Jackson. Social and Economic Networks. Princeton: Princeton University Press, 2008.
35. Mark Jerrum and Alistair Sinclair. “Fast Uniform Generation of Regular Graphs.” Theoret. Comput. Sci. 73:1 (1990), 91–100.
36. J. H. Kim and V. H. Vu. “Sandwiching Random Graphs: Universality between Random Graph Models.” Adv. Math. 188:2 (2004), 444–469.
37. Oliver D. King. “Comment on ‘Subgraphs in Random Networks.’” Phys. Rev. E, 70:5 (2004), 058101, 3.
38. Kong, J. S. Liu, and W. H. Wong. “Sequential Imputations and Bayesian Missing Data Problems.” Journal of the American Statistical Association 89:425 (1994), 278–288.
39. Steffen L. Lauritzen. Extremal Families and Systems of Sufficient Statistics, Lecture Notes in Statistics 49. New York: Springer, 1988.
40. E. L. Lehmann and Joseph P. Romano. Testing Statistical Hypotheses, Springer Texts in Statistics. New York: Springer, 2005.
41. Jun S. Liu. Monte Carlo Strategies in Scientific Computing, Springer Series in Statistics. New York: Springer, 2001.
42. Jun S. Liu and Rong Chen. “Sequential Monte Carlo Methods for Dynamic Systems.” J. Amer. Statist. Assoc. 93:443 (1998), 1032–1044.
43. G. Macdonald. Symmetric Functions and Hall Polynomials, Oxford Mathematical Monographs. New York: Oxford University Press, 1995.
44. V. R. Mahadev and U. N. Peled. Threshold Graphs and Related Topics, Annals of Discrete Mathematics 56. Amsterdam: North-Holland, 1995.
45. Brendan D. McKay and Nicholas C. Wormald. “Asymptotic Enumeration by Degree Sequence of Graphs of High Degree.” European J. Combin. 11:6 (1990), 565–580.
46. Brendan D. McKay and Nicholas C. Wormald. “Asymptotic Enumeration by Degree Sequence of Graphs with Degrees o(n1/ 2).” Combinatorica 11:4 (1991), 369–382.
47. 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.
48. E. J. Newman, S. H. Strogatz, and D. J. Watts. “Random Graphs with Arbitrary Degree Distributions and Their Applications.” Physical Review E 64 (2001), 026118.
49. M. E. J. Newman. “The Structure and Function of Complex Networks.” SIAM Review 45 (2003), 167–256.
50. B. P. Olding and P. J. Wolfe. “Inference for Graphs and Networks: Extending Classical Tools to Modern Data.” Preprint, 2009.
51. Art Owen and Yi Zhou. “Safe and Effective Importance Sampling.” Journal of the American Statistical Association 95:449 (2000), 135–143.
52. Juyong Park and M. E. J. Newman. “Statistical Mechanics of Networks.” Phys. Rev. E (3) 70:6 (2004), 066117, 13.
53. R Development Core Team. R: A Language and Environment for Statistical Computing. Vienna: R Foundation for Statistical Computing, 2005.
54. G. Robins, T. Snijders, P. Wang, M. Handcock, and P. Pattison. “Recent Developments in Exponential Random Graph (P*) Models for Social Networks.” Social Networks 29:2 (2007), 92–215.
55. Reuven Y. Rubinstein and Dirk P. Kroese. The Cross- Entropy Method, Information Science and Statistics. New York: Springer, 2004.
56. J. A. Sloane. “The On-Line Encyclopedia of Integer Sequences.” Available online (http://www.research.att.com/∼njas/sequences/), 2005.
57. T. Snijders, P. Pattison, G. Robins, and M. Handcock. “New Specifications for Exponential Random Graph Models.” Sociological Methodology 1 (2006), 99–154.
58. Tom A. B. Snijders. “Enumeration and Simulation Methods for 0–1 Matrices with Given Marginals.” Psychometrika 56:3 (1991), 397–417.
59. T. A. B. Snijders. “Markov Chain Monte Carlo Estimation of Exponential Random Graph Models.” Journal of Social Structure 3:2 (2002), 1–40.
60. Steger and N. C. Wormald. “Generating Random Regular Graphs Quickly.” Combin. Probab. Comput. 8:4 (1999), 377–396.
61. David Strauss. “On a General Class of Models for Interaction.” SIAM Review 28:4 (1986), 513–527.
62. G. Tinhofer. “On the Generation of Random Graphs with Given Properties and Known Distribution.” Applied Computer Science Berichte Praktische Informatik 13 (1979), 265–296.
63. G. Tinhofer. “Generating Graphs Uniformly at Random.” Computing Supplementum 7 (1990), 235–255.
64. Robert E. Ulanowicz. “Ecosystem Network Analysis” Available online (http://www.cbl.umces.edu/∼ulan/ntwk/network.html), 2005.
65. Duncan J. Watts and Steven H. Strogatz. “Collective Dynamics of ‘Small-World’ Networks.” Nature 393:6684 (1998), 440–442.
66. Wolfram Research. “Mathematica,” version 4.1, 2001.
67. Nicholas C. Wormald. “Models of Random Regular Graphs.” In Surveys in Combinatorics, 1999 (Canterbury), London Math. Soc. Lecture Note Ser. 267, pp. 239–298. Cambridge, UK: Cambridge Univ. Press, 1999.