Markov Chains and Mixing Times
The DOI matches its Crossref record.
Abstract
Markov Chains and Mixing Times is a magical book, managing to be both friendly and deep. It gently introduces probabilistic techniques so that an outsider can follow. At the same time, it is the first book covering the geometric theory of Markov chains and has much that will be new to experts. It is certainly THE book that I will use to teach from. I recommend it to all comers, an amazing achievement. -Persi Diaconis, Mary V. Sunseri Professor of Statistics and Mathematics, Stanford University Mixing times are an active research topic within many fields from statistical physics to the theory of algorithms, as well as having intrinsic interest within mathematical probability and exploiting discrete analogs of important geometry concepts. The first edition became an instant classic, being accessible to advanced undergraduates and yet bringing readers close to current research frontiers. This second edition adds chapters on monotone chains, the exclusion process and hitting time parameters. Having both exercises and citations to important research papers it makes an outstanding basis for either a lecture course or self-study. -David Aldous, University of California, Berkeley Mixing time is the key to Markov chain Monte Carlo, the queen of approximation techniques. With new chapters on monotone chains, exclusion processes, and set-hitting, Markov Chains and Mixing Times is more comprehensive and thus more indispensable than ever. Prepare for an eye-opening mathematical tour! -Peter Winkler, Dartmouth College The study of finite Markov chains has recently attracted increasing interest from a variety of researchers. This is the second edition of a very valuable book on the subject. The main focus is on the mixing time of Markov chains, but there is a lot of additional material. In this edition, the authors have taken the opportunity to add new material and bring the reader up to date on the latest research. I have used the first edition in a graduate course and I look forward to using this edition for the same purpose in the near future. -Alan Frieze, Carnegie Mellon University This book is an introduction to the modern theory of Markov chains, whose goal is to determine the rate of convergence to the stationary distribution, as a function of state space size and geometry. This topic has important connections to combinatorics, statistical physics, and theoretical computer science. Many of the techniques presented originate in these disciplines. The central tools for estimating convergence times, including coupling, strong stationary times, and spectral methods, are developed. The authors discuss many examples, including card shuffling and the Ising model, from statistical mechanics, and present the connection of random walks to electrical networks and apply it to estimate hitting and cover times. The first edition has been used in courses in mathematics and computer science departments of numerous universities. The second edition features three new chapters (on monotone chains, the exclusion process, and stationary times) and also includes smaller additions and corrections throughout. Updated notes at the end of each chapter inform the reader of recent research developments.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Citations
Cites
Still being checked.
Cited by
Items 901–1,000 of 1,000
Strong data processing inequalities and $Φ$-Sobolev inequalities for discrete channelsPreprint
Raginsky, M. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1411.3575 · Cited by 16
Gel'fand triples and boundaries of innite networksPreprint
Jørgensen, P. E. T., & Pearse, E. P. J. (2011) · arXiv (Cornell University) · Cited by 16
Estimating the Spectral Gap of a Reversible Markov Chain from a Short TrajectoryPreprint
Levin, D., & Peres, Y. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1612.05330 · Cited by 16
Self-citationQuantum ground state isoperimetric inequalities for the energy spectrum of local HamiltoniansPreprint
Crosson, E., & Bowen, J. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1703.10133 · Cited by 16
Markov Chain Monte Carlo Algorithms for Lattice Gaussian SamplingPreprint
Wang, Z., Ling, C., & Hanrot, G. (n.d.) · Cited by 16
Total variation bound for Kac’s random walk
Jiang, Y. (2012) · The Annals of Applied Probability · doi:10.1214/11-aap810 · Cited by 15
Mixing Times for the Mean-Field Blume-Capel Model via Aggregate Path Coupling
Kovchegov, Y., Otto, P. T., & Titus, M. (2011) · Journal of Statistical Physics · doi:10.1007/s10955-011-0286-8 · Cited by 15
Perfect sampling for closed queueing networks
Bouillard, A., Bušić, A., & Rovetta, C. (2014) · Performance Evaluation · doi:10.1016/j.peva.2014.07.010 · Cited by 15
Tsourakakis, C. E. (2015) · International World Wide Web Conference (WWW) · doi:10.1145/2736277.2741128 · Cited by 15
Windisch, T. (2016) · SIAM Journal on Discrete Mathematics · doi:10.1137/15m1022045 · Cited by 15
On the Effective Impedance of Finite and Infinite Networks
Muranova, A. (2021) · Potential Analysis · doi:10.1007/s11118-021-09901-8 · Cited by 15
The diameter of the uniform spanning tree of dense graphs
Alon, N., Nachmias, A., & Shalev, M. (2022) · Combinatorics Probability Computing · doi:10.1017/s0963548322000062 · Cited by 15
Zhou, F., Luo, S., Qie, X., Ye, J., & Zhu, H. (2021) · Journal of the American Statistical Association · doi:10.1080/01621459.2021.1898409 · Cited by 15
Simple parallel algorithms for single-site dynamics
Liu, H., & Yin, Y. (2022) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/3519935.3519999 · Cited by 15
Uniformly sampling random directed hypergraphs with fixed degrees
Kraakman, Y. J., & Stegehuis, C. (2026) · Discrete Mathematics · doi:10.1016/j.disc.2025.114961 · Cited by 15
Mixing times for a constrained Ising process on the torus at low density
Pillai, N. S., & Smith, A. D. (2017) · The Annals of Probability · doi:10.1214/15-aop1080 · Cited by 15
Random walks on stochastic hyperbolic half planar triangulations
Angel, O., Nachmias, A., & Ray, G. (2016) · Random Structures and Algorithms · doi:10.1002/rsa.20625 · Cited by 15
Mixing Properties of CSMA Networks on Partite Graphs
Zocca, A., Borst, S. C., & van Leeuwaarden, J. S. H. (2012) · International ICST Conference on Performance Evaluation Methodologies and Tools (VALUETOOLS) · doi:10.4108/valuetools.2012.250264 · Cited by 15
Dynamic disorder in simple enzymatic reactions induces stochastic amplification of substrate
Gupta, A., Milias‐Argeitis, A., & Khammash, M. (2017) · Journal of The Royal Society Interface · doi:10.1098/rsif.2017.0311 · Cited by 15
Counting Walks and Graph Homomorphisms via Markov Chains and Importance Sampling
Levin, D., & Peres, Y. (2017) · American Mathematical Monthly · doi:10.4169/amer.math.monthly.124.7.637 · Cited by 15
Self-citationCentral limit theorems for network driven sampling
Li, X., & Rohe, K. (2017) · Electronic Journal of Statistics · doi:10.1214/17-ejs1333 · Cited by 15
Raptis, T. P. (2020) · Online Social Networks and Media · doi:10.1016/j.osnem.2020.100069 · Cited by 15
Harmonic functions of linear growth on solvable groups
Meyerovitch, T., & Yadin, A. (2016) · Israel Journal of Mathematics · doi:10.1007/s11856-016-1406-6 · Cited by 15
Hitting times for second-order random walks
Fasino, D., Tonetto, A., & Tudisco, F. (2022) · European Journal of Applied Mathematics · doi:10.1017/s0956792522000213 · Cited by 15
On meteors, earthworms and WIMPs
Billey, S., Burdzy, K., Pal, S., & Sagan, B. E. (2015) · The Annals of Applied Probability · doi:10.1214/14-aap1035 · Cited by 15
Entropy-Driven Cutoff Phenomena
Lancia, C., Nardi, F. R., & Scoppola, B. (2012) · Journal of Statistical Physics · doi:10.1007/s10955-012-0584-9 · Cited by 15
Travers, N. F. (2014) · Stochastic Processes and their Applications · doi:10.1016/j.spa.2014.07.011 · Cited by 15
Polymer dynamics in the depinned phase: metastability with logarithmic barriers
Caputo, P., Lacoin, H., Martinelli, F., Simenhaus, F., & Toninelli, F. L. (2011) · Probability Theory and Related Fields · doi:10.1007/s00440-011-0355-6 · Cited by 15
Online ICA: Understanding Global Dynamics of Nonconvex Optimization via Diffusion ProcessesPreprint
Li, C. J., Wang, Z., & Liu, H. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1808.09642 · Cited by 15
Diffusion Approximations for Online Principal Component Estimation and Global ConvergencePreprint
Li, C. J., Wang, M., Liu, H., & Zhang, T. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1808.09645 · Cited by 15
Minibatch Gibbs Sampling on Large Graphical ModelsPreprint
De, C., Chen, V. S., & Wong, W. H. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1806.06086 · Cited by 15
Temporal Regularization in Markov Decision ProcessPreprint
Thodoroff, P., Durand, A., Pineau, J., & Precup, D. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1811.00429 · Cited by 15
A Distributional Analysis of Sampling-Based Reinforcement Learning AlgorithmsPreprint
Amortila, P., Precup, D., Panangaden, P., & Bellemare, M. G. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2003.12239 · Cited by 15
Bandit Linear ControlPreprint
Cassel, A., & Koren, T. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2007.00759 · Cited by 15
ISOPERIMETRY IN TWO-DIMENSIONAL PERCOLATIONPreprint
Biskup, M., Louidor, O., Procaccia, E. B., & Rosenthal, R. (n.d.) · Cited by 15
Seedless Graph Matching via Tail of Degree Distribution for Correlated Erdos-Renyi GraphsPreprint
Bozorg, M., Salehkaleybar, S., & Hashemi, M. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1907.06334 · Cited by 15
Mixing times for the Swapping Algorithm on the Blume‐Emery‐Griffiths model
Ebbers, M., Knöpfel, H., Löwe, M., & Vermet, F. (2012) · Random Structures and Algorithms · doi:10.1002/rsa.20461 · Cited by 14
Concepts in Monte Carlo sampling
Tartero, G., & Krauth, W. (2023) · American Journal of Physics · doi:10.1119/5.0176853 · Cited by 14
Modified Logarithmic Sobolev Inequalities for CSS Codes
Stengele, S., Capel, Á., Gao, L., Lucia, A., Pérez-García, D., Pérez, A., Rouzé, C., & Warzel, S. (2026) · Communications in Mathematical Physics · doi:10.1007/s00220-026-05654-w · Cited by 14
Mixing time and eigenvalues of the abelian sandpile Markov chain
Jerison, D. C., Levine, L., & Pike, J. (2019) · Transactions of the American Mathematical Society · doi:10.1090/tran/7585 · Cited by 14
Weighted Exponential Random Graph Models: Scope and Large Network Limits
Bhamidi, S., Chakraborty, S., Cranmer, S., & Desmarais, B. (2018) · Journal of Statistical Physics · doi:10.1007/s10955-018-2103-0 · Cited by 14
Franks, J., & Vihola, M. (2020) · Stochastic Processes and their Applications · doi:10.1016/j.spa.2020.05.006 · Cited by 14
The diameter of uniform spanning trees in high dimensions
Michaeli, P., Nachmias, A., & Shalev, M. (2020) · Probability Theory and Related Fields · doi:10.1007/s00440-020-00999-2 · Cited by 14
A humanized version of Foxp2 affects ultrasonic vocalization in adult female and male mice
von Merten, S., Pfeifle, C., Künzel, S., Hoier, S., & Tautz, D. (2021) · Genes Brain & Behavior · doi:10.1111/gbb.12764 · Cited by 14
Deviation bounds and concentration inequalities for quantum noises
Benoist, T., Hänggli, L., & Rouzé, C. (2022) · Quantum · doi:10.22331/q-2022-08-04-772 · Cited by 14
The geometric distribution of Selmer groups of elliptic curves over function fields
Feng, T., Landesman, A., & Rains, E. M. (2022) · Mathematische Annalen · doi:10.1007/s00208-022-02429-1 · Cited by 14
Self-loops in evolutionary graph theory: Friends or foes?
Sharma, N., Yagoobi, S., & Traulsen, A. (2023) · PLoS Computational Biology · doi:10.1371/journal.pcbi.1011387 · Cited by 14
Sharp convergence to equilibrium for the SSEP with reservoirs
Gonçalves, P., Jara, M., Marinho, R., & Menezes, O. (2026) · Annales de l Institut Henri Poincaré Probabilités et Statistiques · doi:10.1214/23-aihp1419 · Cited by 14
Effective resistances for supercritical percolation clusters in boxes
Abe, Y. (2015) · Annales de l Institut Henri Poincaré Probabilités et Statistiques · doi:10.1214/14-aihp604 · Cited by 14
Increasing subsequences of random walks
Angel, O., BALKA, R., & Peres, Y. (2016) · Mathematical Proceedings of the Cambridge Philosophical Society · doi:10.1017/s0305004116000797 · Cited by 14
Self-citationComets, F. M., Falconnet, M., Loukianov, O., & Loukianova, D. (2016) · Stochastic Processes and their Applications · doi:10.1016/j.spa.2016.04.034 · Cited by 14
Simulated Tempering and Swapping on Mean-Field Models
Bhatnagar, N., & Randall, D. (2016) · Journal of Statistical Physics · doi:10.1007/s10955-016-1526-8 · Cited by 14
Random lattice triangulations: structure and algorithms
Caputo, P., Martinelli, F., Sinclair, A., & Stauffer, A. O. (2013) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/2488608.2488685 · Cited by 14
Fast convergence of quantized consensus using Metropolis chains
Başary, T., Etesami, S. R., & Olshevsky, A. (2014) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2014.7039566 · Cited by 14
Mixing time for the Ising model: A uniform lower bound for all graphs
Ding, J., & Peres, Y. (2011) · Annales de l Institut Henri Poincaré Probabilités et Statistiques · doi:10.1214/10-aihp402 · Cited by 14
Self-citationConvergence Theorems of Estimation of Distribution Algorithms
Mühlenbein, H. (2012) · Adaptation, learning, and optimization · doi:10.1007/978-3-642-28900-2_6 · Cited by 14
Transience in growing subgraphs via evolving sets
Dembo, A., Huang, R., Morris, B., & Peres, Y. (2017) · Annales de l Institut Henri Poincaré Probabilités et Statistiques · doi:10.1214/16-aihp751 · Cited by 14
Self-citationNguyen, T. H., & Minh, D. D. L. (2016) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.6b00060 · Cited by 14
Speeding Up Cover Time of Sparse Graphs Using Local Knowledge
Abdullah, M. A., Cooper, C., & Draief, M. (2016) · Lecture notes in computer science · doi:10.1007/978-3-319-29516-9_1 · Cited by 14
Function-Specific Mixing Times and Concentration Away from Equilibrium
Rabinovich, M., Ramdas, A., Jordan, M. I., & Wainwright, M. J. (2019) · Bayesian Analysis · doi:10.1214/19-ba1151 · Cited by 14
Phase Transition for Glauber Dynamics for Independent Sets on Regular Trees
Restrepo, R., Štefankovič, D., Vera, J. C., Vigoda, E., & Yang, L. (2014) · SIAM Journal on Discrete Mathematics · doi:10.1137/120885498 · Cited by 14
The effect of boundary conditions on mixing of 2D Potts models at discontinuous phase transitions
Gheissari, R., & Lubetzky, E. (2018) · Electronic Journal of Probability · doi:10.1214/18-ejp180 · Cited by 14
Corbets, J. B., Willy, C. J., & Bischoff, J. E. (2017) · IEEE Systems Journal · doi:10.1109/jsyst.2017.2647980 · Cited by 14
Time-Dependent Energy and Resource Management in Mobility-Aware D2D-Empowered 5G Systems
Orsino, A., Samuylov, A. K., Moltchanov, D., Andreev, S. D., Militano, L., Araniti, G., & Koucheryavy, Y. A. (2017) · IEEE Wireless Communications · doi:10.1109/mwc.2017.1600393 · Cited by 14
Uniform sampling of bipartite graphs with degrees in prescribed intervals
Rechner, S., Strowick, L., & Müller‐Hannemann, M. (2017) · Journal of Complex Networks · doi:10.1093/comnet/cnx059 · Cited by 14
Mallows Models for Top-k Lists
Chierichetti, F., Dasgupta, A., Haddadan, S., Kumar, R., & Lattanzi, S. (2018) · Zenodo (CERN European Organization for Nuclear Research) · doi:10.5281/zenodo.4697979 · Cited by 14
The Impact of the Transversion/Transition Ratio on the Optimal Genetic Code Graph Partition
Aloqalaa, D. A., Kowalski, D. R., Błażej, P., Wnętrzak, M., Mackiewicz, D., & Mackiewicz, P. (2019) · International Joint Conference on Biomedical Engineering Systems and Technologies (BIOSTEC) · doi:10.5220/0007381000550065 · Cited by 14
On the selection of an optimal outer approximation of a coherent lower probability
Miranda, E., Montes, I., & Vicig, P. (2021) · Fuzzy Sets and Systems · doi:10.1016/j.fss.2021.02.011 · Cited by 14
DConstructor: Efficient and Robust Network Construction with Polylogarithmic Overhead
Gilbert, S. L., Pandurangan, G., Robinson, P., & Trehan, A. (2020) · ACM Symposium on Principles of Distributed Computing (PODC) · doi:10.1145/3382734.3405716 · Cited by 14
Rankings in directed configuration models with heavy tailed in-degrees
Cai, X. S., Caputo, P., Perarnau, G., & Quattropani, M. (2023) · The Annals of Applied Probability · doi:10.1214/23-aap1955 · Cited by 14
The structure of the genetic code as an optimal graph clustering problem
Błażej, P., Kowalski, D. R., Mackiewicz, D., Wnętrzak, M., Aloqalaa, D. A., & Mackiewicz, P. (2022) · Journal of Mathematical Biology · doi:10.1007/s00285-022-01778-4 · Cited by 14
Delay performance in random-access networks
Bouman, N. J., Borst, S. C., & van Leeuwaarden, J. S. H. (2014) · Queueing Systems · doi:10.1007/s11134-014-9408-8 · Cited by 14
Complexity of equilibrium in diffusion games on social networks
Etesami, S. R., & Başar, T. (2014) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.1109/acc.2014.6859194 · Cited by 14
Computing the Stationary Distribution of a Finite Markov Chain Through Stochastic Factorization
Barreto, A. M. S., & Fragoso, M. D. (2011) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/100798776 · Cited by 14
How long does it take for Internal DLA to forget its initial profile?
Levine, L., & Silvestri, V. (2018) · Probability Theory and Related Fields · doi:10.1007/s00440-018-0880-7 · Cited by 14
Polynomial mixing time of edge flips on quadrangulations
Caraceni, A., & Stauffer, A. O. (2019) · Oxford University Research Archive (ORA) (University of Oxford) · doi:10.1007/s00440-019-00913-5 · Cited by 14
Computing cutoff times of birth and death chains
Chen, G., & Saloff‐Coste, L. (2015) · Electronic Journal of Probability · doi:10.1214/ejp.v20-4077 · Cited by 14
Coalescing and branching simple symmetric exclusion process
Hartarsky, I., Martinelli, F., & Toninelli, C. (2022) · The Annals of Applied Probability · doi:10.1214/21-aap1750 · Cited by 14
The Restless Hidden Markov Bandit With Linear Rewards and Side Information
Yemini, M., Leshem, A., & Somekh-Baruch, A. (2021) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2021.3054344 · Cited by 14
Laslier, B., & Toninelli, F. L. (2014) · Probability Theory and Related Fields · doi:10.1007/s00440-014-0553-0 · Cited by 14
Bounds for left and right window cutoffsPreprint
Barrera, J., & Ycart, B. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1310.0726 · Cited by 14
Rapid mixing of Swendsen-Wang and single-bond dynamics in two dimensionsPreprint
Ullrich, M. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1202.6321 · Cited by 14
Analysis of Exact and Approximated Epidemic Models over Complex NetworksPreprint
Azizan, N., Ahn, H. J., & Hassibi, B. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1609.09565 · Cited by 14
Zonotope hit-and-run for efficient sampling from projection DPPsPreprint
Gautier, G., Bardenet, R., & Valko, M. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1705.10498 · Cited by 14
Assume-guarantee strategy synthesis for stochastic games
Wiltsche, C. (2015) · Oxford University Research Archive (ORA) (University of Oxford) · doi:10.5287/ora-bdnrngg8z · Cited by 14
Experimentally Generated Random Numbers Certified by the Impossibility of Superluminal SignalingPreprint
Bierhorst, P., Knill, E. H., Glancy, S., Mink, A., Jordan, S. P., Rommal, A., Liu, Y.-K., Christensen, B., Nam, S. W., & Shalm, L. K. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1702.05178 · Cited by 14
Coupling Lemma and Its Application to The Security Analysis of Quantum Key DistributionPreprint
Kato, K. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1505.06269 · Cited by 14
Stochastic Minority on GraphsPreprint
Regnault, D., Rouquier, J., & Thierry, É. (2008) · HAL · Cited by 14
Fast Multi-Agent Temporal-Difference Learning via Homotopy Stochastic Primal-Dual OptimizationPreprint
Ding, D., Wei, X., Yang, Z., Wang, Z., & Jovanović, M. R. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1908.02805 · Cited by 14
Logistic-Regression with peer-group effects via inference in higher order Ising modelsPreprint
Daskalakis, C., Dikkala, N., & Panageas, I. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2003.08259 · Cited by 14
Structured Logconcave Sampling with a Restricted Gaussian OraclePreprint
Lee, Y. T., Shen, R., & Tian, K. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2010.03106 · Cited by 14
Higher-Order ExpectationsPreprint
Golub, B., & Morris, S. E. (2017) · SSRN Electronic Journal · doi:10.2139/ssrn.2979089 · Cited by 14
Metastability of Stochastic Ising and Potts Models on Lattices without External FieldsPreprint
Kim, S., & Seo, I. (2021) · arXiv (Cornell University) · Cited by 14
Towards self-correcting quantum codes for neutral atom arrays
Guo, J.-K., Hong, Y., Kaufman, A., & Lucas, A. (2025) · PRX Quantum · doi:10.1103/mfmt-fwkg · Cited by 8
Anomaly to resource: The Mpemba effect in quantum thermometry
Chattopadhyay, P., Santos, J. F. G., & Misra, A. (2026) · Physical Review Letters · doi:10.1103/z3ps-zdfy · Cited by 13
Ouzienko, V., Guo, Y., & Obradovic, Z. (2011) · Statistical Analysis and Data Mining The ASA Data Science Journal · doi:10.1002/sam.10130 · Cited by 13
The moving particle lemma for the exclusion process on a weighted graph
Chen, J. P. (2017) · Electronic Communications in Probability · doi:10.1214/17-ecp82 · Cited by 13
Mixing time of vertex-weighted exponential random graphs
DeMuse, R., Easlick, T., & Yin, M. (2018) · Journal of Computational and Applied Mathematics · doi:10.1016/j.cam.2018.07.038 · Cited by 13
Non-equilibrium fluctuations for the SSEP with a slow bond
Erhard, D., Franco, T., Gonçalves, P., Neumann, A., & Tavares, M. (2020) · Annales de l Institut Henri Poincaré Probabilités et Statistiques · doi:10.1214/19-aihp995 · Cited by 13
Cutoff for the Swendsen–Wang dynamics on the lattice
Nam, D., & Sly, A. (2019) · The Annals of Probability · doi:10.1214/19-aop1344 · Cited by 13
Metadata
- Authors
- Levin, D., Peres, Y., & Wilmer, E.
- Affiliations
- University of Oregon (US)
- Microsoft (United States) (US)
- Oberlin College (US)
- Venue
- American Mathematical Society eBooks
- Publisher
- American Mathematical Society
- Published
- 2008-12-09
- OpenAlex
- W1600293573
- Cited by
- 2,241
- References
- 0
- Citations by year
- 2026: 24 · 2025: 64 · 2024: 51 · 2023: 57 · 2022: 95 · 2021: 130 · 2020: 156 · 2019: 197 · 2018: 191 · 2017: 201 · 2016: 202 · 2015: 188 · 2014: 197 · 2013: 148 · 2012: 137
- FWCI
- 22.68
- Type
- book
- Language
- en
- Open access
- closed
- Locations
- American Mathematical Society eBooks (publishedVersion)
- International Linear Collider (submittedVersion)
- CERN Document Server (European Organization for Nuclear Research) (submittedVersion)
- Topics
- Physical Sciences › Mathematics › Statistics and Probability › Markov Chains and Monte Carlo Methods
- Physical Sciences › Mathematics › Mathematical Physics › Stochastic processes and statistical mechanics
- Physical Sciences › Mathematics › Statistics and Probability › Probability and Statistical Research
- Keywords
- Markov chains, mixing time, coupling, spectral methods, random walks on graphs, electrical networks, first passage time, cover time, exclusion processes, Markov chain Monte Carlo, card shuffling, Ising model, random walks on lattices, random walks on groups
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.