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 601–700 of 1,000
Distributed Estimation From Relative and Absolute Measurements
Rossi, W. S., Frasca, P., & Fagnani, F. (2017) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2017.2661400 · Cited by 25
Reviving the Two-State Markov Chain Approach
Mizera, A., Pang, J., & Yuan, Q. (2017) · IEEE Transactions on Computational Biology and Bioinformatics · doi:10.1109/tcbb.2017.2704592 · Cited by 25
Augmenting Max-Weight With Explicit Learning for Wireless Scheduling With Switching Costs
Krishnasamy, S., Akhil, P. T., Arapostathis, A., Sundaresan, R., & Shakkottai, S. (2018) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2018.2869874 · Cited by 25
Differentially Private Formation Control
Hawkins, C., & Hale, M. (2020) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc42340.2020.9303817 · Cited by 25
Information Geometry of Reversible Markov Chains
Wolfer, G., & Watanabe, S. (2021) · Information Geometry · doi:10.1007/s41884-021-00061-7 · Cited by 25
Gaussian unitary ensemble in random lozenge tilings
Aggarwal, A., & Gorin, V. (2022) · Probability Theory and Related Fields · doi:10.1007/s00440-022-01168-3 · Cited by 25
Greenhill, C. (2021) · Cambridge University Press eBooks · doi:10.1017/9781009036214.005 · Cited by 25
Geometry and percolation on half planar triangulations
Ray, G. (2014) · Electronic Journal of Probability · doi:10.1214/ejp.v19-3238 · Cited by 25
Kling, P., & der Heide, F. M. A. (2011) · ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) · doi:10.1145/1989493.1989517 · Cited by 25
Mixing Time and Stationary Expected Social Welfare of Logit Dynamics
Auletta, V., Ferraioli, D., Pasquale, F., & Persiano, G. (2013) · Theory of Computing Systems · doi:10.1007/s00224-013-9458-z · Cited by 25
Dynamic Bayesian Network Inferencing for Non-Homogeneous Complex Systems
Wu, P. P., Caley, M. J., Kendrick, G. A., McMahon, K., & Mengersen, K. L. (2017) · Journal of the Royal Statistical Society Series C (Applied Statistics) · doi:10.1111/rssc.12228 · Cited by 25
Transport-Entropy Inequalities and Curvature in Discrete-Space Markov Chains
Eldan, R., Lee, J. R., & Lehec, J. (2017) · Springer eBooks · doi:10.1007/978-3-319-44479-6_16 · Cited by 25
Methods and Applications of Network Sampling
Hasan, M. A. (2016) · doi:10.1287/educ.2016.0147 · Cited by 25
Sandpiles on the Square Lattice
Hough, R. D., Jerison, D. C., & Levine, L. (2019) · Communications in Mathematical Physics · doi:10.1007/s00220-019-03408-5 · Cited by 25
Asymptotic properties of the maximum likelihood estimator in regime switching econometric models
Kasahara, H., & Shimotsu, K. (2018) · Journal of Econometrics · doi:10.1016/j.jeconom.2018.09.019 · Cited by 25
Chleboun, P., Faggionato, A., & Martinelli, F. (2016) · The Annals of Probability · doi:10.1214/15-aop1011 · Cited by 25
Logical limit laws for minor-closed classes of graphs
Heinig, P., Müller, T., Noy, M., & Taraz, A. (2018) · Journal of Combinatorial Theory Series B · doi:10.1016/j.jctb.2017.12.002 · Cited by 25
Zero-temperature 2D stochastic Ising model and anisotropic curve-shortening flow
Lacoin, H., Simenhaus, F., & Toninelli, F. L. (2014) · Journal of the European Mathematical Society · doi:10.4171/jems/493 · Cited by 25
Maximizing the probability of attaining a target prior to extinction
Chatterjee, D., Cinquemani, E., & Lygeros, J. (2011) · Nonlinear Analysis Hybrid Systems · doi:10.1016/j.nahs.2010.12.003 · Cited by 25
The Square Root Law of Steganography: Bringing Theory Closer to Practice
Ker, A. D. (2017) · ACM Workshop on Information Hiding and Multimedia Security (IH&MMSec) · doi:10.1145/3082031.3083235 · Cited by 25
Graph-Theoretic Analysis of Belief System Dynamics under Logic Constraints
Nedić, A., Olshevsky, A., & Uribe, C. A. (2019) · Scientific Reports · doi:10.1038/s41598-019-45076-4 · Cited by 25
Coupling proofs are probabilistic product programs
Barthe, G., Grégoire, B., Hsu, J., & Strub, P.-Y. (2017) · ACM SIGPLAN Notices · doi:10.1145/3093333.3009896 · Cited by 25
The internal branch lengths of the Kingman coalescent
Dahmer, I., & Kersting, G. D. (2015) · The Annals of Applied Probability · doi:10.1214/14-aap1024 · Cited by 25
Ding, J., & Peres, Y. (2013) · Electronic Communications in Probability · doi:10.1214/ecp.v18-2765 · Cited by 25
Self-citationAmplifiers and Suppressors of Selection for the Moran Process on Undirected GraphsPreprint
Giakkoupis, G. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1611.01585 · Cited by 25
Dynamic Matching Market DesignPreprint
Akbarpour, M., Li, S., & Gharan, S. O. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1402.3643 · Cited by 25
Miller, J., & Sousi, P. (2016) · Probability Theory and Related Fields · doi:10.1007/s00440-016-0697-1 · Cited by 24
A High-Order Markov-Chain-Based Scheduling Algorithm for Low Delay in CSMA Networks
Kwak, J., Lee, C.-H., & Eun, D. Y. (2015) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2015.2458703 · Cited by 24
Wireless Network Control of Interacting Rydberg Atoms
Sanders, J., van Bijnen, R., Vredenbregt, E. J. D., & Kokkelmans, S. J. J. M. F. (2014) · Physical Review Letters · doi:10.1103/physrevlett.112.163001 · Cited by 24
Pathwise Duals of Monotone and Additive Markov Processes
Sturm, A., & Swart, J. M. (2016) · Journal of Theoretical Probability · doi:10.1007/s10959-016-0721-5 · Cited by 24
Online Learning Schemes for Power Allocation in Energy Harvesting Communications
Sakulkar, P., & Krishnamachari, B. (2017) · IEEE Transactions on Information Theory · doi:10.1109/tit.2017.2773526 · Cited by 24
Coupling in the Heisenberg group and its applications to gradient estimates
Banerjee, S., Gordina, M., & Mariano, P. (2018) · The Annals of Probability · doi:10.1214/17-aop1247 · Cited by 24
Diffusion and consensus on weakly connected directed graphs
Veerman, J. J. P., & Kummel, E. (2019) · Linear Algebra and its Applications · doi:10.1016/j.laa.2019.05.014 · Cited by 24
On the diffusion geometry of graph Laplacians and applications
Cheng, X., Rachh, M., & Steinerberger, S. (2018) · Applied and Computational Harmonic Analysis · doi:10.1016/j.acha.2018.04.001 · Cited by 24
On an epidemic model on finite graphs
Benjamini, I., Fontes, L. R., Hermon, J., & Machado, F. P. (2020) · The Annals of Applied Probability · doi:10.1214/19-aap1500 · Cited by 24
Robust Distributed Optimization With Randomly Corrupted Gradients
Turan, B., Uribe, C. A., Wai, H.-T., & Alizadeh, M. (2022) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2022.3185885 · Cited by 24
Zeng, S., Doan, T. T., & Romberg, J. (2022) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2022.3201034 · Cited by 24
Tight inequalities among set hitting times in Markov chains
Griffiths, S., Kang, R. J., Oliveira, R. I., & Patel, V. (2014) · Proceedings of the American Mathematical Society · doi:10.1090/s0002-9939-2014-12045-4 · Cited by 24
Diffusion of Innovation in Large Scale Graphs
Fagnani, F., & Zino, L. (2017) · IEEE Transactions on Network Science and Engineering · doi:10.1109/tnse.2017.2678202 · Cited by 24
Linear Time Average Consensus on Fixed Graphs
Olshevsky, A. (2015) · IFAC-PapersOnLine · doi:10.1016/j.ifacol.2015.10.313 · Cited by 24
Sampling from Probabilistic Submodular Models
Gotovos, A. (2019) · Repository for Publications and Research Data (ETH Zurich) · doi:10.3929/ethz-b-000333042 · Cited by 24
How is Distributed ADMM Affected by Network Topology?Preprint
França, G., & Bento, J. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1710.00889 · Cited by 24
1 MIXING RATES OF PARTICLE SYSTEMS WITH ENERGY EXCHANGEPreprint
Grigo, A., Khanin, K. M., & Szasz, D. (n.d.) · Cited by 24
Role of Topology in Relaxation of One-Dimensional Stochastic Processes
Sawada, T., Sone, K., Hamazaki, R., Ashida, Y., & Sagawa, T. (2024) · Physical Review Letters · doi:10.1103/physrevlett.132.046602 · Cited by 23
Characterizing limits and opportunities in speeding up Markov chain mixing
Apers, S., Sarlette, A., & Ticozzi, F. (2021) · Stochastic Processes and their Applications · doi:10.1016/j.spa.2021.03.006 · Cited by 23
Exponential Speedups for Quantum Walks in Random Hierarchical Graphs
Balasubramanian, S., Li, T., & Harrow, A. W. (2025) · Communications in Mathematical Physics · doi:10.1007/s00220-025-05370-x · Cited by 23
Mixing and concentration by Ricci curvature
Paulin, D. (2016) · Journal of Functional Analysis · doi:10.1016/j.jfa.2015.12.010 · Cited by 23
PageRank Optimization in Polynomial Time by Stochastic Shortest Path Reformulation
Csáji, B. C., Jungers, R. M., & Blondel, V. D. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-16108-7_11 · Cited by 23
Symmetry-Aware Marginal Density Estimation
Niepert, M. (2013) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v27i1.8621 · Cited by 23
Improved Inapproximability Results for Counting Independent Sets in the Hard-Core Model
Galanis, A., Ge, Q., Štefankovič, D., Vigoda, E., & Yang, L. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-22935-0_48 · Cited by 23
Rapidly Mixing Gibbs Sampling for a Class of Factor Graphs Using Hierarchy Width
De, C., Zhang, C., Olukotun, K., & Ré, C. (2015) · PubMed · doi:10.48550/arxiv.1510.00756 · Cited by 23
Stochastic variational inference for large-scale discrete choice models using adaptive batch sizes
Tan, L. S. L. (2015) · Statistics and Computing · doi:10.1007/s11222-015-9618-x · Cited by 23
Bayesian Learning Without Recall
Rahimian, M. A., & Jadbabaie, A. (2016) · IEEE Transactions on Signal and Information Processing over Networks · doi:10.1109/tsipn.2016.2631943 · Cited by 23
Abrupt Convergence for Stochastic Small Perturbations of One Dimensional Dynamical Systems
Barrera, G., & Jara, M. (2016) · Journal of Statistical Physics · doi:10.1007/s10955-016-1468-1 · Cited by 23
Zhang, Z., Lin, Y., & Guo, X. (2015) · Physical Review E · doi:10.1103/physreve.91.062808 · Cited by 23
Olofsson, K., & Olsson, H. (2017) · Scandinavian Journal of Forest Research · doi:10.1080/02827581.2017.1368698 · Cited by 23
Finite sample complexity of sequential Monte Carlo estimators on multimodal target distributions
Mathews, J., & Schmidler, S. C. (2024) · The Annals of Applied Probability · doi:10.1214/23-aap1989 · Cited by 23
Gois, B., & Landim, C. (2015) · The Annals of Probability · doi:10.1214/14-aop930 · Cited by 23
Engbers, J., & Galvin, D. (2012) · Journal of Combinatorial Theory Series B · doi:10.1016/j.jctb.2012.05.003 · Cited by 23
An Exercise(?) in Fourier Analysis on the Heisenberg Group
Bump, D., Diaconis, P. W., Hicks, A., Miclo, L., & Widom, H. (2017) · Annales de la faculté des sciences de Toulouse Mathématiques · doi:10.5802/afst.1533 · Cited by 23
Biased random walk on critical Galton–Watson trees conditioned to survive
Croydon, D. A., Fribergh, A., & Kumagai, T. (2012) · Probability Theory and Related Fields · doi:10.1007/s00440-012-0462-z · Cited by 23
A lower bound for disconnection by simple random walk
Li, X. (2017) · The Annals of Probability · doi:10.1214/15-aop1077 · Cited by 23
Compositional strategy synthesis for stochastic games with multiple objectives
Basset, N., Kwiatkowska, M., & Wiltsche, C. (2017) · Information and Computation · doi:10.1016/j.ic.2017.09.010 · Cited by 23
Broadcasting on Random Directed Acyclic Graphs
Makur, A., Mossel, E., & Polyanskiy, Y. (2019) · IEEE Transactions on Information Theory · doi:10.1109/tit.2019.2935772 · Cited by 23
Compressed Sensing with Applications in Wireless Networks
Leinonen, M., Codreanu, M., & Giannakis, G. B. (2019) · Foundations and Trends® in Signal Processing · doi:10.1561/2000000107 · Cited by 23
Coppola, G. (2015) · ERA · Cited by 23
Learning from weakly dependent data under Dobrushin's conditionPreprint
Dagan, Y., Daskalakis, C., Dikkala, N., & Jayanti, S. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1906.09247 · Cited by 23
The probability of long cycles in interchange processesPreprint
Alon, G., & Kozma, G. (n.d.) · Cited by 23
On the mixing time of the 2D stochastic Ising model with plus boundary conditions at low temperaturePreprint
Martinelli, F., Fabio, & Toninelli, F. L. (n.d.) · Cited by 23
Opinion Fluctuations and Disagreement in Social NetworksPreprint
Acemoğlu, D., Como, G., Fagnani, F., & Ozdaglar, A. (2010) · SSRN Electronic Journal · doi:10.2139/ssrn.1682187 · Cited by 23
Concentration of measure and mixing for Markov chains
Luczak, M. (2008) · Discrete Mathematics & Theoretical Computer Science · doi:10.46298/dmtcs.3558 · Cited by 22
Hu, G., Li, H., Zhao, W., Hao, Y., Bai, Z., Nickerson, L. D. H., & Cong, F. (2022) · NeuroImage · doi:10.1016/j.neuroimage.2022.119193 · Cited by 22
Sharp Entrywise Perturbation Bounds for Markov Chains
Thiede, E. H., Koten, B. V., & Weare, J. (2015) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/140987900 · Cited by 22
Push-Sum With Transmission Failures
Gerencsér, B. S., & Hendrickx, J. M. (2018) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2018.2836861 · Cited by 22
MOMCMC: An efficient Monte Carlo method for multi-objective sampling over real parameter space
Li, Y. (2012) · Computers & Mathematics with Applications · doi:10.1016/j.camwa.2012.09.003 · Cited by 22
Conflict and Computation on Wikipedia: A Finite-State Machine Analysis of Editor Interactions
DeDeo, S. (2016) · Future Internet · doi:10.3390/fi8030031 · Cited by 22
Hermon, J. (2018) · Electronic Journal of Probability · doi:10.1214/18-ejp144 · Cited by 22
Return Probability and Recurrence for the Random Walk Driven by Two-Dimensional Gaussian Free Field
Biskup, M., Ding, J., & Goswami, S. (2019) · Communications in Mathematical Physics · doi:10.1007/s00220-019-03589-z · Cited by 22
The spectral gap of sparse random digraphs
Coste, S. (2021) · Annales de l Institut Henri Poincaré Probabilités et Statistiques · doi:10.1214/20-aihp1090 · Cited by 22
On Counting Perfect Matchings in General Graphs
Štefankovič, D., Vigoda, E., & Wilmes, J. (2018) · Lecture notes in computer science · doi:10.1007/978-3-319-77404-6_63 · Cited by 22
Choi, M. C. H., & Patie, P. (2018) · Transactions of the American Mathematical Society · doi:10.1090/tran/7773 · Cited by 22
The Study of Dynamic Caching via State Transition Field—the Case of Time-Invariant Popularity
Gao, J., Zhao, L. Y., & She, X. (2019) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2019.2940676 · Cited by 22
MCMC sampling colourings and independent sets of G(n, d/n) near uniqueness threshold
Efthymiou, C. (2013) · ACM-SIAM Symposium on Discrete Algorithms (SODA) · doi:10.1137/1.9781611973402.22 · Cited by 22
Quantum sampling algorithms, phase transitions, and computational complexity
Wild, D. S., Sels, D., Pichler, H., Zanoci, C., & Lukin, M. D. (2021) · Physical Review A · doi:10.1103/physreva.104.032602 · Cited by 22
Characterization of cutoff for reversible Markov chains
Basu, R., Hermon, J., & Peres, Y. (2014) · ACM-SIAM Symposium on Discrete Algorithms (SODA) · doi:10.1137/1.9781611973730.119 · Cited by 22
Self-citationVoter models on subcritical scale‐free random graphs
Fernley, J., & Ortgiese, M. (2022) · Random Structures and Algorithms · doi:10.1002/rsa.21107 · Cited by 22
Robustness of Large-Scale Stochastic Matrices to Localized Perturbations
Como, G., & Fagnani, F. (2014) · IEEE Transactions on Network Science and Engineering · doi:10.1109/cdc.2014.7039957 · Cited by 22
Time scale separation in the low temperature East model: rigorous results
Chleboun, P., Faggionato, A., & Martinelli, F. (2013) · Journal of Statistical Mechanics Theory and Experiment · doi:10.1088/1742-5468/2013/04/l04001 · Cited by 22
Baker, K. L., & Curtin, W. A. (2016) · Journal of the Mechanics and Physics of Solids · doi:10.1016/j.jmps.2016.04.006 · Cited by 22
Interlacings for Random Walks on Weighted Graphs and the Interchange Process
Dieker, A. B. (2010) · SIAM Journal on Discrete Mathematics · doi:10.1137/090775361 · Cited by 22
Computing the Stationary Distribution LocallyPreprint
Lee, C., Ozdaglar, A., & Shah, D. (2013) · arXiv (Cornell University) · Cited by 22
Agrawal, S., Jeon, W., & Lee, M. (2024) · arXiv (Cornell University) · doi:10.48550/arxiv.2410.18351 · Cited by 22
An efficient probabilistic hardware architecture for diffusion-like models
Jelinčič, A., Lockwood, O., Garlapati, A., Schillinger, P., Chuang, I. L., Verdon, G., & McCourt, T. (2026) · npj Unconventional Computing · doi:10.1038/s44335-026-00075-3 · Cited by 21
The maximum relaxation time of a random walk
Aksoy, S. G., Chung, F., Tait, M., & Tobin, J. (2018) · Advances in Applied Mathematics · doi:10.1016/j.aam.2018.07.002 · Cited by 21
Equal sums in random sets and the concentration of divisors
Ford, K., Green, B. J., & Koukoulopoulos, D. (2023) · Inventiones mathematicae · doi:10.1007/s00222-022-01177-y · Cited by 21
Mixing of Metropolis-adjusted Markov chains via couplings: The high acceptance regime
Bou-Rabee, N. M., & Oberdörster, S. (2024) · Electronic Journal of Probability · doi:10.1214/24-ejp1150 · Cited by 21
Does Adding More Agents Make a Difference? A Case Study of Cover Time for the Rotor-Router
Kosowski, A., & Pająk, D. (2014) · Lecture notes in computer science · doi:10.1007/978-3-662-43951-7_46 · Cited by 21
Correlated energy generation and imperfect State-of-Charge knowledge in energy harvesting devices
Michelusi, N., Badia, L., Carli, R., Stamatiou, K., & Zorzi, M. (2012) · International Wireless Communications and Mobile Computing Conference (IWCMC) · doi:10.1109/iwcmc.2012.6314238 · Cited by 21
R5N: Randomized recursive routing for restricted-route networks
Evans, N. S., & Grothoff, C. (2011) · International Conference on Network and System Security (NSS) · doi:10.1109/icnss.2011.6060022 · Cited by 21
Kalathil, D., Borkar, V. S., & Jain, R. (2020) · Stochastic Systems · doi:10.1287/stsy.2019.0062 · Cited by 21
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.