Markov chains and mixing times. With a chapter on ``Coupling from the past by James G. Propp and David B. Wilson.
From MaRDI portal
Publication:3549475
zbMATH Open1160.60001MaRDI QIDQ3549475FDOQ3549475
Authors: David A. Levin, Yuval Peres, Elizabeth L. Wilmer
Publication date: 29 December 2008
Recommendations
- Markov chains and mixing times. With a chapter on ``Coupling from the past by James G. Propp and David B. Wilson.
- scientific article; zbMATH DE number 1195779
- scientific article; zbMATH DE number 1426485
- Markov Chains
- From shuffling cards to walking around the building: An introduction to modern Markov chain theory
Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to probability theory (60-01)
Cited In (only showing first 100 items - show all)
- Metropolis-Hastings reversiblizations of non-reversible Markov chains
- Another conversation with Persi Diaconis
- Mixing time bounds for graphlet random walks
- Quantum walks can find a marked element on any graph
- Hitting time asymptotics for hard-core interactions on grids
- Convergence to extremal processes in random environments and extremal ageing in SK models
- Smoothed Analysis on Connected Graphs
- Dobrushin's ergodicity coefficient for Markov operators on cones
- Hopf algebras and Markov chains: two examples and a theory
- Error bounds for Metropolis-Hastings algorithms applied to perturbations of Gaussian measures in high dimensions
- Two-dimensional random interlacements and late points for random walks
- Chip-firing game and a partial Tutte polynomial for Eulerian digraphs
- Conditioned, quasi-stationary, restricted measures and escape from metastable states
- Gumbel fluctuations for cover times in the discrete torus
- Random walks on quasirandom graphs
- On the limiting spectral density of random matrices filled with stochastic processes
- Uniformity of the late points of random walk on \({\mathbb {Z}}_{n}^{d}\) for \(d \geq 3\)
- Mixing time and cutoff for the adjacent transposition shuffle and the simple exclusion
- The Mixing Time of the Newman-Watts Small-World Model
- A note on the relaxation time of two Markov chains on rooted phylogenetic tree spaces
- Abrupt convergence for stochastic small perturbations of one dimensional dynamical systems
- Mixing times for random \(k\)-cycles and coalescence-fragmentation chains
- Cutoff for the noisy voter model
- Mixing and average mixing times for general Markov processes
- Mean field conditions for coalescing random walks
- Coalescence and meeting times on \(n\)-block Markov chains
- Non-reversible Metropolis-Hastings
- Continuous-time Markov chains. An applications-oriented approach
- A critical threshold for design effects in network sampling
- Maximizing the probability of attaining a target prior to extinction
- Hack's law in a drainage network model: a Brownian web approach
- Time operator of Markov chains and mixing times. Applications to financial data
- Polymer dynamics in the depinned phase: metastability with logarithmic barriers
- An efficient tree-based computation of a metric comparable to a natural diffusion distance
- Equivalence of a mixing condition and the LSI in spin systems with infinite range interaction
- Curvature, concentration and error estimates for Markov chain Monte Carlo
- Mixing times of lozenge tiling and card shuffling Markov chains
- Combinatorial Markov chains on linear extensions
- Majority rule has transition ratio 4 on Yule trees under a 2-state symmetric model
- Some simple but challenging Markov processes
- Finite Markov Chains and Algorithmic Applications
- Maximum likelihood estimator consistency for recurrent random walk in a parametric random environment with finite support
- An inhomogeneous multispecies TASEP on a ring
- General Irreducible Markov Chains and Non-Negative Operators
- Mixing of the symmetric exclusion processes in terms of the corresponding single-particle random walk
- Simulated tempering and swapping on mean-field models
- A martingale approach to metastability
- Cover times for sequences of reversible Markov chains on random graphs
- Centroids of the core of exact capacities: a comparative study
- Interacting particle systems as stochastic social dynamics
- The random conductance model with Cauchy tails
- The measurable Kesten theorem
- Comparison of cutoffs between lazy walks and Markovian semigroups
- Zero-temperature 2D stochastic Ising model and anisotropic curve-shortening flow
- Voting Rights, Markov Chains, and Optimization by Short Bursts
- Cutoff for the Ising model on the lattice
- A probabilistic interpretation of the Macdonald polynomials
- Bounding quantum gate error rate based on reported average fidelity
- Glauber dynamics for the mean-field Potts model
- Mathematical aspects of mixing times in Markov chains.
- The probability of long cycles in interchange processes
- The length of the longest increasing subsequence of a random Mallows permutation
- Hunter, Cauchy rabbit, and optimal Kakeya sets
- Exact and asymptotic results on coarse Ricci curvature of graphs
- Metastability of logit dynamics for coordination games
- Cover times, blanket times, and majorizing measures
- Random lattice triangulations: structure and algorithms
- Zero-temperature limit of the Kawasaki dynamics for the Ising lattice gas in a large two-dimensional torus
- Collisions of random walks
- Non-backtracking random walk
- Mixing of the upper triangular matrix walk
- Some things we've learned (about Markov chain Monte Carlo)
- A lecture on the averaging process
- Mixing times of random walks on dynamic configuration models
- Mixing times are hitting times of large sets
- Random forests and networks analysis
- High-dimensional structure estimation in Ising models: local separation criterion
- The geometric meaning of curvature: local and nonlocal aspects of Ricci curvature
- A drainage network with dependence and the Brownian web
- Markov chain comparison
- Proof of Aldous' spectral gap conjecture
- The 2D-directed spanning forest converges to the Brownian web
- The evolution of a spatial stochastic network
- On the mixing time of the 2D stochastic Ising model with ``Plus boundary conditions at low temperature
- Cutoff phenomenon for random walks on Kneser graphs
- The mathematics of mixing things up
- Rapid mixing of Swendsen-Wang dynamics in two dimensions
- Existence of the harmonic measure for random walks on graphs and in random environments
- Hypercube percolation
- Front evolution of the Fredrickson-Andersen one spin facilitated model
- Uniformity of the uncovered set of random walk and cutoff for lamplighter chains
- Cutoff for the East process
- Exact thresholds for Ising-Gibbs samplers on general graphs
- Mixing time for the Ising model: a uniform lower bound for all graphs
- A one-dimensional coagulation-fragmentation process with a dynamical phase transition
- A sharp estimate for cover times on binary trees
- Mixing time of near-critical random graphs
- Phase separation in random cluster models. II: The droplet at equilibrium, and local deviation lower bounds
- Front progression in the east model
- Mixing time for the solid-on-solid model
This page was built for publication: Markov chains and mixing times. With a chapter on ``Coupling from the past by James G. Propp and David B. Wilson.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3549475)