Fast Uniform Generation of Random Graphs with Given Degree Sequences
暂无分享,去创建一个
Pu Gao | Andrii Arman | Nicholas Wormald | N. Wormald | Pu Gao | A. Arman
[1] Amin Saberi,et al. A Sequential Algorithm for Generating Random Graphs , 2007, Algorithmica.
[2] Martin E. Dyer,et al. Sampling regular graphs and a peer-to-peer network , 2005, SODA '05.
[3] Brendan D. McKay,et al. Uniform Generation of Random Regular Graphs of Moderate Degree , 1990, J. Algorithms.
[4] Pu Gao,et al. Uniform generation of random graphs with power-law degree sequences , 2017, SODA.
[5] Van H. Vu,et al. Generating Random Regular Graphs , 2003, STOC '03.
[6] James Y. Zhao. Expand and Contract: Sampling graphs with given degrees and other combinatorial families , 2013, ArXiv.
[7] Pu Gao,et al. Uniform Generation of Random Regular Graphs , 2015, 2015 IEEE 56th Annual Symposium on Foundations of Computer Science.
[8] Catherine S. Greenhill. The switch Markov chain for sampling irregular graphs (Extended Abstract) , 2014, SODA.
[9] Mark Jerrum,et al. Fast Uniform Generation of Regular Graphs , 1990, Theor. Comput. Sci..
[10] Béla Bollobás,et al. A Probabilistic Proof of an Asymptotic Formula for the Number of Labelled Regular Graphs , 1980, Eur. J. Comb..
[11] Prasad Tetali,et al. Simple Markov-chain algorithms for generating bipartite graphs and tournaments , 1997, SODA '97.
[12] Nicholas C. Wormald,et al. Generating Random Regular Graphs Quickly , 1999, Combinatorics, Probability and Computing.
[13] Edward A. Bender,et al. The Asymptotic Number of Labeled Graphs with Given Degree Sequences , 1978, J. Comb. Theory A.