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)- Reversibility and equivalence in directed Markov fields
- Random walks on the vertices of transportation polytopes with constant number of sources
- On the Convergence of Reversible Markov Chains
- Nonlinear fluctuations of weakly asymmetric interacting particle systems
- Poincaré profiles of groups and spaces
- Proof of Aldous' spectral gap conjecture
- Mixing time for the asymmetric simple exclusion process in a random environment
- Mixing time of critical Ising model on trees is polynomial in the height
- Chernoff-type bound for finite Markov chains
- Harmonic functions on annuli of graphs
- Expander properties and the cover time of random intersection graphs
- Dynamics of (2+1)-dimensional SOS surfaces above a wall: slow mixing induced by entropic repulsion
- Sampling Edge Covers in 3-Regular Graphs
- Convergence of conditional Metropolis-Hastings samplers
- On the mixing time of the Diaconis-Gangolli random walk on contingency tables over \(\mathbb{Z}/q\mathbb{Z} \)
- The mixing time of Glauber dynamics for coloring regular trees
- Structure and eigenvalues of heat-bath Markov chains
- Fast mixing of Metropolis-Hastings with unimodal targets
- A note on various holding probabilities for random lazy random walks on finite groups
- Rapid mixing of Swendsen-Wang dynamics in two dimensions
- A necessary and sufficient condition for double coset lumping of Markov chains on groups with an application to the random to top shuffle
- Mixing of the Glauber dynamics for the ferromagnetic Potts model
- Analytic-geometric methods for finite Markov chains with applications to quasi-stationarity
- On random random walks
- The Second Eigenvalue of Random Walks On Symmetric Random Intersection Graphs
- Random walk on the symplectic forms over a finite field
- Analysis of top to bottom-\(k\) shuffles
- Tight bounds for the cover time of multiple random walks
- Time inhomogeneous Markov chains with wave-like behavior
- Remarks on sequential comparison of two Markov chains
- Regularized modified log-Sobolev inequalities and comparison of Markov chains
- scientific article; zbMATH DE number 7758305 (Why is no real title available?)
- Convergence rates of random walk on irreducible representations of finite groups
- Relaxation of product Markov chains on product spaces
- Conductance bounds on the L2 convergence rate of Metropolis algorithms on unbounded state spaces
- Mixing times for the swapping algorithm on the Blume-Emery-Griffiths model
- Spectral gap for the zero range process with constant rate
- Mixing times of Markov chains of 2-orientations
- An exercise(?) in Fourier analysis on the Heisenberg group
- Mixing time for the solid-on-solid model
- Relaxation to equilibrium of generalized east processes on \(\mathbb{Z}^{d}\): renormalization group analysis and energy-entropy competition
- Algorithms to approximately count and sample conforming colorings of graphs
- Double coset Markov chains
- Lozenge tilings, Glauber dynamics and macroscopic shape
- New classes of degree sequences with fast mixing swap Markov chain sampling
- Uncertainty quantification for Markov processes via variational principles and functional inequalities
- Polynomial mixing of the edge-flip Markov chain for unbiased dyadic tilings
- Comparison of Swendsen-Wang and heat-Bath dynamics
- Exact convergence analysis of the independent Metropolis-Hastings algorithms
- scientific article; zbMATH DE number 1303358 (Why is no real title available?)
- On quantitative convergence to quasi-stationarity
- Fast algorithms at low temperatures via Markov chains†
- The mixing time for simple exclusion
- Elementary bounds on Poincaré and log-Sobolev constants for decomposable Markov chains
- Systematic scan for sampling colorings
- Cutoff for general spin systems with arbitrary boundary conditions
- Mixing times of Markov chains for self‐organizing lists and biased permutations
- Efficiency test of pseudorandom number generators using random walks
- Polynomial mixing time of edge flips on quadrangulations
- The swapping algorithm for the Hopfield model with two patterns
- Upgrading MLSI to LSI for reversible Markov chains
- Random sampling for the monomer-dimer model on a lattice.
- Mixing times of lozenge tiling and card shuffling Markov chains
- Characterization of cutoff for reversible Markov chains
- A semidefinite bound for mixing rates of Markov chains
- Intersection conductance and canonical alternating paths: methods for general finite Markov chains
- Markov chain decomposition for convergence rate analysis
- Asymptotic optimality of isoperimetric constants
- Repeated averages on graphs
- Generalization of discrete-time geometric bounds to convergence rate of Markov processes on Rn
- Sensitivity of mixing times of Cayley graphs
- Gibbs sampling, exponential families and orthogonal polynomials
- Spectral gap of the symmetric inclusion process
- Nash inequalities for finite Markov chains
- Random quantum circuits are approximate 2-designs
- A version of Aldous' spectral-gap conjecture for the zero range process
- Sampling Eulerian orientations of triangular lattice graphs
- A bound on the rate of convergence for the discrete Gibbs sampler
- Mixing of the symmetric exclusion processes in terms of the corresponding single-particle random walk
- Simulated tempering and swapping on mean-field models
- The effect of boundary conditions on mixing of 2D Potts models at discontinuous phase transitions
- A Decomposition Based Proof for Fast Mixing of a Markov Chain over Balanced Realizations of a Joint Degree Matrix
- Rapid mixing for lattice colourings with fewer colours
- The exclusion process mixes (almost) faster than independent particles
- Comparison theory for Markov chains on different state spaces and application to random walk on derangements
- Exponential decay of entropy in the random transposition and Bernoulli-Laplace models
- Spectral computations for birth and death chains
- Torpid mixing of the Wang-Swendsen-Kotecký algorithm for sampling colorings
- Rapid Mixing of \({\boldsymbol{k}}\)-Class Biased Permutations
- Sharp Poincaré and log-Sobolev inequalities for the switch chain on regular bipartite graphs
- Cutoff for the Ising model on the lattice
- Polynomial mixing of the edge-flip Markov chain for unbiased dyadic tilings
- Comparison theorems for Green functions of Markov chains
- An interlacing theorem for reversible Markov chains
- Generalized crested products of Markov chains
- Reversibility of the non-backtracking random walk
- Applications of geometric bounds to the convergence rate of Markov chains on \(\mathbb R^ {n}\).
- Time to reach stationarity in the Bernoulli-Laplace diffusion model with many urns
- Analysis of top-swap shuffling for genome rearrangements
- Matrix norms and rapid mixing for spin 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)
