Rapid mixing of Gibbs sampling on graphs that are sparse on average
暂无分享,去创建一个
[1] Brendan D. McKay,et al. Subgraphs of random graphs with specified degrees , 2011 .
[2] Madhu Sudan,et al. 2-Transitivity is Insufficient for Local Testability , 2008, 2008 23rd Annual IEEE Conference on Computational Complexity.
[3] A. Barvinok. On the number of matrices and a random matrix with prescribed row and column sums and 0–1 entries☆ , 2008, 0806.1480.
[4] Leonid Gurvits,et al. Van der Waerden/Schrijver-Valiant like Conjectures and Stable (aka Hyperbolic) Homogeneous Polynomials: One Theorem for all , 2007, Electron. J. Comb..
[5] Madhu Sudan,et al. Sparse Random Linear Codes are Locally Decodable and Testable , 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).
[6] Andrea Montanari,et al. Reconstruction for Models on Random Graphs , 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).
[7] Elchanan Mossel,et al. On the hardness of sampling independent sets beyond the tree threshold , 2007, math/0701471.
[8] N. Enriquez. Convex chains in Z^2 , 2006 .
[9] Colin McDiarmid,et al. Concentration for self-bounding functions and an inequality of Talagrand , 2006 .
[10] I. Bárány,et al. On maximal convex lattice polygons inscribed in a plane convex set , 2006 .
[11] Thomas P. Hayes. A simple condition implying rapid mixing of single-site dynamics on spin systems , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).
[12] Efthimios G. Lalas,et al. The probabilistic analysis of a greedy satisfiability algorithm , 2006 .
[13] Catherine S. Greenhill,et al. Asymptotic enumeration of dense 0-1 matrices with specified line sums , 2006, J. Comb. Theory, Ser. A.
[14] Dror Weitz,et al. Counting independent sets up to the tree threshold , 2006, STOC '06.
[15] Brendan D. McKay,et al. Asymptotic enumeration of sparse 0-1 matrices with irregular row and column sums , 2006, J. Comb. Theory, Ser. A.
[16] Noga Alon,et al. Testing Reed-Muller codes , 2005, IEEE Transactions on Information Theory.
[17] Simon Litsyn,et al. Almost orthogonal linear codes are locally testable , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).
[18] Philippe Robert,et al. Survey propagation: An algorithm for satisfiability , 2005 .
[19] Venkatesan Guruswami,et al. Tolerant Locally Testable Codes , 2005, APPROX-RANDOM.
[20] Leslie Ann Goldberg,et al. Strong Spatial Mixing with Fewer Colors for Lattice Graphs , 2005, SIAM J. Comput..
[21] Brendan D. McKay,et al. Asymptotic Enumeration of Dense 0-1 Matrices with Equal Row Sums and Equal Column Sums , 2005, Electron. J. Comb..
[22] Hosam M. Mahmoud,et al. The oscillatory distribution of distances in random tries , 2005, math/0505259.
[23] Hanene Mohamed,et al. A probabilistic analysis of some tree algorithms , 2004, math/0412188.
[24] Noga Alon,et al. The Probabilistic Method, Second Edition , 2004 .
[25] Dana Ron,et al. Testing polynomials over general fields , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.
[26] Leslie Ann Goldberg,et al. Strong spatial mixing for lattice graphs with fewer colours , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.
[27] Martin E. Dyer,et al. Randomly coloring constant degree graphs , 2004, Random Struct. Algorithms.
[28] Eric Vigoda,et al. A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries , 2004, JACM.
[29] D. Gamarnik,et al. Random MAX SAT, random MAX CUT, and their phase transitions , 2004 .
[30] Alois Panholzer,et al. Distribution of the Steiner Distance in Generalized M-ary Search Trees , 2004, Combinatorics, Probability and Computing.
[31] Alessandro Vespignani,et al. A statistical approach to the traceroute-like exploration of networks: theory and simulations , 2004, ArXiv.
[32] Helmut Prodinger,et al. Spanning tree size in random binary search trees , 2004, math/0405292.
[33] Alexandr V. Kostochka,et al. Coloring uniform hypergraphs with few colors , 2004, Random Struct. Algorithms.
[34] Brendan D. McKay,et al. Asymptotic enumeration of 0–1 matrices with equal row sums and equal column sums , 2003 .
[35] Fabio Martinelli,et al. The Ising model on trees: boundary conditions and mixing time , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..
[36] A. Sinclair,et al. Glauber Dynamics on Trees: Boundary Conditions and Mixing Time , 2003, math/0307336.
[37] Eli Ben-Sasson,et al. Some 3CNF properties are hard to test , 2003, STOC '03.
[38] Elchanan Mossel,et al. Glauber dynamics on trees and hyperbolic graphs , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[39] Eric Vigoda,et al. A Note on the Glauber Dynamics for Sampling Independent Sets , 2001, Electron. J. Comb..
[40] Peng Ding,et al. Minimum-weight codewords as generators of generalized Reed-Muller codes , 2000, IEEE Trans. Inf. Theory.
[41] Martin E. Dyer,et al. On Markov Chains for Independent Sets , 2000, J. Algorithms.
[42] Martin E. Dyer,et al. On counting independent sets in sparse graphs , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).
[43] Noga Alon,et al. Regular languages are testable with a constant number of queries , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).
[44] Imre Bárány,et al. Sylvester's question : The probability that n points are in convex position , 1999 .
[45] Imre Brny. in Convex Position , 1999 .
[46] P. Diaconis,et al. Longest increasing subsequences: from patience sorting to the Baik-Deift-Johansson theorem , 1999 .
[47] R. Pemantle,et al. Robust Phase Transitions for Heisenberg and other Models on General Trees , 1999, math/0404092.
[48] Brendan D. McKay,et al. Asymptotic Enumeration of Eulerian Circuits in the Complete Graph , 1998, Combinatorics, Probability and Computing.
[49] Madhu Sudan,et al. Improved Low-Degree Testing and its Applications , 1997, STOC '97.
[50] László Lovász,et al. Interactive proofs and the hardness of approximating cliques , 1996, JACM.
[51] Ronitt Rubinfeld,et al. Robust Characterizations of Polynomials with Applications to Program Testing , 1996, SIAM J. Comput..
[52] Mark Jerrum,et al. A Very Simple Algorithm for Estimating the Number of k-Colorings of a Low-Degree Graph , 1995, Random Struct. Algorithms.
[53] P. Flajolet,et al. Mellin Transforms and Asymptotics: Harmonic Sums , 1995, Theor. Comput. Sci..
[54] P. Valtr,et al. Probability thatn random points are in convex position , 1995, Discret. Comput. Geom..
[55] Madhu Sudan,et al. Some improvements to total degree tests , 1995, Proceedings Third Israel Symposium on the Theory of Computing and Systems.
[56] F. Martinelli,et al. Approach to equilibrium of Glauber dynamics in the one phase region , 1994 .
[57] Alan M. Frieze,et al. Hamilton Cycles in Random Regular Digraphs , 1994, Combinatorics, Probability and Computing.
[58] Carsten Lund,et al. Non-deterministic exponential time has two-prover interactive protocols , 1992, computational complexity.
[59] Carsten Lund,et al. Proof verification and hardness of approximation problems , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.
[60] D. Stroock,et al. The logarithmic sobolev inequality for discrete spin systems on a lattice , 1992 .
[61] C. Thomassen. The even cycle problem for directed graphs , 1992 .
[62] Leonid A. Levin,et al. Checking computations in polylogarithmic time , 1991, STOC '91.
[63] Brendan D. McKay,et al. The asymptotic numbers of regular tournaments, Eulerian digraphs and Eulerian oriented graphs , 1990, Comb..
[64] B. Zegarliński,et al. On log-Sobolev inequalities for infinite lattice systems , 1990 .
[65] M. Jerrum,et al. Polynomial-Time Approximation Algorithms for Ising Model (Extended Abstract) , 1990 .
[66] Mark Jerrum,et al. Polynomial-Time Approximation Algorithms for the Ising Model , 1990, SIAM J. Comput..
[67] Manuel Blum,et al. Self-testing/correcting with applications to numerical problems , 1990, STOC '90.
[68] R. Lyons. The Ising model and percolation on trees and tree-like graphs , 1989 .
[69] Stephen D. Cohen,et al. Functions and polynomials in vector spaces , 1987 .
[70] Brendan D. McKay,et al. The number of matchings in random regular graphs and bipartite graphs , 1986, J. Comb. Theory, Ser. B.
[71] Donald Geman,et al. Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images , 1984, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[72] N. Wormald. Some problems in the enumeration of labelled graphs , 1980, Bulletin of the Australian Mathematical Society.
[73] B. Logan,et al. A Variational Problem for Random Young Tableaux , 1977 .
[74] Philippe Delsarte,et al. On cyclic codes that are invariant under the general linear group , 1970, IEEE Trans. Inf. Theory.
[75] Jean-Marie Goethals,et al. On Generalized Reed-Muller Codes and Their Relatives , 1970, Inf. Control..
[76] P. Erdos. On a combinatorial problem. II , 1964 .
[77] W. M. Schmidt. Ein kombinatorisches Problem von P. Erdős und A. Hajnal , 1964 .
[78] W. Hoeffding. Probability inequalities for sum of bounded random variables , 1963 .
[79] P. Robert,et al. A stochastic model for the topology discovery of tree networks ? , 2005 .
[80] Hosam M. Mahmoud,et al. Distribution of distances in random binary search trees , 2003 .
[81] Aravind Srinivasan,et al. Improved bounds and algorithms for hypergraph 2-coloring , 2000, Random Struct. Algorithms.
[82] Günter Rote,et al. A Central Limit Theorem for Convex Chains in the Square , 2000, Discret. Comput. Geom..
[83] Brendan D. McKay,et al. Asymptotic enumeration of tournaments with a given score sequence containing a specified digraph , 2000, Random Struct. Algorithms.
[84] F. Martinelli. Lectures on Glauber dynamics for discrete spin models , 1999 .
[85] Sanjeev Arora,et al. Probabilistic checking of proofs: a new characterization of NP , 1998, JACM.
[86] M. Talagrand. A new look at independence , 1996 .
[87] Brendan D. McKay,et al. Asymptotic Enumeration of Tournaments with a Given Score Sequence , 1996, J. Comb. Theory, Ser. A.
[88] Xiaoji Wang,et al. Asymptotic enumeration of Eulerian digraphs with multiple edges , 1992, Australas. J Comb..
[89] N. Alon,et al. The Probabilistic Method , 1992, SODA.
[90] R. Holley,et al. Rapid Convergence to Equilibrium of Stochastic Ising Models in the Dobrushin Shlosman Regime , 1987 .
[91] J. Neveu,et al. Arbres et processus de Galton-Watson , 1986 .
[92] Joel H. Spencer,et al. Coloring n-Sets Red and Blue , 1981, J. Comb. Theory, Ser. A.
[93] L. Lovász. Combinatorial problems and exercises , 1979 .
[94] J. Beck,et al. On 3-chromatic hypergraphs , 1978, Discret. Math..
[95] J. Beck,et al. On a combinatorial problem of P. Erdös and L. Lovász , 1977, Discret. Math..
[96] Edward A. Bender,et al. The asymptotic number of non-negative integer matrices with given row and column sums , 1974, Discret. Math..
[97] A. Rényi,et al. über die konvexe Hülle von n zufällig gewählten Punkten , 1963 .
[98] de Ng Dick Bruijn. A combinatorial problem , 1946 .
[99] Noga Alon,et al. Graphs and Combinatorics © Springer-Verlag 1988 Every 8-Uniform 8-Regular Hypergraph Is 2-Colorable , 2022 .