Skip to main content

We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.

Close cookie message
Cancel
×
×
Home
  • Home
Article
  • Cited by 146
  • Cited by
    Crossref Citations
    Crossref logo
    This article has been cited by the following publications. This list is generated based on data provided by CrossRef.
    Cooper, Colin Dyer, Martin Greenhill, Catherine and Handley, Andrew 2018. The flip Markov chain for connected regular graphs. Discrete Applied Mathematics,
    Giroire, Frédéric Perennes, Stephane and Tahiri, Issam 2018. Grid spanners with low forwarding index for energy efficient networks. Discrete Applied Mathematics, Vol. 246, Issue. , p. 99.
    Mondragón, Raúl J 2018. Core-biased random walks in networks. Journal of Complex Networks,
    Fosdick, Bailey K. Larremore, Daniel B. Nishimura, Joel and Ugander, Johan 2018. Configuring Random Graph Models with Fixed Degree Sequences. SIAM Review, Vol. 60, Issue. 2, p. 315.
    Gheissari, Reza and Lubetzky, Eyal 2018. Mixing Times of Critical Two-Dimensional Potts Models. Communications on Pure and Applied Mathematics, Vol. 71, Issue. 5, p. 994.
    Wang, Zheng and Ling, Cong 2018. On the Geometric Ergodicity of Metropolis-Hastings Algorithms for Lattice Gaussian Sampling. IEEE Transactions on Information Theory, Vol. 64, Issue. 2, p. 738.
    Stanley, Caprice and Windisch, Tobias 2018. Heat-bath random walks with Markov bases. Advances in Applied Mathematics, Vol. 92, Issue. , p. 122.
    Caha, Libor Landau, Zeph and Nagaj, Daniel 2018. Clocks in Feynman's computer and Kitaev's local Hamiltonian: Bias, gaps, idling, and pulse tuning. Physical Review A, Vol. 97, Issue. 6,
    Greenhill, Catherine and Sfragara, Matteo 2018. The switch Markov chain for sampling irregular graphs and digraphs. Theoretical Computer Science, Vol. 719, Issue. , p. 1.
    Avin, Chen Koucký, Michal and Lotker, Zvi 2018. Cover time and mixing time of random walks on dynamic graphs. Random Structures & Algorithms, Vol. 52, Issue. 4, p. 576.
    McDiarmid, Colin Scott, Alex and Withers, Paul 2017. Uniform multicommodity flows in the hypercube with random edge-capacities. Random Structures & Algorithms, Vol. 50, Issue. 3, p. 437.
    Dyer, Martin Jerrum, Mark and Müller, Haiko 2017. On the Switch Markov Chain for Perfect Matchings. Journal of the ACM, Vol. 64, Issue. 2, p. 1.
    Temme, Kristan 2017. Thermalization Time Bounds for Pauli Stabilizer Hamiltonians. Communications in Mathematical Physics, Vol. 350, Issue. 2, p. 603.
    Collevecchio, Andrea Garoni, Timothy M. Hyndman, Timothy and Tokarev, Daniel 2016. The Worm Process for the Ising Model is Rapidly Mixing. Journal of Statistical Physics, Vol. 164, Issue. 5, p. 1082.
    Abhinav Das, N. V. and Kashyap, Navin 2016. MCMC Methods for Drawing Random Samples From the Discrete-Grains Model of a Magnetic Medium. IEEE Journal on Selected Areas in Communications, Vol. 34, Issue. 9, p. 2430.
    Ma, Yu Tao Wang, Ran and Wu, Li Ming 2016. Logarithmic Sobolev, isoperimetry and transport inequalities on graphs. Acta Mathematica Sinica, English Series, Vol. 32, Issue. 10, p. 1221.
    Misumi, Jun 2016. The Mixing Time of a Random Walk on a Long-Range Percolation Cluster in Pre-Sierpinski Gasket. Journal of Statistical Physics, Vol. 165, Issue. 1, p. 153.
    Chiericetti, Flavio Dasgupta, Anirban Kumar, Ravi Lattanzi, Silvio and Sarlós, Tamás 2016. On Sampling Nodes in a Network. p. 471.
    Matta, John Ercal, Gunes and Stimson, William 2016. The Quality of Sampling from Geographic Networks. International Journal of Distributed Sensor Networks, Vol. 12, Issue. 4, p. 7379030.
    Crosson, Elizabeth and Harrow, Aram W. 2016. Simulated Quantum Annealing Can Be Exponentially Faster Than Classical Simulated Annealing. p. 714.
    Download full list
    ×
  • Get access
    Add to cart USD35.00
    Check if you have access via personal or institutional login
    Log in Register Recommend to librarian

Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow

  • Alistair Sinclair (a1)
Abstract

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 upper bound on the mixing rate, based on the solution to a multicommodity flow problem in the Markov chain viewed as a graph. The bound gives sharper estimates for the mixing rate of several important complex Markov chains. As a result, improved bounds are obtained for the runtimes of randomised approximation algorithms for various problems, including computing the permanent of a 0–1 matrix, counting matchings in graphs, and computing the partition function of a ferromagnetic Ising system. Moreover, solutions to the multicommodity flow problem are shown to capture the mixing rate quite closely: thus, under fairly general conditions, a Markov chain is rapidly mixing if and only if it supports a flow of low cost.

