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 201–300 of 1,000
Traffic congestion prediction based on Hidden Markov Models and contrast measure
Zaki, J. F. W., Eldin, A. A., Hussein, S. E., Saraya, S. F., & Areed, F. F. G. (2019) · Ain Shams Engineering Journal · doi:10.1016/j.asej.2019.10.006 · Cited by 58
DeepDive: A Data Management System for Automatic Knowledge Base Construction
Zhang, C., Konda, P., & Mallory, E. K. (2015) · Cited by 58
A Tutorial on the Spectral Theory of Markov Chains
Seabrook, E., & Wiskott, L. (2023) · Neural Computation · doi:10.1162/neco_a_01611 · Cited by 57
How Well Do Random Walks Parallelize?
Efremenko, K., & Reingold, O. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-03685-9_36 · Cited by 57
The Length of the Longest Increasing Subsequence of a Random Mallows Permutation
Mueller, C., & Starr, S. L. (2011) · Journal of Theoretical Probability · doi:10.1007/s10959-011-0364-5 · Cited by 57
Metastability in the reversible inclusion process
Bianchi, A., Dommers, S., & Giardinà, C. (2017) · Electronic Journal of Probability · doi:10.1214/17-ejp98 · Cited by 57
Condensation in Stochastic Particle Systems with Stationary Product Measures
Chleboun, P., & Großkinsky, S. (2013) · Journal of Statistical Physics · doi:10.1007/s10955-013-0844-3 · Cited by 56
MIMO Wiretap Channels With Unknown and Varying Eavesdropper Channel States
He, X., & Yener, A. (2014) · IEEE Transactions on Information Theory · doi:10.1109/tit.2014.2359192 · Cited by 56
On the Geometric Ergodicity of Metropolis-Hastings Algorithms for Lattice Gaussian Sampling
Wang, Z., & Ling, C. (2017) · IEEE Transactions on Information Theory · doi:10.1109/tit.2017.2742509 · Cited by 56
Cutoff for nonbacktracking random walks on sparse random graphs
Ben-Hamou, A., & Salez, J. (2017) · The Annals of Probability · doi:10.1214/16-aop1100 · Cited by 56
Hassibi, B., Hansen, M., Dimakis, A. G., Alshamary, H. A. J., & Xu, W. (2014) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2014.2334558 · Cited by 56
Probability on graphs: random processes on graphs and lattices
(2011) · Choice Reviews Online · doi:10.5860/choice.48-4536 · Cited by 56
Unfolding the multiscale structure of networks with dynamical Ollivier-Ricci curvature
Gosztolai, A., & Arnaudon, A. (2021) · Nature Communications · doi:10.1038/s41467-021-24884-1 · Cited by 55
On eigenvalues of random complexes
Gundert, A., & Wagner, U. (2016) · Israel Journal of Mathematics · doi:10.1007/s11856-016-1419-1 · Cited by 55
Optimal Transmission Policies for Energy Harvesting Devices With Limited State-of-Charge Knowledge
Michelusi, N., Badia, L., & Zorzi, M. (2014) · IEEE Transactions on Communications · doi:10.1109/tcomm.2014.2359009 · Cited by 55
An effectiveness analysis of transfer learning for the concept drift problem in malware detection
García, D. E., DeCastro‐García, N., & Castañeda, Á. L. M. (2022) · Expert Systems with Applications · doi:10.1016/j.eswa.2022.118724 · Cited by 55
Improved mixing condition on the grid for counting and sampling independent sets
Restrepo, R., Shin, J., Tetali, P., Vigoda, E., & Yang, L. (2012) · Probability Theory and Related Fields · doi:10.1007/s00440-012-0421-8 · Cited by 55
Information percolation and cutoff for the stochastic Ising model
Lubetzky, E., & Sly, A. (2015) · Journal of the American Mathematical Society · doi:10.1090/jams/841 · Cited by 54
Eberle, A. (2014) · The Annals of Applied Probability · doi:10.1214/13-aap926 · Cited by 54
Cutoff at the “entropic time” for sparse Markov chains
Bordenave, C., Caputo, P., & Salez, J. (2018) · Probability Theory and Related Fields · doi:10.1007/s00440-018-0834-0 · Cited by 54
From random walk trajectories to random interlacements
Teixeira, A., & Černý, J. (2013) · Ensaios Matemáticos · doi:10.21711/217504322013/em231 · Cited by 54
3 MIXING TIME AND CUTOFF FOR THE ADJACENT TRANSPOSITION SHUFFLE AND THE SIMPLE EXCLUSIONPreprint
Lacoin, H. (2013) · HAL · Cited by 54
Frasca, P., Ishii, H., Ravazzi, C., & Tempo, R. (2015) · European Journal of Control · doi:10.1016/j.ejcon.2015.04.002 · Cited by 53
Wang, Z., & Ling, C. (2019) · IEEE Transactions on Information Theory · doi:10.1109/tit.2019.2901497 · Cited by 53
Threshold Models of Cascades in Large-Scale Networks
Rossi, W. S., Como, G., & Fagnani, F. (2017) · IEEE Transactions on Network Science and Engineering · doi:10.1109/tnse.2017.2777941 · Cited by 53
Cover times, blanket times, and majorizing measures
Ding, J., Lee, J. R., & Peres, Y. (2011) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/1993636.1993646 · Cited by 53
Self-citationA Minimalist Algorithm for Multirobot Continuous Coverage
Cannata, G., & Sgorbissa, A. (2011) · IEEE Transactions on Robotics · doi:10.1109/tro.2011.2104510 · Cited by 53
Limit profile for random transpositions
Teyssier, L. (2020) · The Annals of Probability · doi:10.1214/20-aop1424 · Cited by 52
Mixing time guarantees for unadjusted Hamiltonian Monte Carlo
Bou-Rabee, N. M., & Eberle, A. (2022) · Bernoulli · doi:10.3150/21-bej1450 · Cited by 52
On the Unicity of Smartphone Applications
Achara, J. P., Ács, G., & Castelluccia, C. (2015) · ACM Workshop on Privacy in the Electronic Society (WPES) · doi:10.1145/2808138.2808146 · Cited by 52
Decentralized dynamics for finite opinion games
Ferraioli, D., Goldberg, P. W., & Ventre, C. (2016) · Theoretical Computer Science · doi:10.1016/j.tcs.2016.08.011 · Cited by 52
Acceleration of Convergence to Equilibrium in Markov Chains by Breaking Detailed Balance
Kaiser, M., Jack, R. L., & Zimmer, J. (2017) · Journal of Statistical Physics · doi:10.1007/s10955-017-1805-z · Cited by 52
Modelling future land use scenarios based on farmers’ intentions and a cellular automata approach
Gomes, E., Abrantes, P. C. D. R. M., Banos, A., & Rocha, J. (2019) · Land Use Policy · doi:10.1016/j.landusepol.2019.03.027 · Cited by 52
Average consensus by gossip algorithms with quantized communication
Frasca, P., Carli, R., Fagnani, F., & Zampieri, S. (2008) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2008.4738921 · Cited by 52
Albatross sampling: robust and effective hybrid vertex sampling for social graphs
Jin, L., Chen, Y., Hui, P., Ding, C., Wang, T., Vasilakos, A. V., Deng, B., & Li, X. (2011) · doi:10.1145/2000172.2000178 · Cited by 52
Kovačević, M., Stanojević, I., & Šenk, V. (2015) · Information and Computation · doi:10.1016/j.ic.2015.04.003 · Cited by 51
Asymptotics of cover times via Gaussian free fields: Bounded-degree graphs and general trees
Ding, J. (2014) · The Annals of Probability · doi:10.1214/12-aop822 · Cited by 51
Mean field conditions for coalescing random walks
Oliveira, R. I. (2013) · The Annals of Probability · doi:10.1214/12-aop813 · Cited by 51
On the cycle structure of Mallows permutations
Gladkich, A., & Peled, R. (2018) · The Annals of Probability · doi:10.1214/17-aop1202 · Cited by 51
The Evolution of the Cover Time
Barlow, M. T., Ding, J., Nachmias, A., & Peres, Y. (2011) · Combinatorics Probability Computing · doi:10.1017/s0963548310000489 · Cited by 50
Self-citationData Uncertainty in Markov Chains: Application to Cost-Effectiveness Analyses of Medical Innovations
Goh, J., Bayati, M., Zenios, S. A., Singh, S., & Moore, D. (2018) · Operations Research · doi:10.1287/opre.2017.1685 · Cited by 50
Estimating Clustering Coefficients and Size of Social Networks via Random Walk
Katzir, L., & Hardiman, S. J. (2015) · ACM Transactions on the Web · doi:10.1145/2790304 · Cited by 50
Barlow, M. T., Peres, Y., & Sousi, P. (2012) · Annales de l Institut Henri Poincaré Probabilités et Statistiques · doi:10.1214/12-aihp481 · Cited by 50
Self-citationRandom walk on random planar maps: Spectral dimension, resistance and displacement
Gwynne, E., & Miller, J. (2021) · The Annals of Probability · doi:10.1214/20-aop1471 · Cited by 50
Robust Service Provisioning With Service Function Chain Requirements in Mobile Edge Computing
Li, J., Liang, W., & Ma, Y. (2021) · IEEE Transactions on Network and Service Management · doi:10.1109/tnsm.2021.3062650 · Cited by 50
Hoeffding's inequality for general Markov chains with its applications to statistical learning.
Fan, J., Jiang, B., & Sun, Q. (2021) · PubMed · Cited by 50
The scaling window for a random graph with a given degree sequence
Hatami, H., & Molloy, M. S. O. (2012) · Random Structures and Algorithms · doi:10.1002/rsa.20394 · Cited by 50
Braess's paradox for the spectral gap in random graphs and delocalization of eigenvectors
Eldan, R., Rácz, M. Z., & Schramm, T. (2016) · Random Structures and Algorithms · doi:10.1002/rsa.20696 · Cited by 49
Online Learning in Adversarial Lipschitz Environments
Maillard, O.-A., & Munos, R. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-15883-4_20 · Cited by 49
Spectral Convergence Bounds for Classical and Quantum Markov Processes
Szehr, O., Reeb, D., & Wolf, M. M. (2014) · Communications in Mathematical Physics · doi:10.1007/s00220-014-2188-5 · Cited by 49
Space-time circuit-to-Hamiltonian construction and its applications
Breuckmann, N. P., & Terhal, B. M. (2014) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8113/47/19/195304 · Cited by 49
Mixing times for random k-cycles and coalescence-fragmentation chains
Berestycki, N., Schramm, O., & Zeitouni, O. (2011) · The Annals of Probability · doi:10.1214/10-aop634 · Cited by 49
Two Applications of Random Spanning Forests
Avena, L., & Gaudillière, A. (2017) · Journal of Theoretical Probability · doi:10.1007/s10959-017-0771-3 · Cited by 49
Regret Bounds for Reinforcement Learning via Markov Chain Concentration
Ortner, R. (2020) · Journal of Artificial Intelligence Research · doi:10.1613/jair.1.11316 · Cited by 49
Mixing times and cutoffs in open quadratic fermionic systems
Vernier, E. (2020) · SciPost Physics · doi:10.21468/scipostphys.9.4.049 · Cited by 49
Fastest Local Entanglement Scrambler, Multistage Thermalization, and a Non-Hermitian Phantom
Bensa, J., & Žnidarič, M. (2021) · Physical Review X · doi:10.1103/physrevx.11.031019 · Cited by 49
Regret bounds for restless Markov bandits
Ortner, R., Ryabko, D., Auer, P. L., & Munos, R. (2014) · Theoretical Computer Science · doi:10.1016/j.tcs.2014.09.026 · Cited by 49
Erbar, M., & Fathi, M. (2018) · Journal of Functional Analysis · doi:10.1016/j.jfa.2018.03.011 · Cited by 49
Markov Chain Aggregation for Agent-Based Models
Banisch, S. (2015) · Understanding complex systems · doi:10.1007/978-3-319-24877-6 · Cited by 49
Online to Offline Conversions, Universality and Adaptive Minibatch SizesPreprint
Levy, K. Y. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1705.10499 · Cited by 49
Analysis and limitations of modified circuit-to-Hamiltonian constructions
Bausch, J., & Crosson, E. (2018) · Quantum · doi:10.22331/q-2018-09-19-94 · Cited by 49
Agarwal, A., Patil, P., & Agarwal, S. (2018) · International Conference on Machine Learning · Cited by 48
Bernstein’s inequalities for general Markov chains
Jiang, B., Sun, Q., & Fan, J. (2026) · Annales de l Institut Henri Poincaré Probabilités et Statistiques · doi:10.1214/25-aihp1584 · Cited by 48
Coding Theorems for Noisy Permutation Channels
Makur, A. (2020) · IEEE Transactions on Information Theory · doi:10.1109/tit.2020.3009468 · Cited by 48
Ramírez, H. G., Leclercq, L., Chiabaut, N., Bécarie, C., & Krug, J. (2020) · Travel Behaviour and Society · doi:10.1016/j.tbs.2020.06.011 · Cited by 48
A Constrained Optimization Approach for Calibrated Recommendations
Seymen, S., Abdollahpouri, H., & Malthouse, E. C. (2021) · ACM Conference on Recommender Systems (RecSys) · doi:10.1145/3460231.3478857 · Cited by 48
Dynamics of $(2+1)$-dimensional SOS surfaces above a wall: Slow mixing induced by entropic repulsion
Caputo, P., Lubetzky, E., Martinelli, F., Sly, A., & Toninelli, F. L. (2014) · The Annals of Probability · doi:10.1214/13-aop836 · Cited by 48
A discrete Gauss-Green identity for unbounded Laplace operators, and the transience of random walks
Jørgensen, P. E. T., & Pearse, E. P. J. (2012) · Israel Journal of Mathematics · doi:10.1007/s11856-012-0165-2 · Cited by 48
Markov chains, ${\mathscr R}$-trivial monoids and representation theory
Ayyer, A., Schilling, A., Steinberg, B., & Thiéry, N. M. (2015) · International Journal of Algebra and Computation · doi:10.1142/s0218196715400081 · Cited by 48
Rapidly Mixing Markov Chains: A Comparison of Techniques (A Survey)Preprint
Guruswami, V. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1603.01512 · Cited by 48
Efron–Stein inequalities for random matrices
Paulin, D., Mackey, L. W., & Tropp, J. A. (2016) · The Annals of Probability · doi:10.1214/15-aop1054 · Cited by 47
Adaptive Diffusions for Scalable Learning Over Graphs
Berberidis, D., Νικολακόπουλος, Α. Ν., & Giannakis, G. B. (2019) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2018.2889984 · Cited by 47
A stochastic basis for neural inertia in emergence from general anaesthesia
Proekt, A., & Hudson, A. E. (2018) · British Journal of Anaesthesia · doi:10.1016/j.bja.2018.02.035 · Cited by 47
Abért, M., Glasner, Y., & Virág, B. (2016) · The Annals of Probability · doi:10.1214/14-aop937 · Cited by 47
Diniz, I., & Jonathan, D. (2011) · Communications in Mathematical Physics · doi:10.1007/s00220-011-1217-x · Cited by 47
Online Stochastic Optimization under Correlated Bandit FeedbackPreprint
Azar, M. G., Lazaric, A., & Brunskill, E. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1402.0562 · Cited by 47
TribeFlow: Mining & Predicting User Trajectories
Figueiredo, F., Ribeiro, B., Almeida, J. M., & Faloutsos, C. (2016) · International World Wide Web Conference (WWW) · doi:10.1145/2872427.2883059 · Cited by 46
Tree formulas, mean first passage times and Kemeny’s constant of a Markov chain
Pitman, J., & Tang, W. (2018) · Bernoulli · doi:10.3150/16-bej916 · Cited by 46
Chen, Y., Khong, S. Z., & Georgiou, T. T. (2016) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.1109/acc.2016.7525290 · Cited by 46
Resistivity bound for hydrodynamic bad metals
Lucas, A., & Hartnoll, S. A. (2017) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1711414114 · Cited by 46
Concentration inequalities for polynomials of contracting Ising models
Gheissari, R., Lubetzky, E., & Peres, Y. (2018) · Electronic Communications in Probability · doi:10.1214/18-ecp173 · Cited by 46
Self-citationRapid mixing of hypergraph independent sets
Hermon, J., Sly, A., & Zhang, Y. (2018) · Random Structures and Algorithms · doi:10.1002/rsa.20830 · Cited by 46
Mixing and hitting times for finite Markov chains
Oliveira, R. I. (2012) · Electronic Journal of Probability · doi:10.1214/ejp.v17-2274 · Cited by 46
Cops and invisible robbers: The cost of drunkenness
Kehagias, A., Mitsche, D., & Prałat, P. (2013) · Theoretical Computer Science · doi:10.1016/j.tcs.2013.01.032 · Cited by 46
Coordinate Dual Averaging for Decentralized Online Optimization With Nonseparable Global Objectives
Lee, S., Nedić, A., & Raginsky, M. (2016) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2016.2573639 · Cited by 46
The Hitting Time of Multiple Random Walks
Patel, R., Carron, A., & Bullo, F. (2016) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/15m1010737 · Cited by 46
The simple exclusion process on the circle has a diffusive cutoff window
Lacoin, H. (2017) · Annales de l Institut Henri Poincaré Probabilités et Statistiques · doi:10.1214/16-aihp759 · Cited by 45
Robust and ubiquitous smartphone-based lane detection
Aly, H., Basalamah, A. M., & Youssef, M. A. (2015) · Pervasive and Mobile Computing · doi:10.1016/j.pmcj.2015.10.019 · Cited by 45
Large-Scale MIMO Detection Using MCMC Approach With Blockwise Sampling
Bai, L., Li, T., Liu, J., Yu, Q., & Choi, J. (2016) · IEEE Transactions on Communications · doi:10.1109/tcomm.2016.2592521 · Cited by 45
Regression from dependent observations
Daskalakis, C., Dikkala, N., & Panageas, I. (2019) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/3313276.3316362 · Cited by 45
Accurate Learning or Fast Mixing? Dynamic Adaptability of Caching Algorithms
Li, J., Shakkottai, S., Lui, J. C. S., & Subramanian, V. (2018) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2018.2844984 · Cited by 45
Mixing times for the simple exclusion process with open boundaries
Gantert, N., Nestoridi, E., & Schmid, D. (2023) · The Annals of Applied Probability · doi:10.1214/22-aap1839 · Cited by 45
Exponential concentration of cover times
Zhai, A. (2018) · Electronic Journal of Probability · doi:10.1214/18-ejp149 · Cited by 45
Operator theory of electrical resistance networksPreprint
Jørgensen, P. E. T., & Pearse, E. P. J. (2008) · arXiv (Cornell University) · doi:10.48550/arxiv.0806.3881 · Cited by 45
Dynamic matching market design
Akbarpour, M., Li, S., & Gharan, S. O. (2014) · ACM Conference on Economics and Computation (EC) · doi:10.1145/2600057.2602887 · Cited by 45
Random walks on dynamical percolation: mixing times, mean squared displacement and hitting times
Peres, Y., Stauffer, A. O., & Steif, J. E. (2014) · Probability Theory and Related Fields · doi:10.1007/s00440-014-0578-4 · Cited by 44
Self-citationNear-optimal continuous patrolling with teams of mobile information gathering agents
Stranders, R., de Cote, E. M., Rogers, A., & Jennings, N. R. (2012) · Artificial Intelligence · doi:10.1016/j.artint.2012.10.006 · Cited by 44
Energy-Efficient Content-Based Routing in Internet of Things
Chelloug, S. A. (2015) · Journal of Computer and Communications · doi:10.4236/jcc.2015.312002 · Cited by 44
Wireless charging for weighted energy balance in populations of mobile peers
Nikoletseas, S., Raptis, T. P., & Raptopoulos, C. (2017) · Ad Hoc Networks · doi:10.1016/j.adhoc.2017.03.005 · Cited by 44
Reinert, G., & Ross, N. (2019) · The Annals of Applied Probability · doi:10.1214/19-aap1478 · Cited by 44
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.