The Markov chain Monte Carlo method: an approach to approximate counting and integration
暂无分享,去创建一个
[1] G. G. Stokes. "J." , 1890, The New Yale Book of Quotations.
[2] J. K. Roberts,et al. Some properties of adsorbed films of oxygen on tungsten , 1935, Proceedings of the Royal Society of London. Series A - Mathematical and Physical Sciences.
[3] J. Uspensky. Introduction to mathematical probability , 1938 .
[4] N. Metropolis,et al. Equation of State Calculations by Fast Computing Machines , 1953, Resonance.
[5] E. Cohen,et al. A cell-cluster theory for the liquid state. II , 1954 .
[6] P. W. Kasteleyn. The statistics of dimers on a lattice: I. The number of dimer arrangements on a quadratic lattice , 1961 .
[7] M. Fisher. Statistical Mechanics of Dimers on a Plane Lattice , 1961 .
[8] M. Fisher,et al. Dimer problem in statistical mechanics-an exact result , 1961 .
[9] J. Edmonds. Paths, Trees, and Flowers , 1965, Canadian Journal of Mathematics - Journal Canadien de Mathematiques.
[10] J. Cheeger. A lower bound for the smallest eigenvalue of the Laplacian , 1969 .
[11] O. J. Heilmann,et al. Theory of monomer-dimer systems , 1972 .
[12] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[13] Leslie G. Valiant,et al. The Complexity of Computing the Permanent , 1979, Theor. Comput. Sci..
[14] Leslie G. Valiant,et al. The Complexity of Enumeration and Reliability Problems , 1979, SIAM J. Comput..
[15] P. Flajolet. On approximate counting , 1982 .
[16] D. Aldous. Some Inequalities for Reversible Markov Chains , 1982 .
[17] D. Aldous. Random walks on finite groups and rapidly mixing markov chains , 1983 .
[18] C. D. Gelatt,et al. Optimization by Simulated Annealing , 1983, Science.
[19] Richard M. Karp,et al. Monte-Carlo algorithms for enumeration and reliability problems , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).
[20] P. Diaconis,et al. Testing for independence in a two-way table , 1985 .
[21] A. Sokal,et al. New Monte Carlo method for the self-avoiding walk , 1985 .
[22] N. Alon,et al. il , , lsoperimetric Inequalities for Graphs , and Superconcentrators , 1985 .
[23] Noga Alon,et al. lambda1, Isoperimetric inequalities for graphs, and superconcentrators , 1985, J. Comb. Theory, Ser. B.
[24] N. Alon. Eigenvalues and expanders , 1986, Comb..
[25] Andrei Z. Broder,et al. How hard is it to marry at random? (On the approximation of the permanent) , 1986, STOC '86.
[26] P. Diaconis,et al. SHUFFLING CARDS AND STOPPING-TIMES , 1986 .
[27] György Elekes,et al. A geometric inequality and the complexity of computing volume , 1986, Discret. Comput. Geom..
[28] Leslie G. Valiant,et al. Random Generation of Combinatorial Structures from a Uniform Distribution , 1986, Theor. Comput. Sci..
[29] Wang,et al. Nonuniversal critical dynamics in Monte Carlo simulations. , 1987, Physical review letters.
[30] M. Jerrum. Two-dimensional monomer-dimer systems are computationally intractable , 1987 .
[31] D. Aldous. On the Markov Chain Simulation Method for Uniform Combinatorial Distributions and Simulated Annealing , 1987, Probability in the Engineering and Informational Sciences.
[32] A. Sokal,et al. Bounds on the ² spectrum for Markov chains and Markov processes: a generalization of Cheeger’s inequality , 1988 .
[33] D. Stroock,et al. Simulated annealing via Sobolev inequalities , 1988 .
[34] M. Luby,et al. Polytopes, permanents and graphs with large factors , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.
[35] A. Sinclair. Randomised algorithms for counting and generating combinatorial structures , 1988 .
[36] Bruce E. Hajek,et al. The time complexity of maximum matching by simulated annealing , 1988, JACM.
[37] P. Diaconis. Group representations in probability and statistics , 1988 .
[38] Martin E. Dyer,et al. On the Complexity of Computing the Volume of a Polyhedron , 1988, SIAM J. Comput..
[39] Cecilia R. Aragon,et al. Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning , 1989, Oper. Res..
[40] Milena Mihail,et al. Conductance and convergence of Markov chains-a combinatorial treatment of expanders , 1989, 30th Annual Symposium on Foundations of Computer Science.
[41] Mark Jerrum,et al. Approximating the Permanent , 1989, SIAM J. Comput..
[42] Rajeev Motwani,et al. Expanding graphs and the average-case analysis of algorithms for matchings and related problems , 1989, STOC '89.
[43] Martin E. Dyer,et al. A random polynomial-time algorithm for approximating the volume of convex bodies , 1991, JACM.
[44] Milena Mihail,et al. On Coupling and the Approximation of the Permanent , 1989, Inf. Process. Lett..
[45] Mark Jerrum,et al. Approximate Counting, Uniform Generation and Rapidly Mixing Markov Chains , 1987, International Workshop on Graph-Theoretic Concepts in Computer Science.
[46] Seinosuke Toda. On the computational power of PP and (+)P , 1989, 30th Annual Symposium on Foundations of Computer Science.
[47] Andrei Z. Broder,et al. Generating random spanning trees , 1989, 30th Annual Symposium on Foundations of Computer Science.
[48] Mark Jerrum,et al. Fast Uniform Generation of Regular Graphs , 1990, Theor. Comput. Sci..
[49] Dominic J. A. Welsh,et al. The Computational Complexity of Some Classical Problems from Statistical Physics , 1990 .
[50] David Aldous,et al. The Random Walk Construction of Uniform Spanning Trees and Uniform Labelled Trees , 1990, SIAM J. Discret. Math..
[51] Cecilia R. Aragon,et al. Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning , 1991, Oper. Res..
[52] Galen H. Sasaki. The Effect of the Density of States on the Metropolis Algorithm , 1991, Inf. Process. Lett..
[53] P. Matthews. Generating a Random Linear Extension of a Partial Order , 1991 .
[54] M. Dyer. Computing the volume of convex bodies : a case where randomness provably helps , 1991 .
[55] L. Khachiyan,et al. On the conductance of order Markov chains , 1991 .
[56] P. Diaconis,et al. Geometric Bounds for Eigenvalues of Markov Chains , 1991 .
[57] David Applegate,et al. Sampling and integration of near log-concave functions , 1991, STOC '91.
[58] Tomás Feder,et al. Balanced matroids , 1992, STOC '92.
[59] Alistair Sinclair,et al. Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow , 1992, Combinatorics, Probability and Computing.
[60] Mark Jerrum,et al. A mildly exponential approximation algorithm for the permanent , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.
[61] Mark Jerrum,et al. Large Cliques Elude the Metropolis Process , 1992, Random Struct. Algorithms.
[62] Alan M. Frieze,et al. Counting the Number of Hamilton Cycles in Random Digraphs , 1992, Random Struct. Algorithms.
[63] Alistair Sinclair,et al. Improved Bounds for Mixing Rates of Marked Chains and Multicommodity Flow , 1992, LATIN.
[64] Mark Jerrum,et al. Uniform Sampling Modulo a Group of Symmetries Using Markov Chain Simulation , 1992, Expanding Graphs.
[65] P. Diaconis,et al. COMPARISON THEOREMS FOR REVERSIBLE MARKOV CHAINS , 1993 .
[66] Mark Jerrum,et al. Polynomial-Time Approximation Algorithms for the Ising Model , 1990, SIAM J. Comput..
[67] Miklós Simonovits,et al. Random Walks in a Convex Body and an Improved Volume Algorithm , 1993, Random Struct. Algorithms.
[68] V. Ramachandran. Proceedings of the fourth annual ACM-SIAM symposium on Discrete algorithms , 1993 .
[69] Mark Jerrum,et al. Simulated annealing for graph bisection , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.
[70] Martin E. Dyer,et al. A Mildly Exponential Time Algorithm for Approximating the Number of Solutions to a Multidimensional Knapsack Problem , 1993, Combinatorics, Probability and Computing.
[71] David Gillman,et al. A Chernoff bound for random walks on expander graphs , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.
[72] Dana Randall,et al. Testable algorithms for self-avoiding walks , 1994, SODA '94.
[73] Ravi Kannan,et al. Markov chains and polynomial time algorithms , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.
[74] Christos H. Papadimitriou,et al. On the Random Walk Method for Protocol Testing , 1994, CAV.
[75] Martin E. Dyer,et al. Approximately counting Hamilton cycles in dense graphs , 1994, SODA '94.
[76] Mark Jerrum,et al. Three-Dimensional Statistical Data Security Problems , 1994, SIAM J. Comput..
[77] Dana Randall,et al. Markov chain algorithms for planar lattice structures , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.
[78] Sridhar R. Tayur,et al. A Randomized Algorithm to Optimize Over Certain Convex Sets , 1995, Math. Oper. Res..
[79] M. Jerrum. The Computational Complexity of Counting , 1995 .
[80] Miklós Simonovits,et al. Isoperimetric problems for convex bodies and a localization lemma , 1995, Discret. Comput. Geom..
[81] Mark Jerrum,et al. A Very Simple Algorithm for Estimating the Number of k-Colorings of a Low-Degree Graph , 1995, Random Struct. Algorithms.
[82] A. Sinclair,et al. Approximating the number of monomer-dimer coverings of a lattice , 1996 .
[83] David Bruce Wilson,et al. Exact sampling with coupled Markov chains and applications to statistical mechanics , 1996, Random Struct. Algorithms.
[84] Nabil Kahale,et al. A semidefinite bound for mixing rates of Markov chains , 1996, Random Struct. Algorithms.
[85] J. Propp,et al. Exact sampling with coupled Markov chains and applications to statistical mechanics , 1996 .
[86] Nabil Kahale. Large Deviation Bounds for Markov Chains , 1997, Comb. Probab. Comput..