暂无分享,去创建一个
[1] P. Diaconis,et al. COMPARISON THEOREMS FOR REVERSIBLE MARKOV CHAINS , 1993 .
[2] P. Diaconis,et al. Rectangular Arrays with Fixed Margins , 1995 .
[3] István Miklós,et al. On realizations of a joint degree matrix , 2015, Discret. Appl. Math..
[4] Yuguo Chen,et al. Sequential Monte Carlo Methods for Statistical Analysis of Tables , 2005 .
[5] Ivona Bezáková. Sampling Binary Contingency Tables , 2008, Computing in Science & Engineering.
[6] D. Randall,et al. Markov chain decomposition for convergence rate analysis , 2002 .
[7] Dana Randall,et al. Rapidly mixing Markov chains with applications in computer science and physics , 2006, Computing in Science & Engineering.
[8] Eric Vigoda,et al. A polynomial-time approximation algorithm for the permanent of a matrix with non-negative entries , 2001, STOC '01.
[9] S. Louis Hakimi,et al. Relations between graphs and integer-pair sequences , 1976, Discret. Math..
[10] Alistair Sinclair,et al. Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow , 1992, Combinatorics, Probability and Computing.
[11] István Miklós,et al. Towards Random Uniform Sampling of Bipartite Graphs with given Degree Sequence , 2010, Electron. J. Comb..
[12] Prasad Tetali,et al. Simple Markov-chain algorithms for generating bipartite graphs and tournaments , 1997, SODA '97.
[13] Martin E. Dyer,et al. Approximately counting integral flows and cell-bounded contingency tables , 2005, STOC '05.
[14] Dana Randall,et al. Disjoint Decomposition of Markov Chains and Sampling Circuits in Cayley Graphs , 2006, Combinatorics, Probability and Computing.
[15] István Miklós,et al. Approximate Counting of Graphical Realizations , 2015, PloS one.
[16] Istv'an Mikl'os,et al. Constructing, sampling and counting graphical realizations of restricted degree sequences , 2013, 1301.7523.
[17] 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).
[18] Eric Vigoda,et al. Negative Examples for Sequential Importance Sampling of Binary Contingency Tables , 2011, Algorithmica.
[19] Kevin E. Bassler,et al. Constructing and sampling directed graphs with given degree sequences , 2011, ArXiv.
[20] Martin E. Dyer,et al. Sampling regular graphs and a peer-to-peer network , 2005, SODA '05.
[21] Dana Randall,et al. On the Diaconis-Gangolli Markov chain for sampling contingency tables with cell-bounded entries , 2009, J. Comb. Optim..
[22] Kevin E. Bassler,et al. Efficient and Exact Sampling of Simple Graphs with Given Arbitrary Degree Sequence , 2010, PloS one.
[23] Hyunju Kim,et al. Degree-based graph construction , 2009, 0905.4892.
[24] R. Perlmutter,et al. Constructing , 1971 .
[25] Isabelle Stanton,et al. Constructing and sampling graphs with a prescribed joint degree distribution , 2011, JEAL.
[26] Eric Vigoda,et al. Sampling binary contingency tables with a greedy start , 2006, SODA '06.
[27] Catherine S. Greenhill. A Polynomial Bound on the Mixing Time of a Markov Chain for Sampling Regular Directed Graphs , 2011, Electron. J. Comb..
[28] Eric Vigoda,et al. A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries , 2004, JACM.
[29] Mark Jerrum,et al. Approximating the Permanent , 1989, SIAM J. Comput..
[30] P. Diaconis,et al. Geometric Bounds for Eigenvalues of Markov Chains , 1991 .
[31] Martin E. Dyer,et al. Rapidly Mixing Markov Chains for Sampling Contingency Tables with a Constant Number of Rows , 2006, SIAM J. Comput..
[32] Murali K. Ganapathy. Robust Mixing , 2006, APPROX-RANDOM.