Approximate counting, uniform generation and rapidly mixing Markov chains
- 1 July 1989
- journal article
- Published by Elsevier in Information and Computation
- Vol. 82 (1) , 93-133
- https://doi.org/10.1016/0890-5401(89)90067-9
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- A Probabilistic Proof of an Asymptotic Formula for the Number of Labelled Regular GraphsPublished by Elsevier ,2013
- Strong uniform times and finite random walksAdvances in Applied Mathematics, 1987
- On the Markov Chain Simulation Method for Uniform Combinatorial Distributions and Simulated AnnealingProbability in the Engineering and Informational Sciences, 1987
- Eigenvalues and expandersCombinatorica, 1986
- Shuffling Cards and Stopping TimesThe American Mathematical Monthly, 1986
- Random generation of combinatorial structures from a uniform distributionTheoretical Computer Science, 1986
- λ1, Isoperimetric inequalities for graphs, and superconcentratorsJournal of Combinatorial Theory, Series B, 1985
- Difference equations, isoperimetric inequality and transience of certain random walksTransactions of the American Mathematical Society, 1984
- Random spanning treeJournal of Algorithms, 1983
- Computational Complexity of Probabilistic Turing MachinesSIAM Journal on Computing, 1977