Eigenvalue bounds on convergence to stationarity for nonreversible Markov chains, with an application to the exclusion process
From MaRDI portal
(Redirected from Publication:804091)
Recommendations
Cited in
(only showing first 100 items - show all)- Eigenvalue bounds on restrictions of reversible nearly uncoupled Markov chains
- Markov chain comparison
- Comparison of Markov chains via weak Poincaré inequalities with application to pseudo-marginal MCMC
- Isoperimetric Inequalities and Decay of Iterated Kernels for Almost-transitive Markov Chains
- Skip-free Markov chains
- Maximally predictive states: from partial observations to long timescales
- Spectral clustering for non-reversible Markov chains
- Tight estimates for convergence of some non-stationary consensus algorithms
- A rapidly mixing stochastic system of finite interacting particles on the circle
- A new perspective on implementation by voting trees
- Information geometry of reversible Markov chains
- Improved estimation of relaxation time in nonreversible Markov chains
- Metropolis-Hastings reversiblizations of non-reversible Markov chains
- Chernoff-type bound for finite Markov chains
- The spectral gap of sparse random digraphs
- Random walks on graphs and Monte Carlo methods
- Harmonic analysis on directed graphs and applications: from Fourier analysis to wavelets
- On the spectral analysis of second-order Markov chains
- Variance bounding Markov chains
- Generalized Markov chain tree theorem and Kemeny's constant for a class of non-Markovian matrices
- Solidarity of Gibbs samplers: the spectral gap
- Sensitivity and convergence of uniformly ergodic Markov chains
- A local limit theorem for a family of non-reversible Markov chains
- On some mixing times for nonreversible finite Markov chains
- Limit theorems for Markov chains by the symmetrization method
- Speed of convergence to equilibrium and to normality for diffusions with multiple periodic scales
- Compound Poisson approximation for counts of rare patterns in Markov chains and extreme sojourns in birth-death chains.
- On the isoperimetric spectrum of graphs and its approximations
- Learning Markov models via low-rank optimization
- scientific article; zbMATH DE number 7415082 (Why is no real title available?)
- Computable bounds on the spectral gap for unreliable Jackson networks
- Evolving sets, mixing and heat kernel bounds
- Local limit theorems and mod- convergence
- Convergence of some time inhomogeneous Markov chains via spectral techniques
- On quantitative convergence to quasi-stationarity
- Simulated annealing with time-dependent energy function via Sobolev inequalities
- The mixing time for simple exclusion
- Mixing times for the TASEP on the circle
- Systematic scan for sampling colorings
- A dynamic programming approach to efficient sampling from Boltzmann distributions
- An online algorithm for the risk-aware restless bandit
- About relaxation time of finite generalized Metropolis algorithms
- Fixed Precision MCMC Estimation by Median of Products of Averages
- Random walks on dynamic graphs: mixing times, hitting times, and return probabilities
- On approximating the eigenvalues of stochastic matrices in probabilistic logspace
- Rapid mixing of global Markov chains via spectral independence: the unbounded degree case
- Distributed multi-agent optimisation via coordination with second-order nearest neighbours
- Improved bounds for the large-time behaviour of simulated annealing
- Homophily outlier detection in non-IID categorical data
- A semidefinite bound for mixing rates of Markov chains
- Intersection conductance and canonical alternating paths: methods for general finite Markov chains
- Discriminating between sequences of bernoulli and markov-bernoulli trials
- Mod-\(\phi\) convergence. II: Estimates on the speed of convergence
- Asymptotic optimality of isoperimetric constants
- Mixing times for the simple exclusion process with open boundaries
- Stability and exponential convergence of continuous-time Markov chains
- Analysis of non-reversible Markov chains via similarity orbits
- Poisson approximations for Markov-driven point processes
- Nash inequalities for finite Markov chains
- Analysis of two-component Gibbs samplers using the theory of two projections
- Asymptotic behaviour of time-inhomogeneous evolutions on von Neumann algebras
- Lower bounds for the eigenvalues of Laplacian matrices
- Comparison theorems for reversible Markov chains
- Spectral partitioning works: planar graphs and finite element meshes
- Logarithmic Sobolev, isoperimetry and transport inequalities on graphs
- Multiscale diffusion processes with periodic coefficients and an application to solute transport in porous media
- Reversible random walks on dynamic graphs
- The power of amnesia: Learning probabilistic automata with variable memory length
- Statistical estimation of ergodic Markov chain kernel over discrete state space
- Markov chain entropy games and the geometry of their Nash equilibria
- The asynchronous DeGroot dynamics
- Geometric Approaches to the Estimation of the Spectral Gap of Reversible Markov Chains
- Robust learning in social networks via matrix scaling
- Cooperative convex optimization with subgradient delays using push-sum distributed dual averaging
- Strong stationary duality for continuous-time Markov chains. I: Theory
- Theory of eigenvalues for periodic non-stationary Markov processes: the Kolmogorov operator and its applications
- Spectral gap of nonreversible Markov chains
- Efficient Parameter Sampling for Markov Jump Processes
- Attracting random walks
- Oja's algorithm for graph clustering, Markov spectral decomposition, and risk sensitive control
- A discipline of evolutionary programming
- The Markov chain Monte Carlo revolution
- Uniform Chernoff and Dvoretzky-Kiefer-Wolfowitz-type inequalities for Markov chains and related processes
- An Extension of the Metropolis Algorithm
- Non-asymptotic estimates for Markov transition matrices via spectral gap methods
- What do we know about the Metropolis algorithm?
- On the \(\alpha\)-lazy version of Markov chains in estimation and testing problems
- Mean-field conditions for percolation on finite graphs
- Uniform upper bound of the second largest eigenvalue of stochastic matrices with equal-neighbor rule
- Logarithmic Sobolev inequalities for finite Markov chains
- Geometric Ergodicity of Trans-Dimensional Markov Chain Monte Carlo Algorithms
- Entropy and convergence in dynamics and demography
- On the convergence time of some non-reversible Markov chain Monte Carlo methods
- A hierarchy of gaussian and non-gaussian asymptotics of a class of Fokker-Planck equations with multiple scales
- Mixing times for the TASEP in the maximal current phase
- Eigenvalues of LRU via a linear algebraic approach
- Spectral analysis of non-Hermitian matrices and directed graphs
- Expectations for nonreversible Markov chains
- A Markov chain sampler for contingency table exact inference
- Nonstationary Markovian queues
This page was built for publication: Eigenvalue bounds on convergence to stationarity for nonreversible Markov chains, with an application to the exclusion process
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q804091)
