Approximate counting, uniform generation and rapidly mixing markov chains extended abstract

Alistair Sinclair, Mark Jerrum

Type: Book-Chapter

Publication Date: 1988-01-01

Citations: 7

DOI: https://doi.org/10.1007/3-540-19422-3_11

View Publication

Locations

Lecture notes in computer science - View

Similar Works

Action	Title	Year	Authors
+	Approximate Counting, Uniform Generation and Rapidly Mixing Markov Chains	1987	Alistair Sinclair Mark Jerrum
+	Rapidly mixing Markov chains	1991	Umesh Vazirani
+	Exact sampling and fast mixing of activated random walk	2024	Lionel Levine Feng Liang
+	Approximating Countable Markov Chains	1974	Bradford R. Cain
+	Approximating Countable Markov Chains	1983	David J. Freedman
+	Approximate regenerative-block bootstrap for Markov chains	2007	Patrice Bertail Stéphan Clémençon
+	Markov chains with replacement	1975	Elja Arjas Terence P. Speed
+	Mixing times of Markov chains: acceleration and cutoff in random environment	2023	Bastien Dubail
+	A slowly mixing Markov chain with implications for Gibbs sampling	1993	Peter Matthews
+	Construction of the Approximating Markov Chain	1992	Harold J. Kushner Paul Dupuis
+	Markov approximations of chains of infinite order	2002	R. Fern�ndez Antonio Galves
+	Rare Event Simulation and Counting Problems	2009	José Blanchet Daniel Rudoy
+ PDF Chat	Noisy Monte Carlo: convergence of Markov chains with approximate transition kernels	2014	Pierre Alquier Nial Friel Richard G. Everitt Aidan Boland
+	Markov chains and random walks with heavy-tailed increments	2004	Denis Denisov
+ PDF Chat	Translated Poisson Approximation for Markov Chains	2006	A. D. Barbour Torgny Lindvall
+ PDF Chat	Approximation of Markov chains defined by recursion relations	1986	S. A. Anichkin
+	Markov chains and random walks	2012	John B. Walsh
+	Markov Chains and Random Walks	2000	Hermann Þórisson
+	Markov Chains and Random Walks	1995	Rajeev Motwani Prabhakar Raghavan
+	Markov chains generating random permutations and set partitions	2024	Dudley Stark

Works That Cite This (2)

Action	Title	Year	Authors
+	An introduction to computational complexity in Markov Chain Monte Carlo methods	2020	Izhar Asael Alonzo Matamoros
+	Adiabatic Quantum Computation is Equivalent to Standard Quantum Computation	2004	Dorit Aharonov Wim van Dam Julia Kempe Zeph Landau Seth Lloyd Oded Regev

Works Cited by This (13)

Action	Title	Year	Authors
+	A Lower Bound for the Smallest Eigenvalue of the Laplacian	2015	Jeff Cheeger
+ PDF Chat	Eigenvalues and expanders	1986	Ilan Alon
+	λ1, Isoperimetric inequalities for graphs, and superconcentrators	1985	Noga Alon Vitali Milman
+	The complexity of computing the permanent	1979	Leslie G. Valiant
+	How hard is it to marry at random? (On the approximation of the permanent)	1986	Arndt Bröder
+	Monte-Carlo algorithms for enumeration and reliability problems	1983	Richard M. Karp Michael Luby
+ PDF Chat	Approximate counting, uniform generation and rapidly mixing Markov chains	1989	Alistair Sinclair Mark Jerrum
+ PDF Chat	Shuffling Cards and Stopping Times	1986	David Aldous Persi Diaconis
+	Conductance and the rapid mixing property for Markov chains: the approximation of permanent resolved	1988	Mark Jerrum Alistair Sinclair
+	The complexity of approximate counting	1983	Larry Stockmeyer