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 701–800 of 1,000
Diameter and Stationary Distribution of Random $r$-Out Digraphs
Addario‐Berry, L., Balle, B., & Perarnau, G. (2020) · The Electronic Journal of Combinatorics · doi:10.37236/9485 · Cited by 21
Andreychenko, A., Bortolussi, L., Grima, R., Thomas, P., & Wolf, V. (2017) · Contributions in mathematical and computational sciences · doi:10.1007/978-3-319-45833-5_2 · Cited by 21
PageRank in Undirected Random Graphs
Avrachenkov, K. E., Kadavankandy, A., Prokhorenkova, L. O., & Raigorodskii, A. M. (2015) · Lecture notes in computer science · doi:10.1007/978-3-319-26784-5_12 · Cited by 21
Speed Exponents of Random Walks on Groups
Amir, G., & Virág, B. (2016) · International Mathematics Research Notices · doi:10.1093/imrn/rnv378 · Cited by 21
Scaling limit of the odometer in divisible sandpiles
Cipriani, A., Hazra, R. S., & Ruszel, W. M. (2017) · Probability Theory and Related Fields · doi:10.1007/s00440-017-0821-x · Cited by 21
Towards Strong Reverse Minkowski-Type Inequalities for Lattices
Dadush, D., & Regev, O. (2016) · Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2016.55 · Cited by 21
Accelerated Distributed Dual Averaging Over Evolving Networks of Growing Connectivity
Liu, S., Chen, P., & Hero, A. O. (2018) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2018.2793878 · Cited by 21
Ensuring Rapid Mixing and Low Bias for Asynchronous Gibbs Sampling
De, C., Olukotun, K., & Ré, C. (2017) · International Joint Conference on Artificial Intelligence · doi:10.24963/ijcai.2017/672 · Cited by 21
Spatial Mixing and Non-local Markov chains
Blanca, A., Caputo, P., Sinclair, A., & Vigoda, E. (2018) · Random Structures and Algorithms · doi:10.1002/rsa.20844 · Cited by 21
Irreversible Markov chains in spin models: Topological excitations
Lei, Z., & Krauth, W. (2018) · Europhysics Letters (EPL) · doi:10.1209/0295-5075/121/10008 · Cited by 21
The 2d-directed spanning forest converges to the Brownian web
Coupier, D., Saha, K., Sarkar, A., & Tran, V. C. (2021) · The Annals of Probability · doi:10.1214/20-aop1478 · Cited by 21
The interchange process on high-dimensional products
Hermon, J., & Salez, J. (2021) · The Annals of Applied Probability · doi:10.1214/20-aap1583 · Cited by 21
An Intrinsically-Motivated Approach for Learning Highly Exploring and Fast Mixing Policies
Mutti, M., & Restelli, M. (2020) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v34i04.5968 · Cited by 21
Complex Networks and Social Networks
Bonato, A., & Tian, Y. (2012) · Mathematics in industry · doi:10.1007/978-3-642-30904-5_12 · Cited by 21
The Mathematics of Mixing Things Up
Diaconis, P. W. (2011) · Journal of Statistical Physics · doi:10.1007/s10955-011-0284-x · Cited by 21
A sharp estimate for cover times on binary trees
Ding, J., & Zeitouni, O. (2012) · Stochastic Processes and their Applications · doi:10.1016/j.spa.2012.03.008 · Cited by 21
Explicit Growth and Expansion for SL2
Kowalski, E. (2012) · International Mathematics Research Notices · doi:10.1093/imrn/rns214 · Cited by 21
Isoperimetry in Two‐Dimensional Percolation
Biskup, M., Louidor, O., Procaccia, E. B., & Rosenthal, R. (2014) · Communications on Pure and Applied Mathematics · doi:10.1002/cpa.21558 · Cited by 21
Sensitivity of Mixing Times in Eulerian Digraphs
Boczkowski, L., Peres, Y., & Sousi, P. (2018) · SIAM Journal on Discrete Mathematics · doi:10.1137/16m1073376 · Cited by 21
Self-citationMixing of the Exclusion Process with Small Bias
Levin, D. A., & Peres, Y. (2016) · Journal of Statistical Physics · doi:10.1007/s10955-016-1664-z · Cited by 21
Self-citationMixing Times and Structural Inference for Bernoulli Autoregressive Processes
Katselis, D., Beck, C. L., & Srikant, R. (2018) · IEEE Transactions on Network Science and Engineering · doi:10.1109/tnse.2018.2829520 · Cited by 21
Mixing and perfect sampling in one-dimensional particle systems
Lei, Z., & Krauth, W. (2018) · Europhysics Letters (EPL) · doi:10.1209/0295-5075/124/20003 · Cited by 21
Mixing time of PageRank surfers on sparse random digraphs
Caputo, P., & Quattropani, M. (2021) · Random Structures and Algorithms · doi:10.1002/rsa.21009 · Cited by 21
Ling, S., & Strohmer, T. (2019) · Foundations of Computational Mathematics · doi:10.1007/s10208-019-09421-3 · Cited by 21
Novel Technique for Robust Optimal Algorithmic Cooling
Raeisi, S., Kieferová, M., & Mosca, M. (2019) · Physical Review Letters · doi:10.1103/physrevlett.122.220501 · Cited by 21
Multithreaded event-chain Monte Carlo with local times
Li, B., Todo, S., Maggs, A. C., & Krauth, W. (2020) · Computer Physics Communications · doi:10.1016/j.cpc.2020.107702 · Cited by 21
On Convergence and Threshold Properties of Discrete Lotka-Volterra Population Protocols
Czyzowicz, J., Gąsieniec, L. A., Kosowski, A., Kranakis, E., Spirakis, P. G., & Uznański, P. (2015) · Lecture notes in computer science · doi:10.1007/978-3-662-47672-7_32 · Cited by 21
Quantum mixing of Markov chains for special distributions
Dunjko, V., & Briegel, H. J. (2015) · New Journal of Physics · doi:10.1088/1367-2630/17/7/073004 · Cited by 21
Directed Nonabelian Sandpile Models on Trees
Ayyer, A., Schilling, A., Steinberg, B., & Thiéry, N. M. (2015) · Communications in Mathematical Physics · doi:10.1007/s00220-015-2343-7 · Cited by 21
Spectrum of large random reversible Markov chains: two examplesPreprint
Bordenave, C., Caputo, P., & Chafaï, D. (2008) · arXiv (Cornell University) · doi:10.48550/arxiv.0811.1097 · Cited by 21
Low Rank Approximation with Entrywise $\ell_1$-Norm ErrorPreprint
Song, Z., Woodruff, D. P., & Zhong, P. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1611.00898 · Cited by 21
A gibbs sampler on the n-simplexPreprint
Smith, A. D. (n.d.) · Cited by 21
Imitation Learning by Reinforcement LearningPreprint
Ciosek, K. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2108.04763 · Cited by 21
Zhuang, Z., Du, H., Han, H., Li, Y., Fu, J., Jose, J. M., & Ni, Y. (2025) · International World Wide Web Conference (WWW) · doi:10.1145/3696410.3714852 · Cited by 20
Dimers on Riemann surfaces, II: Conformal invariance and scaling limit
Berestycki, N., Laslier, B., & Ray, G. (2024) · Probability and Mathematical Physics · doi:10.2140/pmp.2024.5.961 · Cited by 20
Distance-based resource quantification for sets of quantum measurements
Tendick, L., Kliesch, M., Kampermann, H., & Bruß, D. (2023) · Quantum · doi:10.22331/q-2023-05-15-1003 · Cited by 20
Zhao, R., Zhang, Y., Wen, W., Zhang, X., Cao, X., & Xiang, Y. (2024) · IEEE Transactions on Big Data · doi:10.1109/tbdata.2024.3375155 · Cited by 20
A Quantitative Probabilistic Relational Hoare Logic
Avanzini, M., Barthe, G., Davoli, D., & Grégoire, B. (2025) · Proceedings of the ACM on Programming Languages · doi:10.1145/3704876 · Cited by 20
Majority Rules with Random Tie-Breaking in Boolean Gene Regulatory Networks
Chaouiya, C., Ourrad, O., & Lima, R. (2013) · PLoS ONE · doi:10.1371/journal.pone.0069626 · Cited by 20
Primitive tensors and directed hypergraphs
Cui, L., Li, W., & Ng, M. K. (2015) · Linear Algebra and its Applications · doi:10.1016/j.laa.2014.12.033 · Cited by 20
Convergence Time of Quantized Metropolis Consensus Over Time-Varying Networks
Başar, T., Etesami, S. R., & Olshevsky, A. (2016) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2016.2539547 · Cited by 20
Random walk hitting times and effective resistance in sparsely connected Erdős‐Rényi random graphs
Sylvester, J. (2020) · Journal of Graph Theory · doi:10.1002/jgt.22551 · Cited by 20
An efficient curing policy for epidemics on graphs
Drakopoulos, K., Ozdaglar, A., & Tsitsiklis, J. N. (2014) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2014.7040083 · Cited by 20
Deterministic graph exploration for efficient graph sampling
Salamanos, N., Voudigari, E., & Yannakoudakis, E. J. (2017) · Social Network Analysis and Mining · doi:10.1007/s13278-017-0441-6 · Cited by 20
Estimating graph parameters with random walks
Ben-Hamou, A., Oliveira, R. I., & Peres, Y. (2019) · Mathematical Statistics and Learning · doi:10.4171/msl/9 · Cited by 20
Self-citationClustering in Block Markov Chains
Sanders, J., Proutière, A., & Yun, S.-Y. (2020) · The Annals of Statistics · doi:10.1214/19-aos1939 · Cited by 20
Random Walks on Randomly Evolving Graphs
Cai, L., Sauerwald, T., & Zanetti, L. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-54921-3_7 · Cited by 20
Distributed Optimization, Averaging via ADMM, and Network Topology
França, G., & Bento, J. (2020) · Proceedings of the IEEE · doi:10.1109/jproc.2020.3022687 · Cited by 20
Zeng, S., Doan, T. T., & Romberg, J. (2022) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc51059.2022.9992837 · Cited by 20
An improved energy argument for the Hegselmann–Krause model
Martinsson, A. (2015) · The Journal of Difference Equations and Applications · doi:10.1080/10236198.2015.1115486 · Cited by 20
Detection and localization of targeted attacks on fully distributed power system state estimation
Vuković, O., & Dán, G. (2013) · IEEE International Conference on Smart Grid Communications (SmartGridComm) · doi:10.1109/smartgridcomm.2013.6687989 · Cited by 20
Sampling Online Social Networks Using Coupling from the Past
White, K., Li, G., & Japkowicz, N. (2012) · IEEE ... International Conference on Data Mining workshops · doi:10.1109/icdmw.2012.126 · Cited by 20
Dettenbach, M., & Thonemann, U. W. (2014) · European Journal of Operational Research · doi:10.1016/j.ejor.2014.06.028 · Cited by 20
The Worm Process for the Ising Model is Rapidly Mixing
Collevecchio, A., Garoni, T. M., Hyndman, T., & Tokarev, D. (2016) · Journal of Statistical Physics · doi:10.1007/s10955-016-1572-2 · Cited by 20
Simulation of quantum walks and fast mixing with classical processes
Apers, S., Sarlette, A., & Ticozzi, F. (2018) · Physical Review A · doi:10.1103/physreva.98.032115 · Cited by 20
On the notion of effective impedance
Muranova, A. (2020) · Operators and Matrices · doi:10.7153/oam-2020-14-46 · Cited by 20
Mixing time and local exponential ergodicity of the East-like process in ℤ d
Chleboun, P., Faggionato, A., & Martinelli, F. (2015) · Annales de la faculté des sciences de Toulouse Mathématiques · doi:10.5802/afst.1461 · Cited by 20
Universality for critical KCM: Finite number of stable directions
Hartarsky, I., Martinelli, F., & Toninelli, C. (2021) · The Annals of Probability · doi:10.1214/20-aop1500 · Cited by 20
Quantum annealing – foundations and frontiers
Cohen, E., & Tamir, B. (2015) · The European Physical Journal Special Topics · doi:10.1140/epjst/e2015-02345-1 · Cited by 20
The L2 -cutoff for reversible Markov processes
Chen, G., & Saloff‐Coste, L. (2009) · Journal of Functional Analysis · doi:10.1016/j.jfa.2009.10.017 · Cited by 20
Mixing time of near-critical random graphs
Ding, J., Lubetzky, E., & Peres, Y. (2012) · The Annals of Probability · doi:10.1214/11-aop647 · Cited by 20
Self-citationStationary and Transition Probabilities in Slow Mixing, Long Memory Markov Processes
Asadi, M., Torghabeh, R. P., & Santhanam, N. (2014) · IEEE Transactions on Information Theory · doi:10.1109/tit.2014.2334594 · Cited by 20
On sensitivity of mixing times and cutoff
Hermon, J., & Peres, Y. (2018) · Electronic Journal of Probability · doi:10.1214/18-ejp154 · Cited by 20
Self-citationDistributed Symmetry Breaking in Sampling (Optimal Distributed Randomly Coloring with Fewer Colors)Preprint
Feng, W., Hayes, T. P., & Yin, Y. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1802.06953 · Cited by 20
Community recovery in non-binary and temporal stochastic block modelsPreprint
Avrachenkov, K. E., Dreveton, M., & Leskelä, L. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2008.04790 · Cited by 20
Rowmotion and generalized toggle groups
Striker, J. (2018) · Discrete Mathematics & Theoretical Computer Science · doi:10.23638/dmtcs-20-1-17 · Cited by 19
Energy Aware Network Formation in Peer-to-Peer Wireless Power Transfer
Madhja, A., Nikoletseas, S., Raptopoulos, C., & Tsolovos, D. (2016) · ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems (MSWiM) · doi:10.1145/2988287.2989166 · Cited by 19
Parallel and I/O-efficient Randomisation of Massive Networks using Global Curveball Trades
Carstens, C. J., Hamann, M., Meyer, U., Penschuck, M., Tran, H., & Wagner, D. (2018) · Leibniz international proceedings in informatics · doi:10.4230/lipics.esa.2018.11 · Cited by 19
Anomalous hydrodynamics with triangular point group in 2+1 dimensions
Qi, M., Guo, J., & Lucas, A. (2023) · Physical review. B./Physical review. B · doi:10.1103/physrevb.107.144305 · Cited by 19
Extinction times in the subcritical stochastic SIS logistic epidemic
Brightwell, G., House, T., & Luczak, M. (2018) · Journal of Mathematical Biology · doi:10.1007/s00285-018-1210-5 · Cited by 19
Equilibrium and Non-equilibrium Ising Models by Means of PCA
Lancia, C., & Scoppola, B. (2013) · Journal of Statistical Physics · doi:10.1007/s10955-013-0847-0 · Cited by 19
Convergence time for unbiased quantized consensus
Etesami, S. R., & Başar, T. (2013) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2013.6760867 · Cited by 19
A lower bound on the performance of dynamic curing policies for epidemics on graphs
Drakopoulos, K., Ozdaglar, A., & Tsitsiklis, J. N. (2015) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2015.7402770 · Cited by 19
Betz, V., & Roux, S. L. (2016) · Stochastic Processes and their Applications · doi:10.1016/j.spa.2016.05.003 · Cited by 19
Self-stabilizing Balls & Bins in Batches: The Power of Leaky Bins [Extended Abstract]
Berenbrink, P., Friedetzky, T., Kling, P., Mallmann-Trenn, F., Nagel, L., & Wastell, C. (2016) · ACM Symposium on Principles of Distributed Computing (PODC) · doi:10.1145/2933057.2933092 · Cited by 19
Decentralized Consensus Optimization and Resource Allocation
Nedić, A., Olshevsky, A., & Shi, W. (2018) · Lecture notes in mathematics · doi:10.1007/978-3-319-97478-1_10 · Cited by 19
Cut-off phenomenon for Ornstein-Uhlenbeck processes driven by Lévy processes
Barrera, G., & Pardo, J. C. (2020) · Electronic Journal of Probability · doi:10.1214/20-ejp417 · Cited by 19
Probabilistic Contraction Analysis of Iterated Random Operators
Gupta, A., Jain, R., & Glynn, P. W. (2024) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2024.3362686 · Cited by 19
Markov-binary visibility graph: A new method for analyzing complex systems
Ahadpour, S., Sadra, Y., & ArastehFard, Z. (2014) · Information Sciences · doi:10.1016/j.ins.2014.03.007 · Cited by 19
Random walks on tori and normal numbers in self-similar sets
Dayan, Y., Ganguly, A., & Weiss, B. (2024) · American Journal of Mathematics · doi:10.1353/ajm.2024.a923240 · Cited by 19
Convergence to Equilibrium of Logit Dynamics for Strategic Games
Auletta, V., Ferraioli, D., Pasquale, F., Penna, P., & Persiano, G. (2015) · Algorithmica · doi:10.1007/s00453-015-0025-7 · Cited by 19
Fast Low-Cost Estimation of Network Properties Using Random Walks
Cooper, C., Radzik, T., & Siantos, Y. (2016) · Internet Mathematics · doi:10.1080/15427951.2016.1164100 · Cited by 19
Excursions of excited random walks on integers
Kosygina, E., & Zerner, M. (2014) · Electronic Journal of Probability · doi:10.1214/ejp.v19-2940 · Cited by 19
Are Lock-Free Concurrent Algorithms Practically Wait-Free?
Alistarh, D., Censor-Hillel, K., & Shavit, N. (2016) · Journal of the ACM · doi:10.1145/2903136 · Cited by 19
A random walk with catastrophes
Ben-Ari, I., Roitershtein, A., & Schinazi, R. B. (2019) · Electronic Journal of Probability · doi:10.1214/19-ejp282 · Cited by 19
Front evolution of the Fredrickson-Andersen one spin facilitated model
Blondel, O., Deshayes, A., & Toninelli, C. (2019) · Electronic Journal of Probability · doi:10.1214/18-ejp246 · Cited by 19
Wang, Z., Huang, Y., & Lyu, S. (2019) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2019.2929922 · Cited by 19
Zhou, L., Yu, N., Ying, S., & Ying, M. (2022) · Journal of Mathematical Physics · doi:10.1063/5.0068344 · Cited by 19
Using markov-chain mixing time estimates for the analysis of ant colony optimization
Sudholt, D. (2011) · Foundations of Genetic Algorithms · doi:10.1145/1967654.1967667 · Cited by 19
Unlacing hypercube percolation: a survey
van der Hofstad, R., & Nachmias, A. (2013) · Metrika · doi:10.1007/s00184-013-0473-5 · Cited by 19
Limits of discrete distributions and Gibbs measures on random graphs
Coja‐Oghlan, A., Perkins, W., & Skubch, K. (2017) · European Journal of Combinatorics · doi:10.1016/j.ejc.2017.06.012 · Cited by 19
Barak–Erdős graphs and the infinite-bin model
Mallein, B., & Ramassamy, S. (2021) · Annales de l Institut Henri Poincaré Probabilités et Statistiques · doi:10.1214/20-aihp1141 · Cited by 19
Boltzmann machines and energy-based modelsPreprint
Osogami, T. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1708.06008 · Cited by 19
Quasi-optimal Sampling from Gibbs States via Non-commutative Optimal Transport Metrics
Capel, Á., Gondolf, P., Kochanowski, J., & Rouzé, C. (2025) · Annales Henri Poincaré · doi:10.1007/s00023-025-01637-0 · Cited by 18
Barrera, G., Högele, M. A., & Pardo, J. C. (2021) · Journal of Statistical Physics · doi:10.1007/s10955-021-02815-0 · Cited by 18
StoqMA vs. MA: the power of error reduction
Aharonov, D., Grilo, A. B., & Liu, Y. (2025) · Quantum · doi:10.22331/q-2025-09-11-1853 · Cited by 18
Hahn polynomials and the Burnside process
Diaconis, P. W., & Zhong, C. (2021) · The Ramanujan Journal · doi:10.1007/s11139-021-00482-z · Cited by 18
Universality of trap models in the ergodic time scale
Jara, M., Landim, C., & Teixeira, A. (2014) · The Annals of Probability · doi:10.1214/13-aop886 · Cited by 18
Entropy decay for interacting systems via the Bochner-Bakry-Émery approach
Pra, P. D., & Posta, G. (2013) · Electronic Journal of Probability · doi:10.1214/ejp.v18-2041 · Cited by 18
Slightly subcritical hypercube percolation
Hulshof, T., & Nachmias, A. (2019) · Random Structures and Algorithms · doi:10.1002/rsa.20853 · Cited by 18
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.