Copyright
COPYRIGHT: © Cambridge University Press 1992
References
Hide All
[1]Aldous, D. (1982) Some inequalities for reversible Markov chains. Journal of the London Mathematical Society (2) 25 564–576.
[2]Aldous, D. (1987) On the Markov chain simulation method for uniform combinatorial distributions and simulated annealing. Probability in the Engineering and Informational Sciences 1 33–46.
[3]Alon, N. (1986) Eigenvalues and expanders. Combinatorica 6 83–96.
[4]Alon, N. and Milman, V. D. (1985) λ1, isoperimetric inequalities for graphs and superconcentrators. Journal of Combinatorial Theory Series B 38 73–88.
[5]Broder, A. Z. (1986) How hard is it to marry at random? (On the approximation of the permanent). Proceedings of the 18th ACM Symposium on Theory of Computing, 50–58. Erratum in Proceedings of the 20th ACM Symposium on Theory of Computing (1988) 551.
[6]Dagum, P., Luby, M., Mihail, M. and Vazirani, U. V. (1988) Polytopes, permanents and graphs with large factors. Proceedings of the 29th IEEE Symposium on Foundations of Computer Science 412–421.
[7]Diaconis, P. (1988) Group representations in probability and statistics, Lecture Notes Monograph Series Vol. 11, Institute of Mathematical Statistics, Hayward, California.
[8]Diaconis, P., and Stroock, D. (1991) Geometric bounds for eigenvalues of Markov chains. Annals of Applied Probability 1 36–61.
[9]Dyer, M., Frieze, A. and Kannan, R. (1989) A random polynomial time algorithm for approximating the volume of convex bodies. Proceedings of the 21st ACM Symposium on Theory of Computing 375–381.
[10]Fill, J. Unpublished manuscript.
[11]Jerrum, M. R. and Sinclair, A. J. (1989) Approximating the permanent. SIAM Journal on Computing 18 1149–1178.
[12]Jerrum, M. R. and Sinclair, A. J. (1990) Fast Uniform Generation of Regular Graphs. Theoretical Computer Science 73 91–100.
[13]Jerrum, M. R. and Sinclair, A. J. (1993) Polynomial-time approximation algorithms for the Ising model, Technical Report CSR-1–90, Dept. of Computer Science, University of Edinburgh. (To appear in SIAM Journal on Computing, August 1993; Extended Abstract in Proceedings of the 17th International Colloquium on Automata, Languages and Programming (1990). Springer LNCS 443 462–475.)
[14]Karzanov, A. and Khachiyan, L. (1990) On the conductance of order Markov chains, Technical Report DCS 268, Rutgers University.
[15]Keilson, J. (1979) Markov chain models – rarity and exponentiality, Springer-Verlag, New York.
[16]Lawler, G. F. and Sokal, A. D. (1988) Bounds on the L 2 spectrum for Markov chains and Markov processes: a generalization of Cheeger's inequality. Transactions of the American Mathematical Society 309 557–580.
[17]Leighton, T. and Rao, S. (1988) An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms. Proceedings of the 29th IEEE Symposium on Foundations of Computer Science 422–431.
[18]Matula, D. W. and Shahrokhi, F. (1990) Sparsest cuts and bottlenecks in graphs. Discrete Applied Mathematics 27 113–123.
[19]Mihail, M. (1989) Conductance and convergence of Markov chains: a combinatorial treatment of expanders. Proceedings of the 30th IEEE Symposium on Foundations of Computer Science 526–531.
[20]Mihail, M. and Winkler, P. (1992) On the number of Eulerian orientations of a graph. Proceedings of the 3rd ACM-SIAM Symposium on Discrete Algorithms 138–145.
[21]Mohar, B. (1989) Isoperimetric numbers of graphs. Journal of Combinatorial Theory, Series B 47 274–291.
[22]Shahrokhi, F. and Matula, D. W. (1990) The maximum concurrent flow problem. Journal of the ACM 37 318–334.
[23]Sinclair, A. J. (1988) Algorithms for random generation and counting: a Markov chain approach, PhD Thesis, University of Edinburgh. (Revised version appeared as a monograph in the series Progress in Theoretical Computer Science, Birkhäuser, Boston, 1992.)
[24]Sinclair, A. J. and Jerrum, M. R. (1989) Approximate counting, uniform generation and rapidly mixing Markov chains. Information and Computation 82 93–133.
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Combinatorics, Probability and Computing
  • ISSN: 0963-5483
  • EISSN: 1469-2163
  • URL: /core/journals/combinatorics-probability-and-computing
Please enter your name
Please enter a valid email address
Who would you like to send this to? *

CAPTCHA *

Skip to the audio challenge
×

Metrics

Altmetric attention score

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed

Cancel
Confirm
×