Improved Bounds for Mixing Rates of Marcov Chains and Multicommodity Flow

@article{Sinclair1992ImprovedBF,
  title={Improved Bounds for Mixing Rates of Marcov Chains and Multicommodity Flow},
  author={A. Sinclair},
  journal={Comb. Probab. Comput.},
  year={1992},
  volume={1},
  pages={351-370}
}
  • A. Sinclair
  • Published 1992
  • Mathematics, Computer Science
  • Comb. Probab. Comput.
The paper is concerned with tools for the quantitative analysis of finite Markov chains whose states are combinatorial structures. Chains of this kind have algorithmic applications in many areas, including random sampling, approximate counting, statistical physics and combinatorial optimisation. The efficiency of the resulting algorithms depends crucially on the mixing rate of the chain, i.e. , the time taken for it to reach its stationary or equilibrium distribution. The paper presents a new… Expand
326 Citations
On Markov Chains for Independent Sets
  • 154
  • PDF
Markov chains for sampling matchings
  • 10
  • PDF
Improved Bounds for Mixing Rates of Marked Chains and Multicommodity Flow
  • 120
Speeding up Switch Markov Chains for Sampling Bipartite Graphs with Given Degree Sequence
  • 3
  • PDF
Rapidly Mixing Markov Chains: A Comparison of Techniques (A Survey)
  • 31
  • PDF
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 25 REFERENCES
Approximate Counting, Uniform Generation and Rapidly Mixing Markov Chains
  • 518
  • PDF
Approximating the Permanent
  • 776
  • PDF
Geometric Bounds for Eigenvalues of Markov Chains
  • 871
  • Highly Influential
  • PDF
On the Markov Chain Simulation Method for Uniform Combinatorial Distributions and Simulated Annealing
  • 163
How hard is it to marry at random? (On the approximation of the permanent)
  • A. Broder
  • Computer Science, Mathematics
  • STOC '86
  • 1986
  • 178
Polytopes, permanents and graphs with large factors
  • 58
  • PDF
Fast Uniform Generation of Regular Graphs
  • 113
An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms
  • F. Leighton, S. Rao
  • Mathematics, Computer Science
  • [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science
  • 1988
  • 529
  • Highly Influential
  • PDF
Algorithms for Random Generation and Counting: A Markov Chain Approach
  • A. Sinclair
  • Mathematics, Computer Science
  • Progress in Theoretical Computer Science
  • 1993
  • 471
Bounds on the ² spectrum for Markov chains and Markov processes: a generalization of Cheeger’s inequality
  • 299
  • PDF
...
1
2
3
...