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 501–600 of 1,000
Extreme Quantum Advantage when Simulating Classical Systems with Long-Range Interaction
Aghamohammadi, C., Mahoney, J. R., & Crutchfield, J. P. (2017) · Scientific Reports · doi:10.1038/s41598-017-04928-7 · Cited by 30
Unified theory for finite Markov chains
Rhodes, J., & Schilling, A. (2019) · Advances in Mathematics · doi:10.1016/j.aim.2019.03.004 · Cited by 30
Emergent entropy production and hydrodynamics in quantum many-body systems
Banks, T., & Lucas, A. (2019) · Physical review. E · doi:10.1103/physreve.99.022105 · Cited by 30
A Probabilistic Mechanism for Quark Confinement
Chatterjee, S. (2021) · Communications in Mathematical Physics · doi:10.1007/s00220-021-04086-y · Cited by 30
External validation of Machine Learning models for COVID-19 detection based on Complete Blood Count
Campagner, A., Carobene, A., & Cabitza, F. (2021) · Health Information Science and Systems · doi:10.1007/s13755-021-00167-3 · Cited by 30
Towards a dynamical understanding of microstate analysis of M/EEG data
Jajcay, N., & Hlinka, J. (2023) · NeuroImage · doi:10.1016/j.neuroimage.2023.120371 · Cited by 30
On large‐girth regular graphs and random processes on trees
Backhausz, Á., & Szegedy, B. (2018) · Random Structures and Algorithms · doi:10.1002/rsa.20769 · Cited by 30
When the mean is not enough: Calculating fixation time distributions in birth-death processes
Ashcroft, P., Traulsen, A., & Galla, T. (2015) · Physical Review E · doi:10.1103/physreve.92.042154 · Cited by 30
Random lattice triangulations: Structure and algorithms
Caputo, P., Martinelli, F., Sinclair, A., & Stauffer, A. (2015) · The Annals of Applied Probability · doi:10.1214/14-aap1033 · Cited by 30
Zhu, W., & Li, Y. (2010) · Workshop on Bio-inspired Algorithms for Distributed Systems (BADS) · doi:10.1145/1809018.1809021 · Cited by 30
Total variation and separation cutoffs are not equivalent and neither one implies the other
Hermon, J., Lacoin, H., & Peres, Y. (2016) · Electronic Journal of Probability · doi:10.1214/16-ejp4687 · Cited by 30
Self-citationRandom-cluster dynamics in $${{\mathrm{\mathbb {Z}}}}^2$$
Blanca, A., & Sinclair, A. (2016) · Probability Theory and Related Fields · doi:10.1007/s00440-016-0725-1 · Cited by 30
Random walks on Ramanujan complexes and digraphs
Lubetzky, E., Lubotzky, A., & Parzanchevski, O. (2020) · Journal of the European Mathematical Society · doi:10.4171/jems/990 · Cited by 30
Combarro, E. F., de Saracho, J. H., & Díaz, I. (2019) · Information Sciences · doi:10.1016/j.ins.2019.05.079 · Cited by 30
Proactive Customer Service: Operational Benefits and Economic Frictions
Delana, K., Savva, N., & Tezcan, T. (2020) · Manufacturing & Service Operations Management · doi:10.1287/msom.2019.0811 · Cited by 30
Time Scale Separation and Dynamic Heterogeneity in the Low Temperature East Model
Chleboun, P., Faggionato, A., & Martinelli, F. (2014) · Communications in Mathematical Physics · doi:10.1007/s00220-014-1985-1 · Cited by 30
Phase transition for the mixing time of the Glauber dynamics for coloring regular trees
Tetali, P., Vera, J. C., Vigoda, E., & Yang, L. (2012) · The Annals of Applied Probability · doi:10.1214/11-aap833 · Cited by 30
Neumann, F., & Witt, C. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1504.06363 · Cited by 30
RANDOM WALKS ON TORUS AND RANDOM INTERLACEMENTS: MACROSCOPIC COUPLING AND PHASE TRANSITIONPreprint
Teixeira, A. (n.d.) · Cited by 30
Event-chain Monte Carlo with factor fields
Lei, Z., Krauth, W., & Maggs, A. C. (2019) · Physical review. E · doi:10.1103/physreve.99.043301 · Cited by 29
Learning System for Air Combat Decision Inspired by Cognitive Mechanisms of the Brain
Zhou, K., Wei, R., Zhang, Q., & Xu, Z. (2020) · IEEE Access · doi:10.1109/access.2020.2964031 · Cited by 29
Random Walks on Mated-CRT Planar Maps and Liouville Brownian Motion
Berestycki, N., & Gwynne, E. (2022) · Communications in Mathematical Physics · doi:10.1007/s00220-022-04482-y · Cited by 29
Universality of cutoff for graphs with an added random matching
Hermon, J., Sly, A., & Sousi, P. (2022) · The Annals of Probability · doi:10.1214/21-aop1532 · Cited by 29
Energy-Aware Stochastic UAV-Assisted Surveillance
Hosseinalipour, S., Rahmati, A., Eun, D. Y., & Dai, H. (2020) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2020.3044490 · Cited by 29
Mixing times for the TASEP in the maximal current phase
Schmid, D. (2023) · The Annals of Probability · doi:10.1214/22-aop1620 · Cited by 29
Inference in Opinion Dynamics Under Social Pressure
Jadbabaie, A., Makur, A., Mossel, E., & Salhab, R. (2022) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2022.3191791 · Cited by 29
Uniformity of the uncovered set of random walk and cutoff for lamplighter chains
Miller, J., & Peres, Y. (2012) · The Annals of Probability · doi:10.1214/10-aop624 · Cited by 29
Self-citationRandom directed forest and the Brownian web
Roy, R., Saha, K., & Sarkar, A. (2016) · Annales de l Institut Henri Poincaré Probabilités et Statistiques · doi:10.1214/15-aihp672 · Cited by 29
A zero-one law for recurrence and transience of frog processes
Kosygina, E., & Zerner, M. P. W. (2016) · Probability Theory and Related Fields · doi:10.1007/s00440-016-0711-7 · Cited by 29
Clustering and mixing times for segregation models on Z2
Bhakta, P., Miracle, S., & Randall, D. (2014) · Symposium on Discrete Algorithms · doi:10.5555/2634074.2634098 · Cited by 29
A comparison of variational approximations for fast inference in mixed logit models
Depraetere, N., & Vandebroek, M. L. (2016) · Computational Statistics · doi:10.1007/s00180-015-0638-y · Cited by 29
On the Efficiency of Social Recommender Networks
Wong, F. M. F., Liu, Z., & Chiang, M. (2015) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2015.2475616 · Cited by 29
2-Monotone outer approximations of coherent lower probabilities
Montes, I., Miranda, E., & Vicig, P. (2018) · International Journal of Approximate Reasoning · doi:10.1016/j.ijar.2018.07.004 · Cited by 29
Rapid mixing of path integral Monte Carlo for 1D stoquastic Hamiltonians
Crosson, E., & Harrow, A. W. (2021) · Quantum · doi:10.22331/q-2021-02-11-395 · Cited by 29
Nadini, M., Zino, L., Rizzo, A., & Porfiri, M. (2020) · Applied Network Science · doi:10.1007/s41109-020-00299-7 · Cited by 29
Combinatorial Markov chains on linear extensions
Ayyer, A., Klee, S., & Schilling, A. (2014) · eScholarship (California Digital Library) · Cited by 29
Randomly coloring planar graphs with fewer colors than the maximum degree
Hayes, T. P., Vera, J. C., & Vigoda, E. (2007) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/1250790.1250857 · Cited by 29
Clustering Markov Decision Processes For Continual TransferPreprint
Mahmud, M., Hawasly, M., Rosman, B., & Ramamoorthy, S. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1311.3959 · Cited by 29
Anari, N., Jain, V., Koehler, F., Pham, H. T., & Vuong, T.-D. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2111.03247 · Cited by 29
Fast Mixing for Discrete Point ProcessesPreprint
Rebeschini, P., & Karbasi, A. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1506.02194 · Cited by 29
Network partitioning algorithms as cooperative games
Avrachenkov, K. E., Kondratev, A. Y., Mazalov, V. V., & Rubanov, D. (2018) · Computational Social Networks · doi:10.1186/s40649-018-0059-5 · Cited by 28
How to Encipher Messages on a Small Domain Deterministic Encryption and the Thorp Shuffle
Morris, B., Rogaway, P., & Stegers, T. (2009) · Cited by 28
Resistance distances in Cayley graphs on symmetric groups
Vaskouski, M. M., & Zadorozhnyuk, A. O. (2017) · Discrete Applied Mathematics · doi:10.1016/j.dam.2017.04.044 · Cited by 28
Landim, C., Loulakis, M., & Mourragui, M. (2018) · Electronic Journal of Probability · doi:10.1214/18-ejp220 · Cited by 28
Cutoff for the mean-field zero-range process
Merle, M., & Salez, J. (2019) · The Annals of Probability · doi:10.1214/19-aop1336 · Cited by 28
Generalized Off-Policy Actor-Critic
Zhang, S., Böhmer, W., & Whiteson, S. (2019) · Oxford University Research Archive (ORA) (University of Oxford) · doi:10.48550/arxiv.1903.11329 · Cited by 28
Privacy Amplification of Iterative Algorithms via Contraction Coefficients
Asoodeh, S., Díaz, M., & Calmon, F. P. (2020) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit44484.2020.9174133 · Cited by 28
Anari, N., & Dereziński, M. (2020) · Annual Symposium on Foundations of Computer Science · doi:10.1109/focs46700.2020.00126 · Cited by 28
Biased opinion dynamics: when the devil is in the details
Anagnostopoulos, A., Becchetti, L., Cruciani, E., Pasquale, F., & Rizzo, S. (2022) · Information Sciences · doi:10.1016/j.ins.2022.01.072 · Cited by 28
Cycle structure of the interchange process and representation theory
Berestycki, N., & Kozma, G. (2015) · Bulletin de la Société mathématique de France · doi:10.24033/bsmf.2686 · Cited by 28
Random generators of the symmetric group: Diameter, mixing time and spectral gap
Helfgott, H. A., Seress, Á., & Żuk, A. (2014) · Journal of Algebra · doi:10.1016/j.jalgebra.2014.08.033 · Cited by 28
Comparison of Cutoffs Between Lazy Walks and Markovian Semigroups
Chen, G., & Saloff‐Coste, L. (2013) · Journal of Applied Probability · doi:10.1017/s0021900200013723 · Cited by 28
New Classes of Degree Sequences with Fast Mixing Swap Markov Chain Sampling
Erdős, P. L., Miklós, I., & Toroczkai, Z. (2017) · Combinatorics Probability Computing · doi:10.1017/s0963548317000499 · Cited by 28
The Red Queen and King in finite populations
Veller, C., Hayward, L. K., Hilbe, C., & Nowak, M. A. (2017) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1702020114 · Cited by 28
Construction and Stochastic Applications of Measure Spaces in Higher-Order Logic
Hölzl, J. (2013) · Cited by 28
Concentration of Multilinear Functions of the Ising Model with Applications to Network DataPreprint
Daskalakis, C., Dikkala, N., & Kamath, G. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1710.04170 · Cited by 28
Robust Distributed Accelerated Stochastic Gradient Methods for Multi-Agent NetworksPreprint
Fallah, A., Gürbüzbalaban, M., Ozdaglar, A., Şimşekli, U., & Zhu, L. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1910.08701 · Cited by 28
Ensemble Markov Chain Monte Carlo with Teleporting Walkers
Lindsey, M., Weare, J., & Zhang, A. (2022) · SIAM/ASA Journal on Uncertainty Quantification · doi:10.1137/21m1425062 · Cited by 27
Slade, G. (2023) · Mathematical Physics Analysis and Geometry · doi:10.1007/s11040-023-09447-8 · Cited by 27
Cutoff for conjugacy-invariant random walks on the permutation group
Berestycki, N., & Şengül, B. (2018) · Probability Theory and Related Fields · doi:10.1007/s00440-018-0844-y · Cited by 27
Mixing time and temporal starvation of general CSMA networks with multiple frequency agility
Lam, K.-K., Chau, C.-K., Chen, M., & Liew, S.-C. (2012) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2012.6284005 · Cited by 27
On hitting times for a simple random walk on dense Erdös–Rényi random graphs
Löwe, M., & Torres, F. (2014) · Statistics & Probability Letters · doi:10.1016/j.spl.2014.02.017 · Cited by 27
On the mixing time of the SIS Markov chain model for epidemic spread
Ahn, H. J., & Hassibi, B. (2014) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2014.7040364 · Cited by 27
Mixing of the upper triangular matrix walk
Peres, Y., & Sly, A. (2012) · Probability Theory and Related Fields · doi:10.1007/s00440-012-0436-1 · Cited by 27
Self-citationDIAGONAL-UNITARY 2-DESIGN AND THEIR IMPLEMENTATIONS BY QUANTUM CIRCUITS
NAKATA, Y., & Murao, M. (2013) · International Journal of Quantum Information · doi:10.1142/s0219749913500627 · Cited by 27
Correlations in the multispecies TASEP and a conjecture by Lam
Ayyer, A., & Linusson, S. (2015) · Transactions of the American Mathematical Society · doi:10.1090/tran/6806 · Cited by 27
Estimation of entropy rate and Rényi entropy rate for Markov chains
Kamath, S., & Verdú, S. (2016) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2016.7541386 · Cited by 27
A Markovian model of evolving world input-output network
Moosavi, V., & Isacchini, G. (2017) · PLoS ONE · doi:10.1371/journal.pone.0186746 · Cited by 27
The exclusion process mixes (almost) faster than independent particles
Hermon, J., & Pymar, R. (2020) · The Annals of Probability · doi:10.1214/20-aop1455 · Cited by 27
Alon, G., & Kozma, G. (2020) · Annales de l Institut Henri Poincaré Probabilités et Statistiques · doi:10.1214/20-aihp1054 · Cited by 27
A Tight Analysis of the Parallel Undecided-State Dynamics with Two Colors
Clementi, A. E. F., Ghaffari, M., Gualà, L., Natale, E., Pasquale, F., & Scornavacca, G. (2017) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.3929/ethz-b-000295618 · Cited by 27
Smoothed Analysis on Connected Graphs
Krivelevich, M., Reichman, D., & Samotij, W. (2015) · SIAM Journal on Discrete Mathematics · doi:10.1137/151002496 · Cited by 27
Geometric and spectral properties of causal maps
Curien, N., Hutchcroft, T., & Nachmias, A. (2020) · Journal of the European Mathematical Society · doi:10.4171/jems/1001 · Cited by 27
Dynamics for the Mean-field Random-cluster Model
Blanca, A., & Sinclair, A. (2014) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/lipics.approx-random.2015.528 · Cited by 27
Markov Chain Monte Carlo Stimulus Generation for Constrained Random Simulation
Kitchen, N. (2010) · eScholarship (California Digital Library) · Cited by 27
Approximate Temporal Difference Learning is a Gradient Descent for Reversible PoliciesPreprint
Ollivier, Y. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1805.00869 · Cited by 27
A Multistep Lyapunov Approach for Finite-Time Analysis of Biased Stochastic ApproximationPreprint
Wang, G., Li, B., & Giannakis, G. B. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1909.04299 · Cited by 27
Black-box Off-policy Estimation for Infinite-Horizon Reinforcement LearningPreprint
Mousavi, A., Li, L., Liu, Q., & Zhou, D. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2003.11126 · Cited by 27
Perfect Sampling for (Atomic) Lovász Local LemmaPreprint
He, K., Sun, X., & Wu, K. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2107.03932 · Cited by 27
Metastable Dynamics of Chain-of-Thought Reasoning: Provable Benefits of Search, RL and DistillationPreprint
Kim, J., Wu, D. C.-Y., Lee, J. D., & Suzuki, T. (2025) · arXiv (Cornell University) · doi:10.48550/arxiv.2502.01694 · Cited by 27
Mixing time of the adjacent walk on the simplex
Caputo, P., Labbé, C., & Lacoin, H. (2020) · The Annals of Probability · doi:10.1214/20-aop1428 · Cited by 26
A Universal Empirical Dynamic Programming Algorithm for Continuous State MDPs
Haskell, W. B., Jain, R., Sharma, H., & Yu, P. (2019) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2019.2907414 · Cited by 26
Convex Optimization for Bundle Size Pricing Problem
Li, X., Sun, H., & Teo, C. (2021) · Management Science · doi:10.1287/mnsc.2021.4148 · Cited by 26
Edge Statistics for Lozenge Tilings of Polygons, II: Airy Line Ensemble
Aggarwal, A., & Huang, J. (2025) · Forum of Mathematics Pi · doi:10.1017/fmp.2024.16 · Cited by 26
Random walks on torus and random interlacements: Macroscopic coupling and phase transition
Černý, J., & Teixeira, A. (2016) · The Annals of Applied Probability · doi:10.1214/15-aap1165 · Cited by 26
A Gibbs sampler on the $n$-simplex
Smith, A. (2014) · The Annals of Applied Probability · doi:10.1214/12-aap916 · Cited by 26
An MCMC–MIMO Detector as a Stochastic Linear System Solver Using Successive Overrelexation
Choi, J. (2015) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2015.2490071 · Cited by 26
Local picture and level-set percolation of the Gaussian free field on a large discrete torus
Abächerli, A. (2018) · Stochastic Processes and their Applications · doi:10.1016/j.spa.2018.09.017 · Cited by 26
Consensus of Interacting Particle Systems on Erdös-Rényi Graphs
Schoenebeck, G. R., & Yu, F.-Y. (2018) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611975031.127 · Cited by 26
The Combinatorics of the Longest-Chain Rule: Linear Consistency for Proof-of-Stake Blockchains
Blum, E., Kiayias, A., Moore, C., Quader, S., & Russell, A. C. (2019) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611975994.69 · Cited by 26
Power-Law Graphs Have Minimal Scaling of Kemeny Constant for Random Walks
Xu, W., Sheng, Y., Zhang, Z., Kan, H., & Zhang, Z. (2020) · International World Wide Web Conference (WWW) · doi:10.1145/3366423.3380093 · Cited by 26
Two-Dimensional Random Walk: From Path Counting to Random Interlacements
Popov, S. (2020) · Cambridge University Press eBooks · doi:10.1017/9781108680134 · Cited by 26
A power law of order 1/4 for critical mean field Swendsen-Wang dynamics
Long, Y., Nachmias, A., Ning, W., & Peres, Y. (2014) · Memoirs of the American Mathematical Society · doi:10.1090/memo/1092 · Cited by 26
Self-citationDeterministic Broadcasting and Random Linear Network Coding in Mobile Ad Hoc Networks
Παπανίκος, Ν., & Papapetrou, E. (2017) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2016.2641680 · Cited by 26
Feng, W., Sun, Y., & Yin, Y. (2017) · ACM Symposium on Principles of Distributed Computing (PODC) · doi:10.1145/3087801.3087815 · Cited by 26
Efficient numerical methods to solve sparse linear equations with application to PageRank
Anikin, A. S., Gasnikov, A. V., Gornov, A. Y., Kamzolov, D., Maximov, Y., & Nesterov, Y. E. (2020) · Optimization methods & software · doi:10.1080/10556788.2020.1858297 · Cited by 26
Decomposition of quantum Markov chains and its applications
Guan, J., Feng, Y., & Ying, M. (2018) · Journal of Computer and System Sciences · doi:10.1016/j.jcss.2018.01.005 · Cited by 26
Are populations like a circuit? Comparing isolation by resistance to a new coalescent‐based method
Lundgren, E., & Ralph, P. L. (2019) · Molecular Ecology Resources · doi:10.1111/1755-0998.13035 · Cited by 26
General mixing time bounds for finite Markov chains via the absolute spectral gapPreprint
Jerison, D. C. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1310.8021 · Cited by 26
Ensuring Rapid Mixing and Low Bias for Asynchronous Gibbs SamplingPreprint
De, C., Olukotun, K., & Ré, C. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1602.07415 · Cited by 26
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.