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 101–200 of 1,000
Sequential Compressed Sensing With Progressive Signal Reconstruction in Wireless Sensor Networks
Leinonen, M., Codreanu, M., & Juntti, M. J. (2014) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2014.2371017 · Cited by 96
TPE2: Three-Pixel Exact Thumbnail-Preserving Image Encryption
Zhao, R., Zhang, Y., Xiao, X., Ye, X., & Lan, R. (2021) · Signal Processing · doi:10.1016/j.sigpro.2021.108019 · Cited by 90
Plurality Consensus in the Gossip Model
Becchetti, L., Clementi, A. E. F., Natale, E., Pasquale, F., & Silvestri, R. (2014) · ACM-SIAM Symposium on Discrete Algorithms (SODA) · doi:10.1137/1.9781611973730.27 · Cited by 95
Zhang, Y., & Cheng, T. (2019) · Computers Environment and Urban Systems · doi:10.1016/j.compenvurbsys.2019.101403 · Cited by 94
Learning in Social NetworksPreprint
Golub, B., & Sadler, E. D. (2017) · SSRN Electronic Journal · doi:10.2139/ssrn.2919146 · Cited by 93
Olshevsky, A. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1411.4186 · Cited by 92
The Mixing Time Evolution of Glauber Dynamics for the Mean-Field Ising Model
Ding, J., Lubetzky, E., & Peres, Y. (2009) · Communications in Mathematical Physics · doi:10.1007/s00220-009-0781-9 · Cited by 91
Self-citationDiscrete Curvature and Abelian Groups
Klartag, B., Kozma, G., Ralli, P., & Tetali, P. (2015) · Canadian Journal of Mathematics · doi:10.4153/cjm-2015-046-8 · Cited by 91
Lee, C.-H., Xu, X., & Eun, D. Y. (2012) · ACM SIGMETRICS Performance Evaluation Review · doi:10.1145/2318857.2254795 · Cited by 91
Walkman: A Communication-Efficient Random-Walk Algorithm for Decentralized Optimization
Mao, X., Yuan, K., Hu, Y., Gu, Y., Sayed, A. H., & Yin, W. (2020) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2020.2983167 · Cited by 90
Rough parameter dependence in climate models and the role of Ruelle-Pollicott resonances
Chekroun, M. D., Neelin, J. D., Kondrashov, D., McWilliams, J. C., & Ghil, M. (2014) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1321816111 · Cited by 90
Understanding Concept DriftPreprint
Webb, G. I., Lee, L. K., Petitjean, F., & Goethals, B. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1704.00362 · Cited by 90
Generalized Method-of-Moments for Rank Aggregation
Soufiani, H. A., Chen, W., Parkes, D. C., & Xia, L. (2013) · neural information processing systems · Cited by 89
An Appraisal of the Classic Forest Succession Paradigm with the Shade Tolerance Index
Liénard, J., Florescu, I., & Strigul, N. S. (2015) · PLoS ONE · doi:10.1371/journal.pone.0117138 · Cited by 89
On estimating the average degree
Dasgupta, A., Kumar, R., & Sarlós, T. (2014) · International World Wide Web Conference (WWW) · doi:10.1145/2566486.2568019 · Cited by 89
Counting Graphlets: Space vs Time
Bressan, M., Chierichetti, F., Kumar, R., Leucci, S., & Panconesi, A. (2017) · ACM International Conference on Web Search and Data Mining (WSDM) · doi:10.1145/3018661.3018732 · Cited by 89
Mixing Properties of Stochastic Quantum Hamiltonians
Onorati, E., Buerschaper, O., Kliesch, M., Brown, W., Werner, A. H., & Eisert, J. (2017) · Communications in Mathematical Physics · doi:10.1007/s00220-017-2950-6 · Cited by 88
von Merten, S., Hoier, S., Pfeifle, C., & Tautz, D. (2014) · PLoS ONE · doi:10.1371/journal.pone.0097244 · Cited by 88
Perfect matchings as IID factors on non-amenable groups
Lyons, R., & Nazarov, F. (2011) · European Journal of Combinatorics · doi:10.1016/j.ejc.2011.03.008 · Cited by 88
Approximate Consensus in Highly Dynamic Networks: The Role of Averaging Algorithms
Charron-Bost, B., Függer, M., & Nowak, T. (2015) · Lecture notes in computer science · doi:10.1007/978-3-662-47666-6_42 · Cited by 88
On Sampling Nodes in a Network
Chiericetti, F., Dasgupta, A., Kumar, R., Lattanzi, S., & Sarlós, T. (2016) · International World Wide Web Conference (WWW) · doi:10.1145/2872427.2883045 · Cited by 88
An Introduction to Random Interlacements
Drewitz, A., Ráth, B., & Sapozhnikov, A. (2014) · SpringerBriefs in mathematics · doi:10.1007/978-3-319-05852-8 · Cited by 87
Foundations of Probabilistic Programming
Dahlqvist, F., Silva, A., Kozen, D. C., Staton, S., Huang, D., Morrisett, G., Spitters, B., Lago, U. D., Barthe, G., Hsu, J., et al. (2020) · Cambridge University Press eBooks · doi:10.1017/9781108770750 · Cited by 87
Linear Time Average Consensus and Distributed Optimization on Fixed Graphs
Olshevsky, A. (2017) · SIAM Journal on Control and Optimization · doi:10.1137/16m1076629 · Cited by 87
Hydrodynamic transport in strongly coupled disordered quantum field theories
Lucas, A. (2015) · New Journal of Physics · doi:10.1088/1367-2630/17/11/113007 · Cited by 85
Quantum-walk-based search and centrality
Berry, S. M., & Wang, J. B. (2010) · Physical Review A · doi:10.1103/physreva.82.042333 · Cited by 82
On Mixing of Markov Chains: Coupling, Spectral Independence, and Entropy Factorization
Blanca, A., Caputo, P., Chen, Z., Parisi, D., Štefankovič, D., & Vigoda, E. (2022) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611977073.145 · Cited by 81
Rapid mixing implies exponential decay of correlations
Kastoryano, M. J., & Eisert, J. (2013) · Journal of Mathematical Physics · doi:10.1063/1.4822481 · Cited by 81
0 Exact Thresholds for Ising-Gibbs Samplers on General Graphs
Mossel, E., & Sly, A. (2013) · ScholarlyCommons (University of Pennsylvania) · Cited by 81
Motif Counting Beyond Five Nodes
Bressan, M., Chierichetti, F., Kumar, R., Leucci, S., & Panconesi, A. (2018) · ACM Transactions on Knowledge Discovery from Data · doi:10.1145/3186586 · Cited by 80
A Continuous Time Framework for Discrete Denoising ModelsPreprint
Campbell, A. T., Benton, J., Bortoli, V. D., Rainforth, T., Deligiannidis, G., & Doucet, A. (2022) · HAL · doi:10.48550/arxiv.2205.14987 · Cited by 80
Core-Periphery Trading NetworksPreprint
Wang, C. (2016) · SSRN Electronic Journal · doi:10.2139/ssrn.2747117 · Cited by 79
Random walks on simplicial complexes and harmonics
Mukherjee, S., & Steenbergen, J. (2016) · Random Structures and Algorithms · doi:10.1002/rsa.20645 · Cited by 78
Total variation cutoff in birth-and-death chains
Ding, J., Lubetzky, E., & Peres, Y. (2008) · Probability Theory and Related Fields · doi:10.1007/s00440-008-0185-3 · Cited by 78
Self-citationThe cutoff profile for the simple exclusion process on the circle
Lacoin, H. (2016) · The Annals of Probability · doi:10.1214/15-aop1053 · Cited by 77
Consensus Dynamics: An Overview
Becchetti, L., Clementi, A. E. F., & Natale, E. (2020) · ACM SIGACT News · doi:10.1145/3388392.3388403 · Cited by 77
Simulated Quantum Annealing Can Be Exponentially Faster Than Classical Simulated Annealing
Crosson, E., & Harrow, A. W. (2016) · 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS) · doi:10.1109/focs.2016.81 · Cited by 76
The computational power of optimization in online learning
Hazan, E., & Koren, T. (2016) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/2897518.2897536 · Cited by 76
Characterization of cutoff for reversible Markov chains
Basu, R., Hermon, J., & Peres, Y. (2017) · The Annals of Probability · doi:10.1214/16-aop1090 · Cited by 76
Self-citationHopf algebras and Markov chains: two examples and a theory
Diaconis, P. W., Pang, C. Y. A., & Ram, A. (2013) · Journal of Algebraic Combinatorics · doi:10.1007/s10801-013-0456-7 · Cited by 75
Oo, T. Z., Tran, N. H. K., Saad, W., Niyato, D. T., Han, Z., & Hong, C. S. (2016) · IEEE Transactions on Mobile Computing · doi:10.1109/tmc.2016.2613864 · Cited by 75
On the Role of Network Centrality in the Controllability of Complex Networks
Bof, N., Baggio, G., & Zampieri, S. (2016) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2016.2550862 · Cited by 75
Regret Bounds for Restless Markov Bandits
Ortner, R., Ryabko, D., Auer, P. L., & Munos, R. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-34106-9_19 · Cited by 75
Interacting particle systems as stochastic social dynamics
Aldous, D. (2013) · Bernoulli · doi:10.3150/12-bejsp04 · Cited by 75
Haskell, W. B., Jain, R., & Kalathil, D. M. (2016) · Mathematics of Operations Research · doi:10.1287/moor.2015.0733 · Cited by 75
Quantum Algorithm Design: Techniques and Applications
Shao, C., Yang, L., & Li, H. (2019) · Journal of Systems Science and Complexity · doi:10.1007/s11424-019-9008-0 · Cited by 75
Cutoff for non-negatively curved Markov chains
Salez, J. (2023) · Journal of the European Mathematical Society · doi:10.4171/jems/1348 · Cited by 74
Event-Chain Monte Carlo: Foundations, Applications, and Prospects
Krauth, W. (2021) · Frontiers in Physics · doi:10.3389/fphy.2021.663457 · Cited by 74
Approximating the Expansion Profile and Almost Optimal Local Graph Clustering
Gharan, S. O., & Trevisan, L. (2012) · Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2012.85 · Cited by 74
Gumbel fluctuations for cover times in the discrete torus
Belius, D. (2013) · Probability Theory and Related Fields · doi:10.1007/s00440-012-0467-7 · Cited by 73
Learning High-Dimensional Generalized Linear Autoregressive Models
Hall, E. C., Raskutti, G., & Willett, R. M. (2018) · IEEE Transactions on Information Theory · doi:10.1109/tit.2018.2884673 · Cited by 73
Landim, C. (2019) · Probability Surveys · doi:10.1214/18-ps310 · Cited by 73
Growth in groups: ideas and perspectives
Helfgott, H. A. (2015) · Bulletin of the American Mathematical Society · doi:10.1090/s0273-0979-2015-01475-8 · Cited by 73
Hermon, J., & Peres, Y. (2017) · Probability Theory and Related Fields · doi:10.1007/s00440-017-0769-x · Cited by 72
Self-citationImproved inapproximability results for counting independent sets in the hard‐core model
Galanis, A., Ge, Q., Štefankovič, D., Vigoda, E., & Yang, L. (2012) · Random Structures and Algorithms · doi:10.1002/rsa.20479 · Cited by 71
Structure-Based Sybil Detection in Social Networks via Local Rule-Based Propagation
Wang, B., Jia, J., Zhang, L., & Gong, N. Z. (2018) · IEEE Transactions on Network Science and Engineering · doi:10.1109/tnse.2018.2813672 · Cited by 71
Can Extra Updates Delay Mixing?
Peres, Y., & Winkler, P. M. (2013) · Communications in Mathematical Physics · doi:10.1007/s00220-013-1776-0 · Cited by 70
Self-citationLocation Privacy in Mobile Edge Clouds: A Chaff-Based Approach
He, T., Ciftcioglu, E. N., Wang, S., & Chan, K. S. (2017) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2017.2760179 · Cited by 64
Lifting—A nonreversible Markov chain Monte Carlo algorithm
Vucelja, M. (2016) · American Journal of Physics · doi:10.1119/1.4961596 · Cited by 69
Glauber Dynamics for the Mean-Field Potts Model
Cuff, P., Ding, J., Louidor, O., Lubetzky, E., Peres, Y., & Sly, A. (2012) · Journal of Statistical Physics · doi:10.1007/s10955-012-0599-2 · Cited by 69
Self-citationPageRank optimization by edge selection
Csáji, B. C., Jungers, R. M., & Blondel, V. D. (2014) · Discrete Applied Mathematics · doi:10.1016/j.dam.2014.01.007 · Cited by 69
Robotic Surveillance and Markov Chains With Minimal Weighted Kemeny Constant
Patel, R., Agharkar, P., & Bullo, F. (2015) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2015.2426317 · Cited by 69
Spectral Gap Estimates in Mean Field Spin Glasses
Arous, G. B., & Jagannath, A. (2018) · Communications in Mathematical Physics · doi:10.1007/s00220-018-3152-6 · Cited by 69
Cutoff phenomenon for the asymmetric simple exclusion process and the biased card shuffling
Labbé, C., & Lacoin, H. (2019) · The Annals of Probability · doi:10.1214/18-aop1290 · Cited by 69
Lu, F., Maggioni, M., & Tang, S. (2021) · Foundations of Computational Mathematics · doi:10.1007/s10208-021-09521-z · Cited by 68
A Hilbert Space Approach to Effective Resistance Metric
Jørgensen, P. E. T., & Pearse, E. P. J. (2009) · Complex Analysis and Operator Theory · doi:10.1007/s11785-009-0041-1 · Cited by 68
Distributed Dual Averaging In Networks
Agarwal, A., Wainwright, M. J., & Duchi, J. C. (2010) · neural information processing systems · Cited by 68
Community Detection in Bipartite Networks: Algorithms and Case studies
Alzahrani, T., & Horadam, K. J. (2015) · Understanding complex systems · doi:10.1007/978-3-662-47824-0_2 · Cited by 68
On the Dynamics of Random Neuronal Networks
Robert, P., & Touboul, J. (2016) · Journal of Statistical Physics · doi:10.1007/s10955-016-1622-9 · Cited by 67
A Martingale approach to metastability
Beltrán, J., & Landim, C. (2014) · Probability Theory and Related Fields · doi:10.1007/s00440-014-0549-9 · Cited by 67
Spectral State Compression of Markov Processes
Zhang, A. R., & Wang, M. (2019) · IEEE Transactions on Information Theory · doi:10.1109/tit.2019.2956737 · Cited by 67
Building occupancy modeling using generative adversarial network
Chen, Z., & Jiang, C. (2018) · Energy and Buildings · doi:10.1016/j.enbuild.2018.06.029 · Cited by 66
Reward is enough for convex MDPsPreprint
Zahavy, T., O’Donoghue, B., Desjardins, G., & Singh, S. P. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2106.00661 · Cited by 66
Maria, F. D., Bianconi, F., Micale, C., Baglioni, S., & Marionni, M. (2015) · Waste Management · doi:10.1016/j.wasman.2015.12.005 · Cited by 65
Integrability of a deterministic cellular automaton driven by stochastic boundaries
Prosen, T., & Mejía-Monasterio, C. (2016) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8113/49/18/185003 · Cited by 65
A lecture on the averaging process
Aldous, D., & Lanoue, D. (2012) · Probability Surveys · doi:10.1214/11-ps184 · Cited by 64
On the fragmentation of a torus by random walk
Teixeira, A., & Windisch, D. (2011) · Communications on Pure and Applied Mathematics · doi:10.1002/cpa.20382 · Cited by 64
Random walk on sparse random digraphs
Bordenave, C., Caputo, P., & Salez, J. (2017) · Probability Theory and Related Fields · doi:10.1007/s00440-017-0796-7 · Cited by 64
Quantum walk approach to simulating parton showers
Bepari, K., Malik, S. A., Spannowsky, M., & Williams, S. (2022) · Physical review. D/Physical review. D. · doi:10.1103/physrevd.106.056002 · Cited by 64
A Markov Chain Algorithm for Compression in Self-Organizing Particle Systems
Cannon, S., Daymude, J. J., Randall, D., & Richa, A. W. (2016) · ACM Symposium on Principles of Distributed Computing (PODC) · doi:10.1145/2933057.2933107 · Cited by 63
Simple dynamics for plurality consensus
Becchetti, L., Clementi, A. E. F., Natale, E., Pasquale, F., Silvestri, R., & Trevisan, L. (2016) · Distributed Computing · doi:10.1007/s00446-016-0289-4 · Cited by 63
Caraka, R. E., Chen, R.-C., Toharudin, T., Pardamean, B., Yasin, H., & Wu, S.-H. (2019) · IEEE Access · doi:10.1109/access.2019.2950439 · Cited by 62
LaneQuest: An accurate and energy-efficient lane detection system
Aly, H., Basalamah, A., & Youssef, M. (2015) · IEEE International Conference on Pervasive Computing and Communications · doi:10.1109/percom.2015.7146523 · Cited by 61
Mixing time estimation in reversible Markov chains from a single sample path
Hsu, D., Kontorovich, A., Levin, D. A., Peres, Y., Szepesvári, C., & Wolfer, G. (2019) · The Annals of Applied Probability · doi:10.1214/18-aap1457 · Cited by 61
Self-citationA visual introduction to Riemannian curvatures and some discrete generalizations
Ollivier, Y. (2013) · CRM proceedings & lecture notes · doi:10.1090/crmp/056/08 · Cited by 61
Distributed Online Linear Regressions
Yuan, D., Proutière, A., & Shi, G. (2020) · IEEE Transactions on Information Theory · doi:10.1109/tit.2020.3029304 · Cited by 61
Speed of random walks, isoperimetry and compression of finitely generated groups
Brieussel, J., & Zheng, T. (2021) · Annals of Mathematics · doi:10.4007/annals.2021.193.1.1 · Cited by 61
Brzeziński, D., Minku, L. L., Pewinski, T., Stefanowski, J., & Szumaczuk, A. (2021) · Knowledge and Information Systems · doi:10.1007/s10115-021-01560-w · Cited by 61
Estimating the Entropy Rate of Finite Markov Chains With Application to Behavior Studies
Vegetabile, B., Stout, S. A., Davis, E. P., Baram, T. Z., & Stern, H. P. (2019) · Journal of Educational and Behavioral Statistics · doi:10.3102/1076998618822540 · Cited by 60
Expanders – how to find them, and what to find in them
Krivelevich, M. (2019) · Cambridge University Press eBooks · doi:10.1017/9781108649094.005 · Cited by 60
Optimizing Expectations: From Deep Reinforcement Learning to Stochastic Computation Graphs
Schulman, J. (2016) · UC Berkeley · Cited by 60
Some simple but challenging Markov processes
Malrieu, F. (2015) · Annales de la faculté des sciences de Toulouse Mathématiques · doi:10.5802/afst.1468 · Cited by 59
Exact and asymptotic results on coarse Ricci curvature of graphs
Bhattacharya, B. B., & Mukherjee, S. (2014) · Discrete Mathematics · doi:10.1016/j.disc.2014.08.012 · Cited by 59
Oliveira, R. I. (2013) · The Annals of Probability · doi:10.1214/11-aop714 · Cited by 59
Fast Consensus for Voting on General Expander Graphs
Cooper, C., Elsässer⋆, R., Radzik, T., Rivera, N., & Shiraga, T. (2015) · Lecture notes in computer science · doi:10.1007/978-3-662-48653-5_17 · Cited by 59
Kinetic theory of transport for inhomogeneous electron fluids
Lucas, A., & Hartnoll, S. A. (2018) · Physical review. B./Physical review. B · doi:10.1103/physrevb.97.045105 · Cited by 59
Stochastic Subgradient Algorithms for Strongly Convex Optimization Over Distributed Networks
Sayin, M. O., Vanli, N. D., Kozat, S. S., & Başar, T. (2017) · IEEE Transactions on Network Science and Engineering · doi:10.1109/tnse.2017.2713396 · Cited by 59
Evolving voter model on dense random graphs
Basu, R., & Sly, A. (2017) · The Annals of Applied Probability · doi:10.1214/16-aap1230 · Cited by 58
Saliency based mass detection from screening mammograms
Agrawal, P., Vatsa, M., & Singh, R. (2013) · Signal Processing · doi:10.1016/j.sigpro.2013.12.010 · Cited by 58
Coupling proofs are probabilistic product programs
Barthe, G., Grégoire, B., Hsu, J., & Strub, P.-Y. (2016) · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · doi:10.1145/3009837.3009896 · Cited by 58
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.