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)- Convergence rate of Markov chain methods for genomic motif discovery
- Spectral gap of the symmetric inclusion process
- Generalization of discrete-time geometric bounds to convergence rate of Markov processes on Rn
- On the mixing time of the Diaconis-Gangolli random walk on contingency tables over \(\mathbb{Z}/q\mathbb{Z} \)
- Poincaré profiles of groups and spaces
- Counting independent sets in graphs with bounded bipartite pathwidth
- Structure and eigenvalues of heat-bath Markov chains
- A bound on the rate of convergence for the discrete Gibbs sampler
- Sampling Edge Covers in 3-Regular Graphs
- Random walk on the symplectic forms over a finite field
- Fast algorithms at low temperatures via Markov chains†
- Coupling, spectral gap and related topics. II
- Double coset Markov chains
- Speeding up switch Markov chains for sampling bipartite graphs with given degree sequence
- 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
- Comparing limit profiles of reversible Markov chains
- Fast mixing of Metropolis-Hastings with unimodal targets
- Mixing times of Markov chains of 2-orientations
- scientific article; zbMATH DE number 1303358 (Why is no real title available?)
- Regularized modified log-Sobolev inequalities and comparison of Markov chains
- Sampling Eulerian orientations of triangular lattice graphs
- Analysis of top to bottom-\(k\) shuffles
- Rapid Mixing of \({\boldsymbol{k}}\)-Class Biased Permutations
- Efficiency test of pseudorandom number generators using random walks
- Estimations pour les chaînes de Markov réversibles
- A sharp log-Sobolev inequality for the multislice
- Conductance bounds on the L2 convergence rate of Metropolis algorithms on unbounded state spaces
- Random walks on the vertices of transportation polytopes with constant number of sources
- Repeated averages on graphs
- Exact convergence analysis of the independent Metropolis-Hastings algorithms
- Sharp Poincaré and log-Sobolev inequalities for the switch chain on regular bipartite graphs
- Upgrading MLSI to LSI for reversible Markov chains
- Analytic-geometric methods for finite Markov chains with applications to quasi-stationarity
- Learning by unsupervised nonlinear diffusion
- The exclusion process mixes (almost) faster than independent particles
- The Second Eigenvalue of Random Walks On Symmetric Random Intersection Graphs
- A necessary and sufficient condition for double coset lumping of Markov chains on groups with an application to the random to top shuffle
- An extension of the gärtner-ellis Theorem with applications To reversible markov chains And some stationary sequences
- New classes of degree sequences with fast mixing swap Markov chain sampling
- Mixing times of Markov chains for self‐organizing lists and biased permutations
- Spectral computations for birth and death chains
- Elementary bounds on mixing times for decomposable Markov chains
- The flip Markov chain for connected regular graphs
- Dimension-Independent MCMC Sampling for Inverse Problems with Non-Gaussian Priors
- A Decomposition Based Proof for Fast Mixing of a Markov Chain over Balanced Realizations of a Joint Degree Matrix
- Mixing times for a constrained Ising process on the two-dimensional torus at low density
- Random cluster dynamics for the Ising model is rapidly mixing
- An exercise(?) in Fourier analysis on the Heisenberg group
- Polynomial mixing of the edge-flip Markov chain for unbiased dyadic tilings
- Uncertainty quantification for Markov processes via variational principles and functional inequalities
- Polynomial mixing of the edge-flip Markov chain for unbiased dyadic tilings
- Sensitivity of mixing times of Cayley graphs
- Reversibility and equivalence in directed Markov fields
- Intersection conductance and canonical alternating paths: methods for general finite Markov chains
- Torpid mixing of the Wang-Swendsen-Kotecký algorithm for sampling colorings
- Mixing time for the asymmetric simple exclusion process in a random environment
- The interchange process on high-dimensional products
- Polynomial mixing time of edge flips on quadrangulations
- An interlacing theorem for reversible Markov chains
- scientific article; zbMATH DE number 7758305 (Why is no real title available?)
- Lozenge tilings, Glauber dynamics and macroscopic shape
- The effect of boundary conditions on mixing of 2D Potts models at discontinuous phase transitions
- The Glauber dynamics for edge-colorings of trees
- Sampling and counting 3-orientations of planar triangulations
- Relaxation of product Markov chains on product spaces
- Entropy production of doubly stochastic quantum channels
- A version of Aldous' spectral-gap conjecture for the zero range process
- On random random walks
- Perfect Simulation for Image Restoration
- Mixing times of lozenge tiling and card shuffling Markov chains
- Generalized crested products of Markov chains
- Gibbs sampling, exponential families and orthogonal polynomials
- A bound for the convergence rate of parallel tempering for sampling restricted Boltzmann machines
- Reversibility of the non-backtracking random walk
- Random sampling for the monomer-dimer model on a lattice.
- Asymptotic optimality of isoperimetric constants
- On quantitative convergence to quasi-stationarity
- Cutoff for general spin systems with arbitrary boundary conditions
- Analyzing Glauber dynamics by comparison of Markov chains
- Comparison of Swendsen-Wang and heat-Bath dynamics
- Dobrushin Conditions and Systematic Scan
- Mixing time for the solid-on-solid model
- Analysis of top-swap shuffling for genome rearrangements
- What do we know about the Metropolis algorithm?
- Cutoff for the Ising model on the lattice
- Expander properties and the cover time of random intersection graphs
- An Extension of the Metropolis Algorithm
- Tight bounds for the cover time of multiple random walks
- Exponential decay of entropy in the random transposition and Bernoulli-Laplace models
- Applications of geometric bounds to the convergence rate of Markov chains on \(\mathbb R^ {n}\).
- Comparison theorems for Green functions of Markov chains
- Walks on generating sets of Abelian groups
- Spectral gap for the zero range process with constant rate
- Nash inequalities for finite Markov chains
- Comparison theory for Markov chains on different state spaces and application to random walk on derangements
- Non-reversible guided Metropolis kernel
- Mixing of the symmetric exclusion processes in terms of the corresponding single-particle random walk
- Logarithmic Sobolev inequalities for finite Markov chains
- Dynamics of \((2+1)\)-dimensional SOS surfaces above a wall: slow mixing induced by entropic repulsion
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)
