scientific article; zbMATH DE number 1195779

MaRDI QIDQ4208451zbMATH OpenFDO

Authors Peter Winkler, László Lovász

Publication date 2 March 1999

zbMATH Keywords

Markov chainmixingstationary distribution

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Sums of independent random variables; random walks (60G50) Stopping times; optimal stopping problems; gambling theory (60G40) Optimal stopping in statistics (62L15)

Recommendations

• Markov chains and mixing times. With a chapter on ``Coupling from the past by James G. Propp and David B. Wilson.
• The distribution of mixing times in Markov chains
• Mixing times for uniformly ergodic Markov chains
• Mixing and hitting times for finite Markov chains

Cited in

(51)

• The mixing time of the Newman-Watts small world
• A conversation with Jim Pitman
• Mixing times for uniformly ergodic Markov chains
• The mathematics of mixing things up
• Randomized scheduling algorithm for queueing networks
• Algorithms and Computation
• Mixing time of Markov chains for the 1-2 model
• Orthogonality and probability: mixing times
• The toom interface via coupling
• Mixing time of near-critical random graphs
• The Mixing Time of the Newman-Watts Small-World Model
• Coupling and mixing times in a Markov chain
• On approximating the stationary distribution of time-reversible Markov chains
• On approximating the stationary distribution of time-reversible Markov chains
• Markov chain mixing time on cycles
• On times to quasi-stationarity for birth and death processes
• Faster mixing and small bottlenecks
• The expected hitting times for finite Markov chains
• Quantum walks: a comprehensive review
• Comparing with octopi
• On mixing of certain random walks, cutoff phenomenon and sharp threshold of random matroid processes
• Characterizing limits and opportunities in speeding up Markov chain mixing
• Varieties of mixing
• Mixing times of lozenge tiling and card shuffling Markov chains
• Mixing and hitting times for finite Markov chains
• Mixing under monotone censoring
• Sensitivity of mixing times of Cayley graphs
• Exact mixing in an unknown Markov chain
• Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
• Mixing times with applications to perturbed Markov chains
• Mixing time of Markov chains, dynamical systems and evolution
• Information flow on trees
• The distribution of mixing times in Markov chains
• Mixing times and moving targets
• A spectral characterization for concentration of the cover time
• Mixing time for Markov chain on linear extensions
• Mixing Versus Stirring
• Expander graphs and their applications
• Separation cut-offs for birth and death chains
• Mixing and hitting times for Gibbs samplers and other non-Feller processes
• Mixing times are hitting times of large sets
• Intersection and mixing times for reversible chains
• Maximum Kolmogorov-Sinai entropy versus minimum mixing time in Markov chains
• Perfect edge state transfer on cubelike graphs
• A comparison principle for random walk on dynamical percolation
• Dimension-Independent MCMC Sampling for Inverse Problems with Non-Gaussian Priors
• Mixing times for the interchange process
• Mixing times of Markov chains for self-organizing lists and biased permutations
• A technical report on hitting times, mixing and cutoff
• Markov chain comparison
• Markov chains and mixing times. With a chapter on ``Coupling from the past by James G. Propp and David B. Wilson.

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4208451)