Mathematical aspects of mixing times in Markov chains.
From MaRDI portal
Publication:3587573
Recommendations
- Markov chains and mixing times. With a chapter on ``Coupling from the past by James G. Propp and David B. Wilson.
- 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 18982
- Evolving sets, mixing and heat kernel bounds
- Logarithmic Sobolev inequalities for finite Markov chains
Cited in
(66)- Geometric and spectral consequences of curvature bounds on tessellations
- Improved estimation of relaxation time in nonreversible Markov chains
- The mixing time of the Newman-Watts small world
- The spectral gap of sparse random digraphs
- An algorithm for estimating non-convex volumes and other integrals in \(n\) dimensions
- Harmonic analysis on directed graphs and applications: from Fourier analysis to wavelets
- Mixing time of Markov chains for the 1-2 model
- Generalized Markov chain tree theorem and Kemeny's constant for a class of non-Markovian matrices
- Mixing time guarantees for unadjusted Hamiltonian Monte Carlo
- Sharp bounds on eigenvalues via spectral embedding based on signless Laplacians
- Ferromagnetic Potts Model: Refined #BIS-hardness and Related Results
- Improved mixing rates of directed cycles by added connection
- Stationary frequencies and mixing times for neutral drift processes with spatial structure
- Cutoff for random lifts of weighted graphs
- An inequality for functions on the Hamming cube
- On the control of opinion dynamics in social networks
- Universality of cutoff for exclusion with reservoirs
- The generalized distance spectrum of a graph and applications
- The varentropy criterion is sharp on expanders
- On the fastest finite Markov processes
- A note on the relaxation time of two Markov chains on rooted phylogenetic tree spaces
- Hitting time and mixing time bounds of Stein's factors
- Finite-size scaling, phase coexistence, and algorithms for the random cluster model on random graphs
- Deterministic encryption with the Thorp shuffle
- On the spectral radius and stiffness of Markov jump process rate matrices
- Pattern discrete and mixed hit-and-run for global optimization
- Uniform random posets
- From local averaging to emergent global behaviors: the fundamental role of network interconnections
- On efficient randomized algorithms for finding the PageRank vector
- Deterministic random walks for rapidly mixing chains
- scientific article; zbMATH DE number 7370527 (Why is no real title available?)
- Sensitivity of mixing times in Eulerian digraphs
- Focused most probable world computations in probabilistic logic programs
- Upgrading MLSI to LSI for reversible Markov chains
- Entropy dissipation estimates for inhomogeneous zero-range processes
- Gradient and passive circuit structure in a class of non-linear dynamics on a graph
- Sensitivity of mixing times of Cayley graphs
- Analysis of non-reversible Markov chains via similarity orbits
- Spectral gap of the symmetric inclusion process
- Tight bounds for mixing of the Swendsen-Wang algorithm at the Potts transition point
- Random quantum circuits are approximate 2-designs
- Cutoff for the mean-field zero-range process with bounded monotone rates
- A version of Aldous' spectral-gap conjecture for the zero range process
- Random Walks on Randomly Evolving Graphs
- Uniform accuracy of the maximum likelihood estimates for probabilistic models of biological sequences
- Quantifying the Dissipation Enhancement of Cellular Flows
- Cutoff for the mean-field zero-range process
- Sequential Monte Carlo for maximum weight subgraphs with application to solving image jigsaw puzzles
- Using histograms to better answer queries to probabilistic logic programs
- The Markov chain Monte Carlo revolution
- Topics in Markov chains: mixing and escape rate
- Modified log-Sobolev inequalities for strong-Rayleigh measures
- Expander graphs and their applications
- On the \(\alpha\)-lazy version of Markov chains in estimation and testing problems
- Mixing and hitting times for Gibbs samplers and other non-Feller processes
- Transport-entropy inequalities and curvature in discrete-space Markov chains
- Some things we've learned (about Markov chain Monte Carlo)
- Mixing time estimation in reversible Markov chains from a single sample path
- A sharp log-Sobolev inequality for the multislice
- Eigenvalues of LRU via a linear algebraic approach
- Sampling the Fermi statistics and other conditional product measures
- Improved mixing time bounds for the Thorp shuffle and \(L\)-reversal chain
- Mixing time and expansion of non-negatively curved Markov chains
- Markov chains on finite fields with deterministic jumps
- Approximate spectral gaps for Markov chain mixing times in high dimensions
- Cutoff for non-negatively curved Markov chains
This page was built for publication: Mathematical aspects of mixing times in Markov chains.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3587573)
