Comparison theorems for reversible Markov chains
From MaRDI portal
(Redirected from Publication:1308697)
Recommendations
- Eigenvalue bounds on convergence to stationarity for nonreversible Markov chains, with an application to the exclusion process
- Geometric bounds for eigenvalues of Markov chains
- Comparing eigenvalue bounds for Markov chains: When does Poincaré beat Cheeger?
- Interlacing eigenvalues in time reversible Markov chains
- On the Convergence of Reversible Markov Chains
Cited in
(only showing first 100 items - show all)- Matrix norms and rapid mixing for spin systems
- Crested products of Markov chains
- Improved mixing time bounds for the Thorp shuffle and \(L\)-reversal chain
- Conditions for rapid mixing of parallel and simulated tempering on multimodal distributions
- Sampling Eulerian orientations of triangular lattice graphs
- Expander properties and the cover time of random intersection graphs
- Random quantum circuits are approximate 2-designs
- Comparison theorems for Green functions of Markov chains
- Expectations for nonreversible Markov chains
- Relaxation of product Markov chains on product spaces
- What do we know about the Metropolis algorithm?
- Comparing eigenvalue bounds for Markov chains: When does Poincaré beat Cheeger?
- Chernoff-type bound for finite Markov chains
- Coupling, spectral gap and related topics. II
- Exponential decay of entropy in the random transposition and Bernoulli-Laplace models
- Mixing times of lozenge tiling and card shuffling Markov chains
- A note on various holding probabilities for random lazy random walks on finite groups
- Random cluster dynamics for the Ising model is rapidly mixing
- The effect of boundary conditions on mixing of 2D Potts models at discontinuous phase transitions
- Stochastic Burgers equation from long range exclusion interactions
- The flip Markov chain for connected regular graphs
- Efficiency test of pseudorandom number generators using random walks
- Elementary bounds on Poincaré and log-Sobolev constants for decomposable Markov chains
- Torpid mixing of the Wang-Swendsen-Kotecký algorithm for sampling colorings
- Relaxation to equilibrium of conservative dynamics. I: Zero-range processes
- Markov chain decomposition for convergence rate analysis
- Applications of geometric bounds to the convergence rate of Markov chains on \(\mathbb R^ {n}\).
- Reversibility and equivalence in directed Markov fields
- Walks on generating sets of Abelian groups
- Stochastic alternating projections
- Geometric ergodicity and the spectral gap of non-reversible Markov chains
- Cutoff for the Ising model on the lattice
- Exclusion sensitivity of Boolean functions
- Mixing of the symmetric exclusion processes in terms of the corresponding single-particle random walk
- Convergence rate of Markov chain methods for genomic motif discovery
- Time inhomogeneous Markov chains with wave-like behavior
- Fast mixing of Metropolis-Hastings with unimodal targets
- Poincaré profiles of groups and spaces
- Random walk on the symplectic forms over a finite field
- An exercise(?) in Fourier analysis on the Heisenberg group
- A sharp log-Sobolev inequality for the multislice
- Mixing time of fractional random walk on finite fields
- Hypercontractivity and logarithmic Sobolev inequality for non-primitive quantum Markov semigroups and estimation of decoherence rates
- Exact convergence analysis of the independent Metropolis-Hastings algorithms
- On the mixing time of the Diaconis-Gangolli random walk on contingency tables over \(\mathbb{Z}/q\mathbb{Z} \)
- The exclusion process mixes (almost) faster than independent particles
- The interchange process on high-dimensional products
- Polynomial mixing time of edge flips on quadrangulations
- Reversibility of the non-backtracking random walk
- A version of Aldous' spectral-gap conjecture for the zero range process
- Mixing times for a constrained Ising process on the two-dimensional torus at low density
- Lozenge tilings, Glauber dynamics and macroscopic shape
- Elementary bounds on mixing times for decomposable Markov chains
- Spectral computations for birth and death chains
- Structure and eigenvalues of heat-bath Markov chains
- Nonlinear fluctuations of weakly asymmetric interacting particle systems
- Analysis of top-swap shuffling for genome rearrangements
- Convergence rates of random walk on irreducible representations of finite groups
- Analysis of top to bottom-\(k\) shuffles
- Systematic scan for sampling colorings
- On random random walks
- Logarithmic Sobolev inequalities for finite Markov chains
- Improved bounds for sampling colorings
- Random sampling for the monomer-dimer model on a lattice.
- Analyzing Glauber dynamics by comparison of Markov chains
- Entropy production of doubly stochastic quantum channels
- Information percolation and cutoff for the stochastic Ising model
- Mixing times of Markov chains of 2-orientations
- Sampling and counting 3-orientations of planar triangulations
- A bound on the rate of convergence for the discrete Gibbs sampler
- Comparison of Swendsen-Wang and heat-Bath dynamics
- Mixing times for the swapping algorithm on the Blume-Emery-Griffiths model
- Dimension-Independent MCMC Sampling for Inverse Problems with Non-Gaussian Priors
- Algorithms to approximately count and sample conforming colorings of graphs
- The mixing time of Glauber dynamics for coloring regular trees
- Strong spatial mixing and rapid mixing with five colours for the Kagome lattice
- On the Convergence of Reversible Markov Chains
- Generalization of discrete-time geometric bounds to convergence rate of Markov processes on Rn
- Sampling Edge Covers in 3-Regular Graphs
- Simulated tempering and swapping on mean-field models
- The Glauber dynamics for edge-colorings of trees
- Mixing of the Glauber dynamics for the ferromagnetic Potts model
- An interlacing theorem for reversible Markov chains
- The Second Eigenvalue of Random Walks On Symmetric Random Intersection Graphs
- Proof of Aldous' spectral gap conjecture
- Localization from incomplete noisy distance measurements
- Random walks on the vertices of transportation polytopes with constant number of sources
- The Markov chain Monte Carlo revolution
- Comparison inequalities and fastest-mixing Markov chains
- Remarks on sequential comparison of two Markov chains
- Dynamics of (2+1)-dimensional SOS surfaces above a wall: slow mixing induced by entropic repulsion
- scientific article; zbMATH DE number 1303358 (Why is no real title available?)
- Mixing time for the solid-on-solid model
- Estimations pour les chaînes de Markov réversibles
- An extension of the gärtner-ellis Theorem with applications To reversible markov chains And some stationary sequences
- Conductance bounds on the L2 convergence rate of Metropolis algorithms on unbounded state spaces
- New classes of degree sequences with fast mixing swap Markov chain sampling
- A semidefinite bound for mixing rates of Markov chains
- An Extension of the Metropolis Algorithm
- Scaling limits of additive functionals of interacting particle systems
This page was built for publication: Comparison theorems for reversible Markov chains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1308697)
