Rapid mixing of the switch Markov chain for strongly stable degree sequences
暂无分享,去创建一个
[1] Amin Saberi,et al. A Sequential Algorithm for Generating Random Graphs , 2007, Algorithmica.
[2] Eric Vigoda,et al. On Counting Perfect Matchings in General Graphs , 2017, LATIN.
[3] Eric Vigoda,et al. A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries , 2004, JACM.
[4] Prasad Tetali,et al. Simple Markov-Chain Algorithms for Generating Bipartite Graphs and Tournaments (Extended Abstract) , 1999, SODA.
[5] P. Erdős,et al. Efficiently sampling the realizations of bounded, irregular degree sequences of bipartite and directed graphs , 2018, PloS one.
[6] Mark Jerrum,et al. Approximating the Permanent , 1989, SIAM J. Comput..
[7] Pieter Kleer,et al. Rapid Mixing of the Switch Markov Chain for Strongly Stable Degree Sequences and 2-Class Joint Degree Matrices , 2018, SODA.
[8] Van H. Vu,et al. Generating Random Regular Graphs , 2006, Comb..
[9] Béla Bollobás,et al. A Probabilistic Proof of an Asymptotic Formula for the Number of Labelled Regular Graphs , 1980, Eur. J. Comb..
[10] Martin E. Dyer,et al. On the Switch Markov Chain for Perfect Matchings , 2015, SODA.
[11] Patrick J. Wolfe,et al. Inference for graphs and networks: Extending classical tools to modern data , 2009, 0906.4980.
[12] Nicholas C. Wormald,et al. Generating Random Regular Graphs Quickly , 1999, Combinatorics, Probability and Computing.
[13] Martin E. Dyer,et al. The flip Markov chain for connected regular graphs , 2019, Discret. Appl. Math..
[14] Zoltán Király,et al. On the Swap-Distances of Different Realizations of a Graphical Degree Sequence , 2013, Comb. Probab. Comput..
[15] Alistair Sinclair,et al. Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow , 1992, Combinatorics, Probability and Computing.
[16] Pu Gao,et al. Uniform generation of spanning regular subgraphs of a dense graph , 2019, Electron. J. Comb..
[17] Mark Jerrum,et al. Fast Uniform Generation of Regular Graphs , 1990, Theor. Comput. Sci..
[18] Zoltán Toroczkai,et al. A Decomposition Based Proof for Fast Mixing of a Markov Chain over Balanced Realizations of a Joint Degree Matrix , 2015, SIAM J. Discret. Math..
[19] Martin E. Dyer,et al. Sampling regular graphs and a peer-to-peer network , 2005, SODA '05.
[20] Brendan D. McKay,et al. Uniform Generation of Random Regular Graphs of Moderate Degree , 1990, J. Algorithms.
[21] J. Petersen. Die Theorie der regulären graphs , 1891 .
[22] István Miklós,et al. Approximate Counting of Graphical Realizations , 2015, PloS one.
[23] S. Hakimi. On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I , 1962 .
[24] Pu Gao,et al. Uniform Generation of Random Regular Graphs , 2015, 2015 IEEE 56th Annual Symposium on Foundations of Computer Science.
[25] Nicholas Wormald,et al. Enumeration of graphs with a heavy-tailed degree sequence , 2014, 1404.1250.
[26] Kevin E. Bassler,et al. Efficient and Exact Sampling of Simple Graphs with Given Arbitrary Degree Sequence , 2010, PloS one.
[27] Brendan D. McKay,et al. Asymptotic enumeration by degree sequence of graphs with degreeso(n1/2) , 1991, Comb..
[28] Amin Saberi,et al. A Local Switch Markov Chain on Given Degree Graphs with Application in Connectivity of Peer-to-Peer Networks , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).
[29] Catherine S. Greenhill,et al. The switch Markov chain for sampling irregular graphs and digraphs , 2017, Theor. Comput. Sci..
[30] Pu Gao,et al. Uniform generation of random graphs with power-law degree sequences , 2017, SODA.