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 801–900 of 1,000
Metastability of hard-core dynamics on bipartite graphs
den Hollander, F., Nardi, F. R., & Taati, S. (2018) · Electronic Journal of Probability · doi:10.1214/18-ejp210 · Cited by 18
Spectral gap of sparse bistochastic matrices with exchangeable rows
Bordenave, C., Qiu, Y., & Zhang, Y. (2020) · Annales de l Institut Henri Poincaré Probabilités et Statistiques · doi:10.1214/20-aihp1065 · Cited by 18
Florit, E., & Smith, B. (2022) · Contemporary mathematics - American Mathematical Society · doi:10.1090/conm/779/15672 · Cited by 18
Jia, J., Li, P., & Meng, D. (2022) · SIAM Journal on Numerical Analysis · doi:10.1137/21m1440773 · Cited by 18
Clustered Hierarchical Anomaly and Outlier Detection Algorithms
Ishaq, N., Howard, T. J., & Daniels, N. M. (2021) · IEEE International Conference on Big Data (BigData) · doi:10.1109/bigdata52589.2021.9671566 · Cited by 18
Maximum and minimum of local times for two-dimensional random walk
Abe, Y. (2015) · Electronic Communications in Probability · doi:10.1214/ecp.v20-3877 · Cited by 18
Convergence to extremal processes in random environments and extremal ageing in SK models
Bovier, A., Gayrard, V., & Švejda, A. (2012) · Probability Theory and Related Fields · doi:10.1007/s00440-012-0456-x · Cited by 18
A probabilistic interpretation of the Macdonald polynomials
Diaconis, P. W., & Ram, A. (2012) · The Annals of Probability · doi:10.1214/11-aop674 · Cited by 18
Asynchronous Gossip for Averaging and Spectral Ranking
Borkar, V. S., Makhijani, R. M., & Sundaresan, R. (2014) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2014.2320229 · Cited by 18
FROM MICROSCOPIC HETEROGENEITY TO MACROSCOPIC COMPLEXITY IN THE CONTRARIAN VOTER MODEL
Banisch, S. (2014) · Advances in Complex Systems · doi:10.1142/s0219525914500258 · Cited by 18
Convergence Speed of the Consensus Algorithm With Interference and Sparse Long-Range Connectivity
Vanka, S., Haenggi, M., & Gupta, V. (2011) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2011.2118741 · Cited by 18
Metropolis–Hastings reversiblizations of non-reversible Markov chains
Choi, M. C. H. (2019) · Stochastic Processes and their Applications · doi:10.1016/j.spa.2019.04.006 · Cited by 18
Espig, L., FRIEZE, A. M., Krivelevich, M., & Pegden, W. (2015) · SIAM Journal on Discrete Mathematics · doi:10.1137/140953708 · Cited by 18
Quasi‐polynomial mixing of critical two‐dimensional random cluster models
Gheissari, R., & Lubetzky, E. (2019) · Random Structures and Algorithms · doi:10.1002/rsa.20868 · Cited by 18
Relaying One Bit Across a Tandem of Binary-Symmetric Channels
Huleihel, W., Polyanskiy, Y., & Shayevitz, O. (2019) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2019.8849298 · Cited by 18
Sharp threshold for the FA-2f kinetically constrained model
Hartarsky, I., Martinelli, F., & Toninelli, C. (2022) · Probability Theory and Related Fields · doi:10.1007/s00440-022-01169-2 · Cited by 18
Convergence of mixing times for sequences of random walks on finite graphs
Croydon, D. A., Hambly, B. M., & Kumagai, T. (2012) · Electronic Journal of Probability · doi:10.1214/ejp.v17-1705 · Cited by 18
Dynamics of lattice triangulations on thin rectangles
Caputo, P., Martinelli, F., Sinclair, A., & Stauffer, A. O. (2016) · Electronic Journal of Probability · doi:10.1214/16-ejp4321 · Cited by 18
Lien, C.-M., Chang, S., Chang, C., & Lee, D. (2012) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infcom.2012.6195739 · Cited by 18
The mixing time of the Newman–Watts small world
Addario‐Berry, L., & Lei, T. (2012) · ACM-SIAM Symposium on Discrete Algorithms (SODA) · doi:10.1137/1.9781611973099.131 · Cited by 18
Cutoff phenomenon for the simple exclusion process on the complete graphPreprint
Lacoin, H., & Leblond, R. (2010) · arXiv (Cornell University) · doi:10.48550/arxiv.1010.4866 · Cited by 18
Testing the Number of Regimes in Markov Regime Switching ModelsPreprint
Kasahara, H., & Shimotsu, K. (2018) · RePEc: Research Papers in Economics · doi:10.48550/arxiv.1801.06862 · Cited by 18
Privately Learning Markov Random FieldsPreprint
Zhang, H., Kamath, G., Kulkarni, J., & Wu, Z. S. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2002.09463 · Cited by 18
Doan, T. T. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2104.01627 · Cited by 18
Gel'fand triples and boundaries of infinite networksPreprint
Jørgensen, P. E. T., & Pearse, E. P. J. (2009) · arXiv (Cornell University) · doi:10.48550/arxiv.0906.2745 · Cited by 18
Dynamic centrality measures for cattle trade networks
Hoscheit, P., Anthony, E., & Vergu, E. (2021) · Applied Network Science · doi:10.1007/s41109-021-00368-5 · Cited by 17
Logit Dynamics with Concurrent Updates for Local Interaction Games
Auletta, V., Ferraioli, D., Pasquale, F., Penna, P., & Persiano, G. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-40450-4_7 · Cited by 17
Self-Stabilizing Repeated Balls-into-Bins
Becchetti, L., Clementi, A. E. F., Natale, E., Pasquale, F., & Posta, G. (2015) · ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) · doi:10.1145/2755573.2755584 · Cited by 17
An invitation to coupling and copulas: With applications to multisensory modeling
Colonius, H. (2016) · Journal of Mathematical Psychology · doi:10.1016/j.jmp.2016.02.004 · Cited by 17
Novel sampling design for respondent-driven sampling
Khabbazian, M., Hanlon, B., Russek, Z., & Rohe, K. (2017) · Electronic Journal of Statistics · doi:10.1214/17-ejs1358 · Cited by 17
When is a Scale-Free Graph Ultra-Small?
van der Hofstad, R., & Komjáthy, J. (2017) · Journal of Statistical Physics · doi:10.1007/s10955-017-1864-1 · Cited by 17
Leistedt, B., & Hogg, D. W. (2017) · The Astronomical Journal · doi:10.3847/1538-3881/aa91d5 · Cited by 17
Non-equivalence of Dynamical Ensembles and Emergent Non-ergodicity
Vroylandt, H., & Verley, G. (2018) · Journal of Statistical Physics · doi:10.1007/s10955-018-2186-7 · Cited by 17
Analytic-geometric methods for finite Markov chains with applications to quasi-stationarity
Diaconis, P. W., Houston-Edwards, K., & Saloff‐Coste, L. (2020) · Latin American Journal of Probability and Mathematical Statistics · doi:10.30757/alea.v17-35 · Cited by 17
Toward Quantifying Vertex Similarity in Networks
Tsourakakis, C. E. (2014) · Internet Mathematics · doi:10.1080/15427951.2013.836581 · Cited by 17
Random Attraction in the TASEP Model
Gruene, L., Kriecherbauer, T., & Margaliot, M. (2021) · SIAM Journal on Applied Dynamical Systems · doi:10.1137/20m131446x · Cited by 17
Rayleigh-Gauss-Newton optimization with enhanced sampling for variational Monte Carlo
Webber, R. J., & Lindsey, M. (2022) · Physical Review Research · doi:10.1103/physrevresearch.4.033099 · Cited by 17
On Simple Mechanisms for Dependent Items
Cai, Y., & Oikonomou, A. (2021) · ACM Conference on Economics and Computation (EC) · doi:10.1145/3465456.3467643 · Cited by 17
Excited random walk with periodic cookies
Kozma, G., Orenshtein, T., & Shinkar, I. (2016) · Annales de l Institut Henri Poincaré Probabilités et Statistiques · doi:10.1214/15-aihp669 · Cited by 17
Improved Analysis of Deterministic Load-Balancing Schemes
Berenbrink, P., Klasing, R., Kosowski, A., Mallmann-Trenn, F., & Uznański, P. (2015) · ACM Symposium on Principles of Distributed Computing (PODC) · doi:10.1145/2767386.2767413 · Cited by 17
Manhart, M., Haldane, A., & Morozov, A. V. (2012) · Theoretical Population Biology · doi:10.1016/j.tpb.2012.03.007 · Cited by 17
Mixing and cut-off in cycle walks
Hough, R. D. (2017) · Electronic Journal of Probability · doi:10.1214/17-ejp108 · Cited by 17
Maltsev, A., Maltsev, V. A., & Stern, M. D. (2017) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1701409114 · Cited by 17
On structural properties of MDPs that bound loss due to shallow planning
Jiang, N., Singh, S. P., & Tewari, A. (2016) · International Joint Conference on Artificial Intelligence · Cited by 17
Time to Extinction for the SIS Epidemic Model: New Bounds on the Tail Probabilities
Fagnani, F., & Zino, L. (2017) · IEEE Transactions on Network Science and Engineering · doi:10.1109/tnse.2017.2772320 · Cited by 17
Spectral Gap Critical Exponent for Glauber Dynamics of Hierarchical Spin Models
Bauerschmidt, R., & Bodineau, T. (2019) · Communications in Mathematical Physics · doi:10.1007/s00220-019-03553-x · Cited by 17
Mixing of passive tracers at the ocean surface and its implications for plastic transport modelling
Wichmann, D., Delandmeter, P., Dijkstra, H. A., & van Sebille, E. (2019) · Environmental Research Communications · doi:10.1088/2515-7620/ab4e77 · Cited by 17
POMDP Planning Under Object Composition Uncertainty: Application to Robotic Manipulation
Pajarinen, J., Lundell, J., & Kyrki, V. (2022) · IEEE Transactions on Robotics · doi:10.1109/tro.2022.3188168 · Cited by 17
A technical report on hitting times, mixing and cutoff
Hermon, J. (2018) · Latin American Journal of Probability and Mathematical Statistics · doi:10.30757/alea.v15-05 · Cited by 17
Random Walks on Directed Networks: Inference and Respondent-Driven Sampling
Malmros, J., Masuda, N., & Britton, T. (2016) · Journal of Official Statistics · doi:10.1515/jos-2016-0023 · Cited by 17
Local Statistics of Realizable Vertex Models
Li, Z. (2011) · Communications in Mathematical Physics · doi:10.1007/s00220-011-1240-y · Cited by 17
Saad, R., Wallerman, J., & Lämås, T. (2014) · Scandinavian Journal of Forest Research · doi:10.1080/02827581.2014.978888 · Cited by 17
Genealogy of a Wright-Fisher Model with Strong SeedBank Component
Blath, J., Eldon, B., Casanova, A. G., & Kurt, N. (2015) · Progress in probability · doi:10.1007/978-3-319-13984-5_4 · Cited by 17
Tracking the conductance of rapidly evolving topic-subgraphs
Galhotra, S., Bagchi, A., Bedathur, S., Ramanath, M., & Jain, V. (2015) · Proceedings of the VLDB Endowment · doi:10.14778/2831360.2831370 · Cited by 17
On sensitivity of uniform mixing times
Hermon, J. (2018) · Annales de l Institut Henri Poincaré Probabilités et Statistiques · doi:10.1214/16-aihp802 · Cited by 17
Random spanning forests, Markov matrix spectra and well distributed pointsPreprint
Avena, L., & Gaudillière, A. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1310.1723 · Cited by 17
Consistently Estimating Markov Chains with Noisy Aggregate DataPreprint
Bernstein, G., & Sheldon, D. R. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1604.04182 · Cited by 17
Bacon, P. (2014) · eScholarship@McGill (McGill) · doi:10.82308/36790 · Cited by 17
Recovery and Rigidity in a Regular Stochastic Block ModelPreprint
Brito, G., Dumitriu, I., Ganguly, S., Hoffman, C., & Tran, L. V. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1507.00930 · Cited by 17
Sampling Balanced Forests of Grids in Polynomial Time
Cannon, S., Pegden, W., & Tucker-Foltz, J. (2024) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/3618260.3649699 · Cited by 16
Hack’s law in a drainage network model: A Brownian web approach
Roy, R., Saha, K., & Sarkar, A. (2016) · The Annals of Applied Probability · doi:10.1214/15-aap1134 · Cited by 16
Markov chain Monte Carlo algorithms for lattice Gaussian sampling
Wang, Z., Ling, C., & Hanrot, G. (2014) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2014.6875081 · Cited by 16
Discordant Voting Processes on Finite Graphs
Cooper, C., Dyer, M., FRIEZE, A. M., & Rivera, N. (2018) · SIAM Journal on Discrete Mathematics · doi:10.1137/16m1105979 · Cited by 16
A high-order Markov chain based scheduling algorithm for low delay in CSMA networks
Kwak, J., Lee, C.-H., & Eun, D. Y. (2014) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infocom.2014.6848103 · Cited by 16
Entropy production in nonlinear recombination models
Caputo, P., & Sinclair, A. (2018) · Bernoulli · doi:10.3150/17-bej959 · Cited by 16
Tunneling of the hard‐core model on finite triangular lattices
Zocca, A. (2018) · Random Structures and Algorithms · doi:10.1002/rsa.20795 · Cited by 16
Poincaré and logarithmic Sobolev constants for metastable Markov chains via capacitary inequalities
Schlichting, A., & Slowik, M. (2019) · The Annals of Applied Probability · doi:10.1214/19-aap1484 · Cited by 16
Counting Hamilton cycles in Dirac hypergraphs
Glock, S., Gould, S., Joos, F., Kühn, D., & Osthus, D. (2020) · Combinatorics Probability Computing · doi:10.1017/s0963548320000619 · Cited by 16
On Singularity Properties of Word Maps and Applications to Probabilistic Waring Type Problems
Glazer, I., & Hendel, Y. I. (2024) · Memoirs of the American Mathematical Society · doi:10.1090/memo/1497 · Cited by 16
Invariant measure of a stochastic food-limited population model with regime switching
Li, D., & Liu, M. (2020) · Mathematics and Computers in Simulation · doi:10.1016/j.matcom.2020.06.003 · Cited by 16
Reflection on modern methods: good practices for applied statistical learning in epidemiology
Nunez, Y., Gibson, E. A., Tanner, E. M., Gennings, C., Coull, B. A., Goldsmith, J., & Kioumourtzoglou, M. (2020) · International Journal of Epidemiology · doi:10.1093/ije/dyaa259 · Cited by 16
Refined universality for critical KCM: lower bounds
Hartarsky, I., & Marêché, L. (2022) · Combinatorics Probability Computing · doi:10.1017/s0963548322000025 · Cited by 16
A Spectral Independence View on Hard Spheres via Block Dynamics
Friedrich, T., Göbel, A., Krejca, M. S., & Pappik, M. (2022) · SIAM Journal on Discrete Mathematics · doi:10.1137/21m143697x · Cited by 16
Efficient Approximation Algorithms for Spanning Centrality
Zhang, S., Yang, R., Tang, J., Xiao, X., & Tang, B. (2023) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/3580305.3599323 · Cited by 16
Improved estimation of relaxation time in nonreversible Markov chains
Wolfer, G., & Kontorovich, A. (2024) · The Annals of Applied Probability · doi:10.1214/23-aap1963 · Cited by 16
Geometric aspects of data-processing of Markov chains
Wolfer, G., & Watanabe, S. (2024) · Transactions of Mathematics and Its Applications · doi:10.1093/imatrm/tnae001 · Cited by 16
Mendat, D. R., Chin, S., Furber, S. B., & Andreou, A. G. (2015) · Conference on Information Sciences and Systems · doi:10.1109/ciss.2015.7086903 · Cited by 16
Multivariate juggling probabilities
Ayyer, A., Bouttier, J., Corteel, S., & Nunzi, F. (2015) · Electronic Journal of Probability · doi:10.1214/ejp.v20-3495 · Cited by 16
Connault, B. (2014) · Cited by 16
Liénard, J., & Strigul, N. S. (2016) · Journal of Ecology · doi:10.1111/1365-2745.12540 · Cited by 16
Occupancy modelling in shared spaces of buildings: a queueing approach
Jia, R., & Spanos, C. J. (2016) · Journal of Building Performance Simulation · doi:10.1080/19401493.2016.1267802 · Cited by 16
The Geometric Meaning of Curvature: Local and Nonlocal Aspects of Ricci Curvature
Bauer, F., Hua, B., Jost, J., Liu, S., & Wang, G. (2017) · Lecture notes in mathematics · doi:10.1007/978-3-319-58002-9_1 · Cited by 16
Rapid mixing of the switch Markov chain for strongly stable degree sequences
Amanatidis, G., & Kleer, P. (2020) · Random Structures and Algorithms · doi:10.1002/rsa.20949 · Cited by 16
Large Deviations Properties of Maximum Entropy Markov Chains from Spike Trains
Cofré, R., Maldonado, C., & Rosas, F. E. (2018) · Entropy · doi:10.3390/e20080573 · Cited by 16
Cutoff for the Bernoulli–Laplace urn model with $o(n)$ swaps
Eskenazis, A., & Nestoridi, E. (2020) · Annales de l Institut Henri Poincaré Probabilités et Statistiques · doi:10.1214/20-aihp1052 · Cited by 16
Cutoff for the mean-field zero-range process with bounded monotone rates
Hermon, J., & Salez, J. (2020) · The Annals of Probability · doi:10.1214/19-aop1373 · Cited by 16
Hitting times, commute times, and cover times for random walks on random hypergraphs
Helali, A., & Löwe, M. (2019) · Statistics & Probability Letters · doi:10.1016/j.spl.2019.06.011 · Cited by 16
Markov Chain Monte Carlo Methods for Lattice Gaussian Sampling: Convergence Analysis and Enhancement
Wang, Z. (2019) · IEEE Transactions on Communications · doi:10.1109/tcomm.2019.2926470 · Cited by 16
Sharp Poincaré and log-Sobolev inequalities for the switch chain on regular bipartite graphs
Tikhomirov, K. E., & Youssef, P. (2022) · Probability Theory and Related Fields · doi:10.1007/s00440-022-01172-7 · Cited by 16
Barrera, G., Högele, M. A., & Pardo, J. C. (2021) · Electronic Journal of Probability · doi:10.1214/21-ejp685 · Cited by 16
Cayley Graphs on the Symmetric Group Generated by Initial Reversals have Unit Spectral Gap
Cesi, F. (2009) · The Electronic Journal of Combinatorics · doi:10.37236/267 · Cited by 16
An Abramov formula for stationary spaces of discrete groups
Hartman, Y., Lima, Y., & Tamuz, O. (2013) · Ergodic Theory and Dynamical Systems · doi:10.1017/etds.2012.167 · Cited by 16
Critical window for the vacant set left by random walk on random regular graphs
Černý, J., & Teixeira, A. (2012) · Random Structures and Algorithms · doi:10.1002/rsa.20425 · Cited by 16
A particle system with cooperative branching and coalescence
Sturm, A., & Swart, J. M. (2015) · The Annals of Applied Probability · doi:10.1214/14-aap1032 · Cited by 16
Coalescing-Branching Random Walks on Graphs
Dutta, C., Pandurangan, G., Rajaraman, R., & Roche, S. T. (2015) · ACM Transactions on Parallel Computing · doi:10.1145/2817830 · Cited by 16
Distributed Large Independent Sets in One Round on Bounded-Independence Graphs
Halldórsson, M. M., & Konrad, C. (2015) · Lecture notes in computer science · doi:10.1007/978-3-662-48653-5_37 · Cited by 16
Improved bounds on the epidemic threshold of exact SIS models on complex networks
Azizan, N., Thrampoulidis, C., & Hassibi, B. (2016) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2016.7798804 · Cited by 16
Decentralized Dynamics for Finite Opinion Games
Ferraioli, D., Goldberg, P. W., & Ventre, C. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-33996-7_13 · Cited by 16
Deterministic Random Walks for Rapidly Mixing Chains
Shiraga, T., Yamauchi, Y., Kijima, S., & Yamashita, M. (2018) · SIAM Journal on Discrete Mathematics · doi:10.1137/16m1087667 · Cited by 16
Aldous, D. (2016) · Latin American Journal of Probability and Mathematical Statistics · doi:10.30757/alea.v13-35 · Cited by 16
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.