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 301–400 of 1,000
Universality Results for Kinetically Constrained Spin Models in Two Dimensions
Martinelli, F., Morris, R., & Toninelli, C. (2018) · Communications in Mathematical Physics · doi:10.1007/s00220-018-3280-z · Cited by 44
A Unified Framework of Quantum Walk Search
Apers, S., Gilyén, A., & Jeffery, S. (2019) · Leibniz international proceedings in informatics · doi:10.4230/lipics.stacs.2021.6 · Cited by 44
Rapid mixing of Glauber dynamics via spectral independence for all degrees
Chen, X., Feng, W., Yin, Y., & Zhang, X. (2022) · Annual Symposium on Foundations of Computer Science · doi:10.1109/focs52979.2021.00022 · Cited by 44
Finding the Right Curve: Optimal Design of Constant Function Market Makers
Goyal, M., Ramseyer, G., Goel, A., & Mazières, D. (2023) · ACM Conference on Economics and Computation (EC) · doi:10.1145/3580507.3597688 · Cited by 44
Ganguly, S., Lubetzky, E., & Martinelli, F. (2015) · Communications in Mathematical Physics · doi:10.1007/s00220-015-2316-x · Cited by 44
Entropy, complexity and Markov diagrams for random walk cancer models
Newton, P. K., Mason, J. M., Hurt, B., Bethel, K. J., Bazhenova, L. A., Nieva, J. J., & Kühn, P. (2014) · Scientific Reports · doi:10.1038/srep07558 · Cited by 44
Clark, A., Alomair, B., Bushnell, L. G., & Poovendran, R. (2017) · IEEE Control Systems · doi:10.1109/mcs.2017.2743518 · Cited by 44
Modified log-Sobolev inequalities for strong-Rayleigh measures
Hermon, J., & Salez, J. (2023) · The Annals of Applied Probability · doi:10.1214/22-aap1847 · Cited by 44
Hopf Algebras and Markov ChainsPreprint
Pang, C. Y. A. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1412.8221 · Cited by 44
A Finite-Time Analysis of Q-Learning with Neural Network Function ApproximationPreprint
Xu, P., & Gu, Q. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1912.04511 · Cited by 44
HIT’nDRIVE: Multi-driver Gene Prioritization Based on Hitting Time
Shrestha, R., Hodzic, E., Yeung, J., Wang, K., Sauerwald, T., Dao, P., Anderson, S. A., Beltran, H., Rubin, M. A., Collins, C. C., et al. (2014) · Lecture notes in computer science · doi:10.1007/978-3-319-05269-4_23 · Cited by 43
Opinion fluctuations and persistent disagreement in social networks
Acemoğlu, D., Como, G., Fagnani, F., & Ozdaglar, A. (2011) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2011.6161319 · Cited by 43
Capacity of the range of random walk on $\mathbb {Z}^d$
Asselah, A., Schapira, B., & Sousi, P. (2017) · Transactions of the American Mathematical Society · doi:10.1090/tran/7247 · Cited by 43
Chen, X., Gong, X., Yang, L., & Zhang, J. (2016) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2016.2530070 · Cited by 43
Interactive Wireless Charging for Energy Balance
Nikoletseas, S., Raptis, T. P., & Raptopoulos, C. (2016) · IEEE International Conference on Distributed Computing Systems (ICDCS) · doi:10.1109/icdcs.2016.37 · Cited by 43
A general method for lower bounds on fluctuations of random variables
Chatterjee, S. (2019) · The Annals of Probability · doi:10.1214/18-aop1304 · Cited by 43
Sakellariou, K., Stemler, T., & SMALL, M. P. (2019) · Physical review. E · doi:10.1103/physreve.100.062307 · Cited by 43
Convergence Time for Unbiased Quantized Consensus Over Static and Dynamic Networks
Etesami, S. M., & Başar, T. (2015) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2015.2440568 · Cited by 43
Decentralized online optimization with global objectives and local communication
Nedić, A., Lee, S., & Raginsky, M. (2015) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.1109/acc.2015.7172037 · Cited by 43
Does Hamiltonian Monte Carlo mix faster than a random walk on multimodal densities?
Mangoubi, O., Pillai, N. S., & Smith, A. P. K. (2026) · Advances in Applied Probability · doi:10.1017/apr.2026.10061 · Cited by 43
Learning by Unsupervised Nonlinear DiffusionPreprint
Maggioni, M., & Murphy, J. M. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1810.06702 · Cited by 43
Mixing of Hamiltonian Monte Carlo on strongly log-concave distributions: Continuous dynamics
Mangoubi, O., & Smith, A. D. (2021) · The Annals of Applied Probability · doi:10.1214/20-aap1640 · Cited by 42
Dobrushin’s Ergodicity Coefficient for Markov Operators on Cones
Gaubert, S., & Qu, Z. (2014) · Integral Equations and Operator Theory · doi:10.1007/s00020-014-2193-2 · Cited by 42
Dynamic pricing in discrete time stochastic day-to-day route choice models
Rambha, T., & Boyles, S. D. (2016) · Transportation Research Part B Methodological · doi:10.1016/j.trb.2016.01.008 · Cited by 42
Universality of cutoff for the Ising model
Lubetzky, E., & Sly, A. (2017) · The Annals of Probability · doi:10.1214/16-aop1146 · Cited by 42
On Sampling Edges Almost Uniformly
Eden, T., & Rosenbaum, W. (2017) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/oasics.sosa.2018.7 · Cited by 42
LDA*: a robust and large-scale topic modeling system
Yut, L., Zhang, C., Shao, Y., & Cui, B. (2017) · Proceedings of the VLDB Endowment · doi:10.14778/3137628.3137649 · Cited by 42
Statistical estimation of ergodic Markov chain kernel over discrete state space
Wolfer, G., & Kontorovich, A. (2020) · Bernoulli · doi:10.3150/20-bej1248 · Cited by 42
An inhomogeneous multispecies TASEP on a ring
Ayyer, A., & Linusson, S. (2014) · Advances in Applied Mathematics · doi:10.1016/j.aam.2014.02.001 · Cited by 42
Global and Local Information in Clustering Labeled Block Models
Kanade, V., Mossel, E., & Schramm, T. (2016) · IEEE Transactions on Information Theory · doi:10.1109/tit.2016.2516564 · Cited by 42
Opportunistic forwarding in wireless networks with duty cycling
Basu, P., & Chau, C.-K. (2008) · ACM Workshop on Challenged Networks (CHANTS) · doi:10.1145/1409985.1409991 · Cited by 42
Scan Order in Gibbs Sampling: Models in Which it Matters and Bounds on How Much
He, B. D., De, C., Mitliagkas, I., & Ré, C. (2016) · PubMed · doi:10.48550/arxiv.1606.03432 · Cited by 42
Exponential and double exponential tails for maximum of two-dimensional discrete Gaussian free field
Ding, J. (2012) · Probability Theory and Related Fields · doi:10.1007/s00440-012-0457-9 · Cited by 42
Mixing Times of Critical Two‐Dimensional Potts Models
Gheissari, R., & Lubetzky, E. (2017) · Communications on Pure and Applied Mathematics · doi:10.1002/cpa.21718 · Cited by 42
Error bounds for computing the expectation by Markov chain Monte CarloPreprint
Rudolf, D. (n.d.) · Cited by 42
Some things we’ve learned (about Markov chain Monte Carlo)
Diaconis, P. W. (2013) · Bernoulli · doi:10.3150/12-bejsp09 · Cited by 41
Hitting Time Asymptotics for Hard-Core Interactions on Grids
Nardi, F. R., Zocca, A., & Borst, S. C. (2015) · Journal of Statistical Physics · doi:10.1007/s10955-015-1391-x · Cited by 41
Pooling data across markets in dynamic Markov games
Otsu, T., Pesendorfer, M., & Takahashi, Y. (2016) · Quantitative Economics · doi:10.3982/qe612 · Cited by 41
Distributed Bayesian filtering using logarithmic opinion pool for dynamic sensor networks
Bandyopadhyay, S., & Chung, S. (2018) · Automatica · doi:10.1016/j.automatica.2018.07.013 · Cited by 41
Randomly coloring planar graphs with fewer colors than the maximum degree
Hayes, T. P., Vera, J. C., & Vigoda, E. (2014) · Random Structures and Algorithms · doi:10.1002/rsa.20560 · Cited by 41
Quasi-polynomial mixing of the 2D stochastic Ising model with “plus” boundary up to criticality
Lubetzky, E., Martinelli, F., Sly, A., & Toninelli, F. L. (2013) · Journal of the European Mathematical Society · doi:10.4171/jems/363 · Cited by 41
Pattern Formation by Lateral Inhibition in Large-Scale Networks of Cells
Arcak, M. (2012) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2012.2231571 · Cited by 41
On cover times for 2D lattices
Ding, J. (2012) · Electronic Journal of Probability · doi:10.1214/ejp.v17-2089 · Cited by 41
A critical threshold for design effects in network sampling
Rohe, K. (2018) · The Annals of Statistics · doi:10.1214/18-aos1700 · Cited by 41
Simple dynamics for plurality consensus
Becchetti, L., Clementi, A. E. F., Natale, E., Pasquale, F., Silvestri, R., & Trevisan, L. (2014) · ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) · doi:10.1145/2612669.2612677 · Cited by 40
Distributed computation in dynamic networks via random walks
Sarma, A. D., Molla, A. R., & Pandurangan, G. (2015) · Theoretical Computer Science · doi:10.1016/j.tcs.2015.02.044 · Cited by 40
Cooper, C., & Rivera, N. (2016) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/lipics.icalp.2016.144 · Cited by 40
Divisors and Sandpiles: An Introduction to Chip-Firing
Corry, S., & Perkinson, D. (2018) · International Linear Collider · Cited by 40
Detection Thresholds in Very Sparse Matrix Completion
Bordenave, C., Coste, S., & Nadakuditi, R. R. (2022) · Foundations of Computational Mathematics · doi:10.1007/s10208-022-09568-6 · Cited by 40
Comparison of Contraction Coefficients for f-Divergences
Makur, A., & Zheng, L. (2020) · Problems of Information Transmission · doi:10.1134/s0032946020020015 · Cited by 40
Finite-Time Analysis of Markov Gradient Descent
Doan, T. T. (2022) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2022.3172593 · Cited by 40
SIRS epidemics on complex networks: Concurrence of exact Markov chain and approximated models
Azizan, N., & Hassibi, B. (2015) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2015.7402660 · Cited by 40
Harmonic maps on amenable groups and a diffusive lower bound for random walks
Lee, J. R., & Peres, Y. (2013) · The Annals of Probability · doi:10.1214/12-aop779 · Cited by 40
Self-citationTug-of-War and Infinity Laplace Equation with Vanishing Neumann Boundary Condition
Antunović, T., Peres, Y., Sheffield⋆, S., & Somersille, S. (2012) · Communications in Partial Differential Equations · doi:10.1080/03605302.2011.642450 · Cited by 40
Self-citationMixing Times of Monotone Surfaces and SOS Interfaces: A Mean Curvature Approach
Caputo, P., Martinelli, F., & Toninelli, F. L. (2012) · Communications in Mathematical Physics · doi:10.1007/s00220-012-1425-z · Cited by 40
SmartWalk: Enhancing Social Network Security via Adaptive Random Walks
Liu, Y., Ji, S., & Mittal, P. (2016) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/2976749.2978319 · Cited by 40
The pair-flip model: a very entangled translationally invariant spin chainPreprint
Caha, L., & Nagaj, D. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1805.07168 · Cited by 41
Elishco, O., Meyerovitch, T., & Schwartz, M. (2016) · IEEE Transactions on Information Theory · doi:10.1109/tit.2016.2531722 · Cited by 39
On laplacians of random complexes
Gundert, A., & Wagner, U. (2012) · Annual Symposium on Computational Geometry (SoCG) · doi:10.1145/2261250.2261272 · Cited by 39
Operation policies for Energy Harvesting Devices with imperfect State-of-Charge knowledge
Michelusi, N., Stamatiou, K., Badia, L., & Zorzi, M. (2012) · International Conference on Communications · doi:10.1109/icc.2012.6364958 · Cited by 39
Swendsen‐Wang algorithm on the mean‐field Potts model
Galanis, A., Štefankovič, D., & Vigoda, E. (2018) · Random Structures and Algorithms · doi:10.1002/rsa.20768 · Cited by 39
Why is random testing effective for partition tolerance bugs?
Majumdar, R., & Niksic, F. (2017) · Proceedings of the ACM on Programming Languages · doi:10.1145/3158134 · Cited by 39
Graph curvature via resistance distance
Devriendt, K., Ottolini, A., & Steinerberger, S. (2024) · Discrete Applied Mathematics · doi:10.1016/j.dam.2024.01.012 · Cited by 39
Zeng, S., Doan, T. T., & Romberg, J. (2024) · SIAM Journal on Optimization · doi:10.1137/22m150277x · Cited by 39
Graph-based Sybil detection in social and information systems
Boshmaf, Y., Beznosov, K., & Ripeanu, M. (2013) · IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM) · doi:10.1145/2492517.2492568 · Cited by 39
Analysis of Latency of Stateless Opportunistic Forwarding in Intermittently Connected Networks
Chau, C.-K., & Basu, P. (2011) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2010.2103321 · Cited by 39
Ito, T., & Jeffery, S. (2018) · Algorithmica · doi:10.1007/s00453-018-0527-1 · Cited by 39
Emergence of Giant Cycles and Slowdown Transition in Random Transpositions and $k$-Cycles
Berestycki, N. (2011) · Electronic Journal of Probability · doi:10.1214/ejp.v16-850 · Cited by 39
From local averaging to emergent global behaviors: The fundamental role of network interconnections
Como, G., & Fagnani, F. (2016) · Systems & Control Letters · doi:10.1016/j.sysconle.2016.02.003 · Cited by 39
A Single-Letter Upper Bound on the Feedback Capacity of Unifilar Finite-State Channels
Sabag, O., Permuter, H. H., & Pfister, H. D. (2016) · IEEE Transactions on Information Theory · doi:10.1109/tit.2016.2636851 · Cited by 39
Faster quantum mixing for slowly evolving sequences of Markov chains
Orsucci, D., Briegel, H. J., & Dunjko, V. (2018) · Quantum · doi:10.22331/q-2018-11-09-105 · Cited by 39
The Design Space of Lightweight Cryptography
Mouha, N. (2015) · HAL · Cited by 39
Unifying neighbourhood and distortion models: part II – new models and synthesis
Montes, I., Miranda, E., & Destercke, S. (2020) · International Journal of General Systems · doi:10.1080/03081079.2020.1778683 · Cited by 39
Front progression in the East model
Blondel, O. (2013) · Stochastic Processes and their Applications · doi:10.1016/j.spa.2013.04.014 · Cited by 39
Approximate inference for determinantal point processes
Gillenwater, J. (2014) · ScholarlyCommons (University of Pennsylvania) · Cited by 39
The reproducing Stein kernel approach for post-hoc corrected samplingPreprint
Hodgkinson, L., Salomone, R., & Roosta, F. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2001.09266 · Cited by 39
Two-Dimensional Random Interlacements and Late Points for Random Walks
Comets, F. M., Popov, S., & Vachkovskaia, M. (2015) · Communications in Mathematical Physics · doi:10.1007/s00220-015-2531-5 · Cited by 38
Strategy Synthesis for Stochastic Games with Multiple Long-Run Objectives
Basset, N., Kwiatkowska, M., Topcu, U., & Wiltsche, C. (2015) · Lecture notes in computer science · doi:10.1007/978-3-662-46681-0_22 · Cited by 38
Motion graphs for unstructured textured meshes
Prada, F., Kazhdan, M., Chuang, M., Collet, A., & Hoppe, H. (2016) · ACM Transactions on Graphics · doi:10.1145/2897824.2925967 · Cited by 38
Communication and cooperation in repeated games
Awaya, Y., & Krishna, V. (2019) · Theoretical Economics · doi:10.3982/te3049 · Cited by 38
Cohen–Lenstra Heuristics for Torsion in Homology of Random Complexes
Kahle, M., Lutz, F. H., Newman, A., & Parsons, K. (2018) · Experimental Mathematics · doi:10.1080/10586458.2018.1473821 · Cited by 38
Stein’s method for stationary distributions of Markov chains and application to Ising models
Bresler, G., & Raj, A. (2019) · The Annals of Applied Probability · doi:10.1214/19-aap1479 · Cited by 38
Dynamics of the Box-Ball System with Random Initial Conditions via Pitman’s Transformation
Croydon, D. A., Kato, T., Sasada, M., & Tsujimoto, S. (2023) · Memoirs of the American Mathematical Society · doi:10.1090/memo/1398 · Cited by 38
Trust Region Evolution Strategies
Liu, G., Zhao, L., Yang, F., Bian, J., Qin, T., Yu, N., & Liu, T. (2019) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v33i01.33014352 · Cited by 38
CUTOFF AT THE ENTROPIC TIME FOR RANDOM WALKS ON COVERED EXPANDER GRAPHS
Bordenave, C., & Lacoin, H. (2021) · Journal of the Institute of Mathematics of Jussieu · doi:10.1017/s1474748020000663 · Cited by 38
Mixing of Hamiltonian Monte Carlo on strongly log-concave distributions 2: Numerical integrators
Mangoubi, O., & Smith, A. D. (2019) · Infoscience (Ecole Polytechnique Fédérale de Lausanne) · Cited by 38
COMPLEXITY PROBLEMS IN ENUMERATIVE COMBINATORICS
Pak, I. (2019) · International Congress of Mathematicians (ICM) · doi:10.1142/9789813272880_0176 · Cited by 38
What matters in school choice tie-breaking? How competition guides design
Ashlagi, I., & Nikzad, A. (2020) · Journal of Economic Theory · doi:10.1016/j.jet.2020.105120 · Cited by 38
Near-Optimal Routing Protection for In-Band Software-Defined Heterogeneous Networks
Huang, H., Guo, S., Liang, W., Li, K., Ye, B., & Zhuang, W. (2016) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2016.2615184 · Cited by 38
Approximate Quantum Markov Chains
Sutter, D. (2018) · SpringerBriefs in mathematical physics · doi:10.1007/978-3-319-78732-9_5 · Cited by 38
Guaranteed Energy-Efficient Bit Reset in Finite Time
Browne, C., Garner, A. J. P., Dahlsten, O., & Vedral, V. (2014) · Physical Review Letters · doi:10.1103/physrevlett.113.100603 · Cited by 38
Functions of random walks on hyperplane arrangements
Athanasiadis, C. A., & Diaconis, P. W. (2010) · Advances in Applied Mathematics · doi:10.1016/j.aam.2010.02.001 · Cited by 38
Ricci curvature bounds for weakly interacting Markov chains
Erbar, M., Henderson, C., Menz, G., & Tetali, P. (2017) · Electronic Journal of Probability · doi:10.1214/17-ejp49 · Cited by 38
von Wegner, F., Tagliazucchi, E., Brodbeck, V., & Laufs, H. (2016) · NeuroImage · doi:10.1016/j.neuroimage.2016.07.050 · Cited by 38
Armbruster, D., & Uzsoy, R. (2012) · doi:10.1287/educ.1120.0102 · Cited by 38
Extreme Quantum Memory Advantage for Rare-Event Sampling
Aghamohammadi, C., Loomis, S. P., Mahoney, J. R., & Crutchfield, J. P. (2018) · Physical Review X · doi:10.1103/physrevx.8.011025 · Cited by 38
Metastability of Logit Dynamics for Coordination Games
Auletta, V., Ferraioli, D., Pasquale, F., & Persiano, G. (2012) · ACM-SIAM Symposium on Discrete Algorithms (SODA) · doi:10.1137/1.9781611973099.80 · Cited by 38
Spectral gap of nonreversible Markov chains
Chatterjee, S. (2025) · The Annals of Applied Probability · doi:10.1214/25-aap2183 · Cited by 37
Cutoff for random to random card shuffle
Bernstein, M., & Nestoridi, E. (2019) · The Annals of Probability · doi:10.1214/19-aop1340 · Cited by 37
A Quantum-Inspired Similarity Measure for the Analysis of Complete Weighted Graphs
Bai, L., Rossi, L., Cui, L., Cheng, J., & Hancock, E. R. (2019) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2019.2913038 · Cited by 37
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.