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 401–500 of 1,000
MVCom: Scheduling Most Valuable Committees for the Large-Scale Sharded Blockchain
Huang, H., Huang, Z., Peng, X., Zheng, Z., & Guo, S. (2021) · IEEE International Conference on Distributed Computing Systems (ICDCS) · doi:10.1109/icdcs51616.2021.00066 · Cited by 37
SWIFTULTRAVIOLET/OPTICAL TELESCOPE IMAGING OF STAR-FORMING REGIONS IN M81 AND HOLMBERG IX
Hoversten, E. A., Gronwall, C. A., Berk, D. E. V., Basu-Zych, A. R., Breeveld, A. A., Brown, P. J., Kuin, N. P. M., Page, M. J., Roming, P. W. A., & Siegel, M. H. (2011) · The Astronomical Journal · doi:10.1088/0004-6256/141/6/205 · Cited by 37
Bonato, A., Janssen, J., & Prałat, P. (2012) · Internet Mathematics · doi:10.1080/15427951.2012.625246 · Cited by 37
Degree Fluctuations and the Convergence Time of Consensus Algorithms
Olshevsky, A., & Tsitsiklis, J. N. (2013) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2013.2257969 · Cited by 37
Convergence Rates of Accelerated Markov Gradient Descent with Applications in Reinforcement LearningPreprint
Doan, T. T., Nguyen, L. M., Pham, N. H., & Romberg, J. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2002.02873 · Cited by 37
Complexity and Geometry of Sampling Connected Graph PartitionsPreprint
Najt, E., DeFord, D., & Solomon, J. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1908.08881 · Cited by 37
On the Switch Markov Chain for Perfect Matchings
Dyer, M., Jerrum, M., & Müller, H. (2017) · Journal of the ACM · doi:10.1145/2822322 · Cited by 36
Variance and Covariance of Distributions on Graphs
Devriendt, K., Martín-Gutíerrez, S., & Lambiotte, R. (2022) · SIAM Review · doi:10.1137/20m1361328 · Cited by 36
Sampling constraint satisfaction solutions in the local lemma regime
Feng, W., He, K., & Yin, Y. (2021) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/3406325.3451101 · Cited by 36
Collider events on a quantum computer
Gustafson, G., Prestel, S., Spannowsky, M., & Williams, S. (2022) · Journal of High Energy Physics · doi:10.1007/jhep11(2022)035 · Cited by 36
Coalescing random walks and voting on graphs
Cooper, C., Elsässer⋆, R., Ono, H., & Radzik, T. (2012) · ACM Symposium on Principles of Distributed Computing (PODC) · doi:10.1145/2332432.2332440 · Cited by 36
Parallel rotor walks on finite graphs and applications in discrete load balancing
Akbari, H., & Berenbrink, P. (2013) · ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) · doi:10.1145/2486159.2486178 · Cited by 36
Almost Optimal Local Graph Clustering Using Evolving Sets
Andersen, R., Gharan, S. O., Peres, Y., & Trevisan, L. (2016) · Journal of the ACM · doi:10.1145/2856030 · Cited by 36
Self-citationHeterogeneous continuous-time random walks
Grebenkov, D. S., & Tupikina, L. (2018) · Physical review. E · doi:10.1103/physreve.97.012148 · Cited by 36
4. On the power of random information
Hinrichs, A., Krieg, D., Novak, E., Prochno, J., & Ullrich, M. (2020) · De Gruyter eBooks · doi:10.1515/9783110635461-004 · Cited by 36
{Efficient Second-Order Gradient Boosting for Conditional Random Fields}
Chen, T., Singh, S., Taskar, B., & Guestrin, C. (2015) · International Conference on Artificial Intelligence and Statistics · Cited by 36
Ethical Artificial IntelligencePreprint
Hibbard, B. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1411.1373 · Cited by 36
Testing Closeness With Unequal Sized SamplesPreprint
Bhattacharya, B. B., & Valiant, G. J. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1504.04599 · Cited by 36
On Computation and Generalization of Generative Adversarial Imitation LearningPreprint
Chen, M., Wang, Y., Liu, T., Yang, Z., Li, X., Wang, Z., & Zhao, T. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2001.02792 · Cited by 36
Does Zero-Shot Reinforcement Learning Exist?Preprint
Touati, A., Rapin, J., & Ollivier, Y. (2022) · arXiv (Cornell University) · doi:10.48550/arxiv.2209.14935 · Cited by 36
DifFUZZY: a fuzzy clustering algorithm for complex datasets
Cominetti, O., Matzavinos, A., Samarasinghe, S., Kulasiri, D., Liu, S., Maini, P. K., & Erban, R. (2010) · International Journal of Computational Intelligence in Bioinformatics and Systems Biology · doi:10.1504/ijcibsb.2010.038222 · Cited by 35
Phase Transition of the 2-Choices Dynamics on Core-Periphery Networks
Cruciani, E., Natale, E., Nusser, A., & Scornavacca, G. (2018) · Adaptive Agents and Multi-Agents Systems · doi:10.65109/jdyc6164 · Cited by 35
Scaling limits of the three-dimensional uniform spanning tree and associated random walk
Angel, O., Croydon, D. A., Hernández-Torres, S., & Shiraishi, D. (2021) · The Annals of Probability · doi:10.1214/21-aop1523 · Cited by 35
Linear stability analysis of large dynamical systems on random directed graphs
Neri, I., & Metz, F. L. (2020) · Physical Review Research · doi:10.1103/physrevresearch.2.033313 · Cited by 35
Voting Rights, Markov Chains, and Optimization by Short Bursts
Cannon, S., Goldbloom-Helzner, A., Gupta, V., Matthews, J., & Suwal, B. (2023) · Methodology And Computing In Applied Probability · doi:10.1007/s11009-023-09994-1 · Cited by 35
Suppressors of fixation can increase average fitness beyond amplifiers of selection
Sharma, N., & Traulsen, A. (2022) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.2205424119 · Cited by 35
Dimension-Independent MCMC Sampling for Inverse Problems with Non-Gaussian Priors
Vollmer, S. J. (2015) · SIAM/ASA Journal on Uncertainty Quantification · doi:10.1137/130929904 · Cited by 35
Metastability in a condensing zero-range process in the thermodynamic limit
Armendáriz, I., Großkinsky, S., & Loulakis, M. (2016) · Probability Theory and Related Fields · doi:10.1007/s00440-016-0728-y · Cited by 35
Martinelli, F., & Toninelli, F. L. (2009) · Communications in Mathematical Physics · doi:10.1007/s00220-009-0963-5 · Cited by 35
Solving inverse problem of Markov chain with partial observations
Morimura, T., Osogami, T., & Idé, T. (2013) · neural information processing systems · Cited by 35
Hitting Times for Random Walks with Restarts
Janson, S., & Peres, Y. (2012) · SIAM Journal on Discrete Mathematics · doi:10.1137/100796352 · Cited by 35
Self-citationFinite Sample Analysis of the GTD Policy Evaluation Algorithms in Markov SettingPreprint
Wang, Y., Chen, W., Liu, Y., Ma, Z.-M., & Liu, T. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1809.08926 · Cited by 35
Random Forests and Networks Analysis
Avena, L., Castell, F., Gaudillière, A., & Mélot, C. (2018) · Journal of Statistical Physics · doi:10.1007/s10955-018-2124-8 · Cited by 34
Nazi, A., Zhou, Z., Thirumuruganathan, S., Zhang, N., & Das, G. (2015) · Proceedings of the VLDB Endowment · doi:10.14778/2735703.2735707 · Cited by 34
The probability of long cycles in interchange processes
Alon, G., & Kozma, G. (2013) · Duke Mathematical Journal · doi:10.1215/00127094-2266018 · Cited by 34
Cutoff for General Spin Systems with Arbitrary Boundary Conditions
Lubetzky, E., & Sly, A. (2013) · Communications on Pure and Applied Mathematics · doi:10.1002/cpa.21489 · Cited by 34
Wavelet-based information filtering for fault diagnosis of electric drive systems in electric ships
Silva, A. A., Gupta, S., Bazzi, A. M., & Ulatowski, A. (2017) · ISA Transactions · doi:10.1016/j.isatra.2017.08.013 · Cited by 34
All-atom computations with irreversible Markov chains
Faulkner, M. F., Qin, L., Maggs, A. C., & Krauth, W. (2018) · The Journal of Chemical Physics · doi:10.1063/1.5036638 · Cited by 34
Sudholt, D. (2020) · Algorithmica · doi:10.1007/s00453-020-00671-0 · Cited by 34
Adaptive online extreme learning machine by regulating forgetting factor by concept drift map
Yu, H., & Webb, G. I. (2019) · Neurocomputing · doi:10.1016/j.neucom.2018.11.098 · Cited by 34
Logsmooth Gradient Concentration and Tighter Runtimes for Metropolized Hamiltonian Monte CarloPreprint
Lee, Y. T., Shen, R., & Tian, K. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2002.04121 · Cited by 34
Targeting Interventions in NetworksPreprint
Galeotti, A., Golub, B., & Goyal, S. (2017) · SSRN Electronic Journal · doi:10.2139/ssrn.3054353 · Cited by 34
Emerging Generalized Wireless MAC Communication Protocols via Abstraction
Miuccio, L., Riolo, S., Samarakoon, S., Bennis, M., & Panno, D. (2025) · IEEE Open Journal of the Communications Society · doi:10.1109/ojcoms.2025.3602870 · Cited by 33
Resistance-Based Performance Analysis of the Consensus Algorithm over Geometric Graphs
Lovisari, E., Garin, F., & Zampieri, S. (2013) · SIAM Journal on Control and Optimization · doi:10.1137/110857428 · Cited by 33
On Coalescence Time in Graphs: When Is Coalescing as Fast as Meeting?
Kanade, V., Mallmann-Trenn, F., & Sauerwald, T. (2023) · ACM Transactions on Algorithms · doi:10.1145/3576900 · Cited by 33
Random Walks on Dynamic Graphs: Mixing Times, Hitting Times, and Return Probabilities
Sauerwald, T., & Zanetti, L. (2019) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.17863/cam.41384 · Cited by 33
The Computational Complexity of Estimating MCMC Convergence Time
Bhatnagar, N., Bogdanov, A., & Mossel, E. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-22935-0_36 · Cited by 33
On the convergence of densities of finite voter models to the Wright–Fisher diffusion
Chen, Y.-T., Choi, J., & Cox, J. T. (2016) · Annales de l Institut Henri Poincaré Probabilités et Statistiques · doi:10.1214/14-aihp639 · Cited by 33
Hard-disk pressure computations—a historic perspective
Li, B., Nishikawa, Y., Höllmer, P., Carillo, L., Maggs, A. C., & Krauth, W. (2022) · The Journal of Chemical Physics · doi:10.1063/5.0126437 · Cited by 33
Quantum Algorithm for Estimating Volumes of Convex Bodies
Chakrabarti, S., Childs, A. M., Hung, S.-H., Li, T., Wang, C., & Wu, X. (2023) · ACM Transactions on Quantum Computing · doi:10.1145/3588579 · Cited by 33
Sharp Bounds on Random Walk Eigenvalues via Spectral Embedding
Lyons, R., & Gharan, S. O. (2017) · International Mathematics Research Notices · doi:10.1093/imrn/rnx082 · Cited by 33
Swendsen--Wang Is Faster than Single-Bond Dynamics
Ullrich, M. (2014) · SIAM Journal on Discrete Mathematics · doi:10.1137/120864003 · Cited by 33
From Glauber dynamics to Metropolis algorithm: Smaller delay in optimal CSMA
Lee, C.-H., Eun, D. Y., Yun, S.-Y., & Yi, Y. (2012) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2012.6284006 · Cited by 33
Borst, S. C., Markakis, M. G., & Saniee, I. (2013) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2013.2257181 · Cited by 33
Wedin, E., & Hegarty, P. V. (2015) · Discrete & Computational Geometry · doi:10.1007/s00454-014-9657-7 · Cited by 33
Exponentially slow mixing in the mean-field Swendsen-Wang dynamics
Gheissari, R., Lubetzky, E., & Peres, Y. (2018) · Annales de l Institut Henri Poincaré Probabilités et Statistiques · doi:10.1214/18-aihp955 · Cited by 33
Self-citationDistributed Data Access in Industrial Edge Networks
Raptis, T. P., Passarella, A., & Conti, M. (2020) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2020.2980917 · Cited by 33
Thermalisation for small random perturbations of dynamical systems
Barrera, G., & Jara, M. (2020) · The Annals of Applied Probability · doi:10.1214/19-aap1526 · Cited by 33
Polynomial-time classical sampling of high-temperature quantum Gibbs statesPreprint
Yin, C. N., & Lucas, A. (2023) · arXiv (Cornell University) · doi:10.48550/arxiv.2305.18514 · Cited by 33
Are lock-free concurrent algorithms practically wait-free?
Alistarh, D., Censor-Hillel, K., & Shavit, N. (2014) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/2591796.2591836 · Cited by 32
Joint Transmission and Energy Transfer Policies for Energy Harvesting Devices With Finite Batteries
Biason, A., & Zorzi, M. (2015) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2015.2481214 · Cited by 32
Censored Glauber Dynamics for the Mean Field Ising Model
Ding, J., Lubetzky, E., & Peres, Y. (2009) · Journal of Statistical Physics · doi:10.1007/s10955-009-9859-1 · Cited by 32
Self-citationScaling Laws for Consensus Protocols Subject to Noise
Jadbabaie, A., & Olshevsky, A. (2018) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2018.2863203 · Cited by 32
Hybrid models of opinion dynamics with opinion-dependent connectivity
Frasca, P., Tarbouriech, S., & Zaccarian, L. (2018) · Automatica · doi:10.1016/j.automatica.2018.11.017 · Cited by 32
Return random walks for link prediction
Curado, M. (2019) · Information Sciences · doi:10.1016/j.ins.2019.09.017 · Cited by 32
Best Fit Bin Packing with Random Order Revisited
Albers, S., Khan, A., & Ladewig, L. (2021) · Algorithmica · doi:10.1007/s00453-021-00844-5 · Cited by 32
Convergence to equilibrium of logit dynamics for strategic games
Auletta, V., Ferraioli, D., Pasquale, F., Penna, P., & Persiano, G. (2011) · ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) · doi:10.1145/1989493.1989522 · Cited by 32
Comparison of Swendsen‐Wang and heat‐bath dynamics
Ullrich, M. (2012) · Random Structures and Algorithms · doi:10.1002/rsa.20431 · Cited by 32
Performance metrics in the average consensus problem: A tutorial
Lovisari, E., & Zampieri, S. (2012) · Annual Reviews in Control · doi:10.1016/j.arcontrol.2012.03.003 · Cited by 32
Information symmetries in irreversible processes
Ellison, C. J., Mahoney, J. R., James, R. G., Crutchfield, J. P., & Reichardt, J. (2011) · Chaos An Interdisciplinary Journal of Nonlinear Science · doi:10.1063/1.3637490 · Cited by 32
Quenched scaling limits of trap models
Jara, M., Landim, C., & Teixeira, A. (2010) · The Annals of Probability · doi:10.1214/10-aop554 · Cited by 32
Mixing Times in Evolutionary Game Dynamics
Black, A. J., Traulsen, A., & Galla, T. (2012) · Physical Review Letters · doi:10.1103/physrevlett.109.028101 · Cited by 32
Exact Analysis of Latency of Stateless Opportunistic Forwarding
Chau, C.-K., & Basu, P. (2009) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infcom.2009.5061992 · Cited by 32
Mixing times of random walks on dynamic configuration models
Avena, L., Güldaş, H., van der Hofstad, R., & den Hollander, F. (2018) · The Annals of Applied Probability · doi:10.1214/17-aap1289 · Cited by 32
Approximate Value Iteration for Risk-Aware Markov Decision Processes
Yu, P., Haskell, W. B., & Xu, H. (2018) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2018.2790261 · Cited by 32
Mixing time for random walk on supercritical dynamical percolation
Peres, Y., Sousi, P., & Steif, J. E. (2019) · Probability Theory and Related Fields · doi:10.1007/s00440-019-00927-z · Cited by 32
Self-citationA Comparison of Random Task Graph Generation Methods for Scheduling Problems
Canon, L.-C., Sayah, M. E., & Héam, P. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-29400-7_5 · Cited by 32
A comparison principle for random walk on dynamical percolation
Hermon, J., & Sousi, P. (2020) · The Annals of Probability · doi:10.1214/20-aop1441 · Cited by 32
Nakata, Y., Turner, P. S., & Murao, M. (2012) · Physical Review A · doi:10.1103/physreva.86.012301 · Cited by 32
Kumar, R., Tomkins, A., Vassilvitskii, S., & Vee, E. (2015) · ACM International Conference on Web Search and Data Mining (WSDM) · doi:10.1145/2684822.2685310 · Cited by 32
Mixing Time of Critical Ising Model on Trees is Polynomial in the Height
Ding, J., Lubetzky, E., & Peres, Y. (2010) · Communications in Mathematical Physics · doi:10.1007/s00220-009-0978-y · Cited by 32
Self-citationA structural model of segregation in social networks
Mele, A. (2010) · doi:10.1920/wp.cem.2010.3210 · Cited by 32
Frameworks for Quantum Algorithms
Jeffery, S. (2014) · UWSpace (University of Waterloo) · Cited by 32
Probabilistic Couplings for Probabilistic ReasoningPreprint
Hsu, J. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1710.09951 · Cited by 32
Systemic Risk and Stability in Financial NetworksPreprint
Acemoğlu, D., Ozdaglar, A., & Tahbaz-Salehi, A. (2013) · SSRN Electronic Journal · doi:10.2139/ssrn.2207439 · Cited by 32
The gap of the area-weighted Motzkin spin chain is exponentially small
Levine, L., & Movassagh, R. (2017) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8121/aa6cc4 · Cited by 31
Near-Optimal Deployment of Service Chains by Exploiting Correlations Between Network Functions
Huang, H., Li, P., Guo, S., Liang, W., & Wang, K. (2017) · IEEE Transactions on Cloud Computing · doi:10.1109/tcc.2017.2780165 · Cited by 31
Contagion in Financial Systems: A Bayesian Network Approach
Chong, C., & Klüppelberg, C. (2016) · SIAM Journal on Financial Mathematics · doi:10.1137/17m1116659 · Cited by 31
Second-Order Term of Cover Time for Planar Simple Random Walk
Abe, Y. (2020) · Journal of Theoretical Probability · doi:10.1007/s10959-020-01011-2 · Cited by 31
A resolvent approach to metastability
Landim, C., Marcondes, D., & Seo, I. (2023) · Journal of the European Mathematical Society · doi:10.4171/jems/1398 · Cited by 31
Metastability of the Potts Ferromagnet on Random Regular Graphs
Coja‐Oghlan, A., Galanis, A., Goldberg, L. A., Ravelomanana, J. B., Štefankovič, D., & Vigoda, E. (2023) · Communications in Mathematical Physics · doi:10.1007/s00220-023-04644-6 · Cited by 31
Recovery and Rigidity in a Regular Stochastic Block Model
Brito, G., Dumitriu, I., Ganguly, S., Hoffman, C., & Tran, L. V. (2015) · ACM-SIAM Symposium on Discrete Algorithms (SODA) · doi:10.1137/1.9781611974331.ch108 · Cited by 31
Mixing rates of particle systems with energy exchange
Grigo, A., Khanin, K. M., & Szász, D. (2012) · Nonlinearity · doi:10.1088/0951-7715/25/8/2349 · Cited by 31
Conditioned, quasi-stationary, restricted measures and escape from metastable states
Fernández, R., Manzo, F., Nardi, F. R., Scoppola, E., & Sohier, J. (2016) · The Annals of Applied Probability · doi:10.1214/15-aap1102 · Cited by 31
Blocking duality for p-modulus on networks and applications
Albin, N., Clemens, J., Fernando, N., & Poggi‐Corradini, P. (2018) · Annali di Matematica Pura ed Applicata (1923 -) · doi:10.1007/s10231-018-0806-0 · Cited by 31
Scaling laws for diffusion on (trans)fractal scale-free networks
Peng, J., & Agliari, E. (2017) · Chaos An Interdisciplinary Journal of Nonlinear Science · doi:10.1063/1.4997761 · Cited by 31
Fitzner, R. R., & van der Hofstad, R. (2013) · TU/e Research Portal · Cited by 31
A stochastic approach to shortcut bridging in programmable matter
Arroyo, M. A., Cannon, S., Daymude, J. J., Randall, D., & Richa, A. W. (2018) · Natural Computing · doi:10.1007/s11047-018-9714-x · Cited by 31
Kac’s walk on $n$-sphere mixes in $n\log n$ steps
Pillai, N. S., & Smith, A. D. (2017) · The Annals of Applied Probability · doi:10.1214/16-aap1214 · Cited by 30
Error bounds for sequential Monte Carlo samplers for multimodal distributions
Paulin, D., Jasra, A., & Thiéry, A. H. (2018) · Bernoulli · doi:10.3150/17-bej988 · Cited by 30
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.