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
Trust region policy optimization
Schulman, J., Levine, S., Moritz, P., Jordan, M. I., & Abbeel, P. (2015) · arXiv · doi:10.48550/arxiv.1502.05477 · Cited by 4,578
Systemic Risk and Stability in Financial Networks
Acemoglu, D., Ozdaglar, A., & Tahbaz-Salehi, A. (2015) · American Economic Review · doi:10.1257/aer.20130456 · Cited by 1,943
Achieving Geometric Convergence for Distributed Optimization Over Time-Varying Graphs
Nedić, A., Olshevsky, A., & Shi, W. (2017) · SIAM Journal on Optimization · doi:10.1137/16m1084316 · Cited by 1,069
Holographic quantum error-correcting codes: toy models for the bulk/boundary correspondence
Pastawski, F., Yoshida, B., Harlow, D., & Preskill, J. (2015) · Journal of High Energy Physics · doi:10.1007/jhep06(2015)149 · Cited by 958
Dual Averaging for Distributed Optimization: Convergence Analysis and Network Scaling
Duchi, J. C., Agarwal, A., & Wainwright, M. J. (2012) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2011.2161027 · Cited by 947
Random walks and diffusion on networks
Masuda, N., Porter, M. A., & Lambiotte, R. (2017) · Physics Reports · doi:10.1016/j.physrep.2017.07.007 · Cited by 657
Network Topology and Communication-Computation Tradeoffs in Decentralized Optimization
Nedic, A., Olshevsky, A., & Rabbat, M. G. (2018) · Proceedings of the IEEE · doi:10.1109/jproc.2018.2817461 · Cited by 534
Stochastic Gradient Hamiltonian Monte Carlo
Chen, T., Fox, E. B., & Guestrin, C. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1402.4102 · Cited by 434
Concentration inequalities for Markov chains by Marton couplings and spectral methods
Paulin, D. (2015) · Electronic Journal of Probability · doi:10.1214/ejp.v20-4039 · Cited by 380
Opinion Fluctuations and Disagreement in Social Networks
Acemoğlu, D., Como, G., Fagnani, F., & Ozdaglar, A. (2013) · Mathematics of Operations Research · doi:10.1287/moor.1120.0570 · Cited by 371
Estimating and sampling graphs with multidimensional random walks
Ribeiro, B., & Towsley, D. (2010) · Proceedings of the 10th ACM SIGCOMM conference on Internet measurement · doi:10.1145/1879141.1879192 · Cited by 341
Quantum speedup of Monte Carlo methods
Montanaro, A. (2015) · Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences · doi:10.1098/rspa.2015.0301 · Cited by 334
Binary Opinion Dynamics with Stubborn Agents
Yildiz, E., Ozdaglar, A., Acemoglu, D., Saberi, A., & Scaglione, A. (2013) · ACM Transactions on Economics and Computation · doi:10.1145/2538508 · Cited by 321
Harrow, A. W., & Mehraban, S. A. (2023) · Communications in Mathematical Physics · doi:10.1007/s00220-023-04675-z · Cited by 251
Configuring Random Graph Models with Fixed Degree Sequences
Fosdick, B. K., Larremore, D. B., Nishimura, J., & Ugander, J. (2018) · SIAM Review · doi:10.1137/16m1087175 · Cited by 246
Inferring clonal evolution of tumors from single nucleotide somatic mutations
Jiao, W., Vembu, S., Deshwar, A. G., Stein, L., & Morris, Q. (2014) · BMC Bioinformatics · doi:10.1186/1471-2105-15-35 · Cited by 236
Limitations of optimization algorithms on noisy quantum devices
Stilck França, D., & García-Patrón, R. (2021) · Nature Physics · doi:10.1038/s41567-021-01356-3 · Cited by 232
Incremental knowledge base construction using DeepDive
Shin, J., Wu, S., Wang, F., De Sa, C., Zhang, C., & Ré, C. (2015) · Proceedings of the VLDB Endowment · doi:10.14778/2809974.2809991 · Cited by 232
Quantum Gibbs Samplers: The Commuting Case
Kastoryano, M. J., & Brandão, F. G. S. L. (2016) · Communications in Mathematical Physics · doi:10.1007/s00220-016-2641-8 · Cited by 219
Guo, D., Tang, L., Zhang, X., & Liang, Y.-C. (2020) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2020.3020400 · Cited by 213
Exposure to unpredictable maternal sensory signals influences cognitive development across species
Davis, E. P., Stout, S. A., Molet, J., Vegetabile, B., Glynn, L. M., Sandman, C. A., Heins, K., Stern, H., & Baram, T. Z. (2017) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1703444114 · Cited by 210
Bayesian computation: a summary of the current state, and samples backwards and forwards
Green, P. J., Łatuszyński, K., Pereyra, M., & Robert, C. P. (2015) · Statistics and Computing · doi:10.1007/s11222-015-9574-5 · Cited by 199
Reinforcement learning algorithm for non-stationary environments
Padakandla, S., J., P. K., & Bhatnagar, S. (2020) · Applied Intelligence · doi:10.1007/s10489-020-01758-5 · Cited by 198
Markov Approximation for Combinatorial Network Optimization
Chen, M., Liew, S. C., Shao, Z., & Kai, C. (2013) · IEEE Transactions on Information Theory · doi:10.1109/tit.2013.2268923 · Cited by 197
Targeting Interventions in Networks
Galeotti, A., Golub, B., & Goyal, S. (2020) · Econometrica · doi:10.3982/ecta16173 · Cited by 182
Experimentally generated randomness certified by the impossibility of superluminal signals
Bierhorst, P., Knill, E., Glancy, S., Zhang, Y., Mink, A., Jordan, S., Rommal, A., Liu, Y.-K., Christensen, B., Nam, S. W., et al. (2018) · Nature · doi:10.1038/s41586-018-0019-0 · Cited by 181
Strong Data Processing Inequalities and $\Phi $ -Sobolev Inequalities for Discrete Channels
Raginsky, M. (2016) · IEEE Transactions on Information Theory · doi:10.1109/tit.2016.2549542 · Cited by 181
Bounding quantum gate error rate based on reported average fidelity
Sanders, Y. R., Wallman, J. J., & Sanders, B. C. (2015) · New Journal of Physics · doi:10.1088/1367-2630/18/1/012002 · Cited by 180
Pufferfish Privacy Mechanisms for Correlated Data
Song, S., Wang, Y., & Chaudhuri, K. (2017) · ACM SIGMOD International Conference on Management of Data (SIGMOD) · doi:10.1145/3035918.3064025 · Cited by 175
Informed Proposals for Local MCMC in Discrete Spaces
Zanella, G. (2019) · Journal of the American Statistical Association · doi:10.1080/01621459.2019.1585255 · Cited by 175
Speed limits and locality in many-body quantum dynamics
Chen, C.-F., Lucas, A., & Yin, C. (2023) · Reports on Progress in Physics · doi:10.1088/1361-6633/acfaae · Cited by 173
The $\chi ^2$χ2-divergence and mixing times of quantum Markov processes
Temme, K., Kastoryano, M. J., Ruskai, M. B., Wolf, M. M., & Verstraete, F. (2010) · Journal of Mathematical Physics · doi:10.1063/1.3511335 · Cited by 172
Thickness and Information in Dynamic Matching Markets
Akbarpour, M., Li, S., & Gharan, S. O. (2020) · Journal of Political Economy · doi:10.1086/704761 · Cited by 171
Sampling from a Log-Concave Distribution with Projected Langevin Monte Carlo
Bubeck, S., Eldan, R., & Lehec, J. (2018) · Discrete & Computational Geometry · doi:10.1007/s00454-018-9992-1 · Cited by 171
Liouvillian Skin Effect: Slowing Down of Relaxation Processes without Gap Closing
Haga, T., Nakagawa, M., Hamazaki, R., & Ueda, M. (2021) · Physical Review Letters · doi:10.1103/physrevlett.127.070402 · Cited by 170
Global Convergence of Langevin Dynamics Based Algorithms for Nonconvex OptimizationPreprint
Xu, P., Chen, J., Zou, D., & Gu, Q. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1707.06618 · Cited by 169
Proof of Aldous’ spectral gap conjecture
Caputo, P., Liggett, T. M., & Richthammer, T. (2010) · Journal of the American Mathematical Society · doi:10.1090/s0894-0347-10-00659-4 · Cited by 167
Finding sparse cuts locally using evolving sets
Andersen, R., & Peres, Y. (2009) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/1536414.1536449 · Cited by 162
Self-citationFaster Algorithms via Approximation Theory
Sachdeva, S., & Vishnoi, N. K. (2014) · Foundations and Trends® in Theoretical Computer Science · doi:10.1561/0400000065 · Cited by 159
Curvature, concentration and error estimates for Markov chain Monte Carlo
Joulin, A., & Ollivier, Y. (2010) · The Annals of Probability · doi:10.1214/10-aop541 · Cited by 159
Fast and accurate inference of Plackett-Luce models
Maystre, L., & Grossglauser, M. (2015) · Infoscience (Ecole Polytechnique Fédérale de Lausanne) · Cited by 157
Convergence analysis of distributed stochastic gradient descent with shuffling
Meng, Q., Chen, W., Wang, Y., Ma, Z.-M., & Liu, T. (2019) · Neurocomputing · doi:10.1016/j.neucom.2019.01.037 · Cited by 154
Shepero, M., & Munkhammar, J. (2018) · Applied Energy · doi:10.1016/j.apenergy.2018.09.175 · Cited by 150
Clark, A., Bushnell, L. G., & Poovendran, R. (2013) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2013.2281473 · Cited by 148
Hitting and commute times in large random neighborhood graphs
von Luxburg, U., Radl, A., & Hein, M. (2014) · Journal of Machine Learning Research · doi:10.5555/2627435.2638591 · Cited by 145
Improved analysis of higher order random walks and applications
Alev, V. L., & Lau, L. C. (2020) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/3357713.3384317 · Cited by 144
Plausible deniability for privacy-preserving data synthesis
Bindschaedler, V., Shokri, R., & Gunter, C. A. (2017) · Proceedings of the VLDB Endowment · doi:10.14778/3055540.3055542 · Cited by 143
PLATO: Policy learning using adaptive trajectory optimization
Kahn, G., Zhang, T., Levine, S., & Abbeel, P. (2017) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/icra.2017.7989379 · Cited by 143
Glauber dynamics for the mean-field Ising model: cut-off, critical power law, and metastability
Levin, D., Luczak, M., & Peres, Y. (2008) · Probability Theory and Related Fields · doi:10.1007/s00440-008-0189-z · Cited by 143
Self-citationDiffusion on networked systems is a question of time or structure
Delvenne, J.-C., Lambiotte, R., & Rocha, L. E. C. (2015) · Nature Communications · doi:10.1038/ncomms8366 · Cited by 141
Cover times, blanket times, and majorizing measures
Ding, J., Lee, J., & Peres, Y. (2012) · Annals of Mathematics · doi:10.4007/annals.2012.175.3.8 · Cited by 140
Self-citationLee, C.-H., Xu, X., & Eun, D. Y. (2012) · ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems (SIGMETRICS) · doi:10.1145/2254756.2254795 · Cited by 139
Analyzing concept drift and shift from sample data
Webb, G. I., Lee, L. K., Goethals, B., & Petitjean, F. (2018) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-018-0554-1 · Cited by 138
Analysis, Prediction, and Control of Epidemics: A Survey from Scalar to Dynamic Network Models
Zino, L., & Cao, M. (2021) · IEEE Circuits and Systems Magazine · doi:10.1109/mcas.2021.3118100 · Cited by 138
Golub, B., & Sadler, E. D. (2016) · Oxford University Press eBooks · doi:10.1093/oxfordhb/9780199948277.013.12 · Cited by 138
Occupancy Grid Models for Robot Mapping in Changing Environments
Meyer-Delius, D., Beinhofer, M., & Burgard, W. (2021) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v26i1.8377 · Cited by 136
Anari, N., Gharan, S. O., & Rezaei, A. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1602.05242 · Cited by 135
Non-reversible Metropolis-Hastings
Bierkens, J. (2015) · Statistics and Computing · doi:10.1007/s11222-015-9598-x · Cited by 133
A spectral condition for spectral gap: fast mixing in high-temperature Ising models
Eldan, R., Koehler, F., & Zeitouni, O. (2021) · Probability Theory and Related Fields · doi:10.1007/s00440-021-01085-x · Cited by 130
Distributed Detection: Finite-Time Analysis and Impact of Network Topology
Shahrampour, S., Rakhlin, A., & Jadbabaie, A. (2015) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2015.2506903 · Cited by 130
High-dimensional structure estimation in Ising models: Local separation criterion
Anandkumar, A., Tan, V. Y. F., Huang, F., & Willsky, A. S. (2012) · The Annals of Statistics · doi:10.1214/12-aos1009 · Cited by 129
Provable Self-Representation Based Outlier Detection in a Union of Subspaces
You, C., Robinson, D. P., & Vidal, R. (2017) · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · doi:10.1109/cvpr.2017.460 · Cited by 127
Discrete Opinion Dynamics with Stubborn AgentsPreprint
Yildiz, E., Acemoğlu, D., Ozdaglar, A., Saberi, A., & Scaglione, A. (2011) · SSRN Electronic Journal · doi:10.2139/ssrn.1744113 · Cited by 127
Left and right convergence of graphs with bounded degree
Borgs, C., Chayes, J., Kahn, J., & Lovász, L. (2012) · Random Structures and Algorithms · doi:10.1002/rsa.20414 · Cited by 124
Lectures on Random Lozenge Tilings
Gorin, V. (2021) · Cambridge University Press eBooks · doi:10.1017/9781108921183 · Cited by 122
Exact thresholds for Ising–Gibbs samplers on general graphs
Mossel, E., & Sly, A. (2013) · The Annals of Probability · doi:10.1214/11-aop737 · Cited by 120
Estimating clustering coefficients and size of social networks via random walk
Hardiman, S. J., & Katzir, L. (2013) · International World Wide Web Conference (WWW) · doi:10.1145/2488388.2488436 · Cited by 119
Stability of Local Quantum Dissipative Systems
Cubitt, T. S., Lucia, Á., Michalakis, S., & Perez-Garcia, D. (2015) · Communications in Mathematical Physics · doi:10.1007/s00220-015-2355-3 · Cited by 119
Defending Against Advanced Persistent Threats Using Game-Theory
Raß, S., König, S., & Schauer, S. (2017) · PLoS ONE · doi:10.1371/journal.pone.0168675 · Cited by 119
Lifelong localization in changing environments
Tipaldi, G. D., Meyer-Delius, D., & Burgard, W. (2013) · The International Journal of Robotics Research · doi:10.1177/0278364913502830 · Cited by 117
Absence of Disorder-Driven Metal-Insulator Transitions in Simple Holographic Models
Grozdanov, S., Lucas, A., Sachdev, S., & Schalm, K. (2015) · Physical Review Letters · doi:10.1103/physrevlett.115.221601 · Cited by 117
Quantum Walks Can Find a Marked Element on Any Graph
Krovi, H., Magniez, F., Ozols, M., & Roland, J. (2015) · Algorithmica · doi:10.1007/s00453-015-9979-8 · Cited by 114
How small are small mutation rates?
Wu, B., Gokhale, C. S., Wang, L., & Traulsen, A. (2011) · Journal of Mathematical Biology · doi:10.1007/s00285-011-0430-8 · Cited by 114
How to Encipher Messages on a Small Domain
Morris, B., Rogaway, P., & Stegers, T. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-03356-8_17 · Cited by 111
Assessing significance in a Markov chain without mixing
Chikina, M. D., FRIEZE, A. M., & Pegden, W. (2017) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1617540114 · Cited by 111
Mixing time and cutoff for the adjacent transposition shuffle and the simple exclusion
Lacoin, H. (2016) · The Annals of Probability · doi:10.1214/15-aop1004 · Cited by 110
Pecevski, D., Buesing, L., & Maass, W. (2011) · PLoS Computational Biology · doi:10.1371/journal.pcbi.1002294 · Cited by 109
Cloud K-SVD: A Collaborative Dictionary Learning Algorithm for Big, Distributed Data
Raja, H., & Bajwa, W. U. (2015) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2015.2472372 · Cited by 109
Mossel, E., & Tamuz, O. (2017) · Probability Surveys · doi:10.1214/14-ps230 · Cited by 109
Partitioning Well-Clustered Graphs: Spectral Clustering Works!
Peng, R., Sun, H., & Zanetti, L. (2017) · SIAM Journal on Computing · doi:10.1137/15m1047209 · Cited by 109
Rapid Adiabatic Preparation of Injective Projected Entangled Pair States and Gibbs States
Ge, Y., Molnár, A., & Cirac, J. I. (2016) · Physical Review Letters · doi:10.1103/physrevlett.116.080503 · Cited by 108
Randomly Coloring Constant Degree Graphs
Dyer, M., FRIEZE, A. M., Hayes, T. P., & Vigoda, E. (2004) · Random Structures and Algorithms · doi:10.1002/rsa.20451 · Cited by 108
Flooding Time of Edge-Markovian Evolving Graphs
Clementi, A. E. F., Macci, C., Monti, A., Pasquale, F., & Silvestri, R. (2010) · SIAM Journal on Discrete Mathematics · doi:10.1137/090756053 · Cited by 108
Daskalakis, C., Dikkala, N., & Kamath, G. (2018) · IEEE Transactions on Information Theory · doi:10.1109/tit.2019.2932255 · Cited by 107
Ergodicity of the zigzag process
Bierkens, J., Roberts, G. O., & Zitt, P.-A. (2019) · The Annals of Applied Probability · doi:10.1214/18-aap1453 · Cited by 107
Explicit error bounds for Markov chain Monte Carlo
Rudolf, D. (2012) · Dissertationes Mathematicae · doi:10.4064/dm485-0-1 · Cited by 107
Extrapolating Weak Selection in Evolutionary Games
Wu, B., García, J., Hauert, C., & Traulsen, A. (2013) · PLoS Computational Biology · doi:10.1371/journal.pcbi.1003381 · Cited by 107
Kobayashi, H., Mark, B. L., & Turin, W. (2012) · CERN Document Server (European Organization for Nuclear Research) · Cited by 106
Bindeman, I. N., & Simakin, A. G. (2014) · Geosphere · doi:10.1130/ges00969.1 · Cited by 106
Thompson Sampling for Learning Parameterized Markov Decision ProcessesPreprint
Gopalan, A., & Mannor, S. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1406.7498 · Cited by 105
Distributed Policy Evaluation Under Multiple Behavior Strategies
Macua, S. V., Chen, J., Zazo, S., & Sayed, A. H. (2014) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2014.2368731 · Cited by 104
An Efficient Curing Policy for Epidemics on Graphs
Drakopoulos, K., Ozdaglar, A., & Tsitsiklis, J. N. (2014) · IEEE Transactions on Network Science and Engineering · doi:10.1109/tnse.2015.2393291 · Cited by 104
Mixing Times are Hitting Times of Large Sets
Peres, Y., & Sousi, P. (2013) · Journal of Theoretical Probability · doi:10.1007/s10959-013-0497-9 · Cited by 104
Self-citationRapid Mixing of Hamiltonian Monte Carlo on Strongly Log-Concave DistributionsPreprint
Mangoubi, O., & Smith, A. D. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1708.07114 · Cited by 104
Coalescing Random Walks and Voting on Connected Graphs
Cooper, C., Elsässer⋆, R., Ono, H., & Radzik, T. (2013) · SIAM Journal on Discrete Mathematics · doi:10.1137/120900368 · Cited by 103
On Communication and Collusion
Awaya, Y., & Krishna, V. (2016) · American Economic Review · doi:10.1257/aer.20141469 · Cited by 100
Stabilizing Consensus with Many Opinions
Becchetti, L., Clementi, A. E. F., Natale, E., Pasquale, F., & Trevisan, L. (2015) · ACM-SIAM Symposium on Discrete Algorithms (SODA) · doi:10.1137/1.9781611974331.ch46 · Cited by 99
Agent based models and opinion dynamics as Markov chains
Banisch, S., Lima, R., & de Araújo, T. V. (2012) · Social Networks · doi:10.1016/j.socnet.2012.06.001 · Cited by 98
Vuković, O., & Dán, G. (2014) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2014.2332106 · Cited by 98
Streaming algorithms for embedding and computing edit distance in the low distance regime
Chakraborty, D., Goldenberg, E., & Koucký, M. (2016) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/2897518.2897577 · Cited by 98
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.