Geometric bounds for eigenvalues of Markov chains
From MaRDI portal
Recommendations
- Applications of geometric bounds to the convergence rate of Markov chains on \(\mathbb R^ {n}\).
- Comparison theorems for reversible Markov chains
- On the Convergence of Reversible Markov Chains
- Explicit bounds for geometric convergence of Markov chains
- Comparing eigenvalue bounds for Markov chains: When does Poincaré beat Cheeger?
Cited in
(only showing first 100 items - show all)- Characterization of equilibrium measures for critical reversible nearest particle systems
- Simulated annealing with time-dependent energy function via Sobolev inequalities
- Geometric inequalities for the eigenvalues of concentrated Markov chains
- Lower bounds to the spectral gap of Davies generators
- Multi-way dual Cheeger constants and spectral bounds of graphs
- Tight estimates for convergence of some non-stationary consensus algorithms
- Dimension spectrum of Axiom A diffeomorphisms. I: The Bowen-Margulis measure
- Geometric Approaches to the Estimation of the Spectral Gap of Reversible Markov Chains
- Optimization problems for weighted graphs and related correlation estimates
- Asymptotic optimality of isoperimetric constants
- Constructing optimal transition matrix for Markov chain Monte Carlo
- Sequential stratified regeneration: \textit{MCMC} for large state spaces with an application to subgraph count estimation
- Applications of geometric bounds to the convergence rate of Markov chains on \(\mathbb R^ {n}\).
- Comparing eigenvalue bounds for Markov chains: When does Poincaré beat Cheeger?
- The normalized Laplacian spectrum of subdivisions of a graph
- scientific article; zbMATH DE number 1789871 (Why is no real title available?)
- Isoperimetric Inequalities and Decay of Iterated Kernels for Almost-transitive Markov Chains
- An empirical study of policy convergence in Markov decision process value iteration
- A discipline of evolutionary programming
- Analysis of top to bottom-\(k\) shuffles
- Markov chain approach to probabilistic guidance for swarms of autonomous agents
- Some results characterizing the finite time behaviour of the simulated annealing algorithm.
- A hierarchical method for obtaining eigenvalue enclosures
- A Markov chain sampler for contingency table exact inference
- Pattern formation in auxin flux
- On swapping and simulated tempering algorithms.
- The swapping algorithm for the Hopfield model with two patterns
- When does allow the Hardy inequality to calculate an exact Poincaré constant on a line?
- Approximating the number of double cut-and-join scenarios
- Finite approximations to the critical reversible nearest particle system
- On the spectrum of the normalized Laplacian of iterated triangulations of graphs
- On the rate of convergence of the Gibbs sampler for the 1-D Ising model by geometric bound
- Bounds for the second largest eigenvalue of a transition matrix
- Rapid mixing of Swendsen-Wang dynamics in two dimensions
- On the Convergence of Reversible Markov Chains
- A general class of Markov processes with explicit matrix-geometric solutions
- Dependence ordering for Markov processes on partially ordered spaces
- On improved bounds and conditions for the convergence of Markov chains
- Pattern discrete and mixed hit-and-run for global optimization
- Mixing times for the swapping algorithm on the Blume-Emery-Griffiths model
- Efficient simulated annealing on fractal energy landscapes
- Achieving Geometric Convergence for Distributed Optimization Over Time-Varying Graphs
- \(L^p\) estimates for Feynman-Kac propagators with time-dependent reference measures
- Thermalization time bounds for Pauli stabilizer Hamiltonians
- Strong spatial mixing and rapid mixing with five colours for the Kagome lattice
- Approximate spectral gaps for Markov chain mixing times in high dimensions
- Uniform estimates of nonlinear spectral gaps
- Stability and exponential convergence of continuous-time Markov chains
- Computable bounds on the spectral gap for unreliable Jackson networks
- Rates of convergence of some multivariate Markov chains with polynomial eigenfunctions
- The mixing time of a random walk on a long-range percolation cluster in pre-Sierpinski gasket
- The worm process for the Ising model is rapidly mixing
- Rapid mixing for lattice colourings with fewer colours
- A note on Sobolev type inequalities on graphs with polynomial volume growth
- Long-Range Percolation Mixing Time
- Maximum flows and minimum cuts in the plane
- Scalable learning and inference in Markov logic networks
- Rates of convergence for Gibbs sampling in the analysis of almost exchangeable data
- The mixing time of Glauber dynamics for coloring regular trees
- Dynamic normal forms and dynamic characteristic polynomial
- Opinion dynamics in social networks with stubborn agents: equilibrium and convergence rate
- Strong stationary duality for continuous-time Markov chains. I: Theory
- Convergence of independent particle systems
- Subset Glauber dynamics on graphs, hypergraphs and matroids of bounded tree-width
- The smallest eigenvalue for reversible Markov chains
- Fixed Precision MCMC Estimation by Median of Products of Averages
- Upper bounds on algebraic connectivity via convex optimization
- Quantum ergodicity on graphs: from spectral to spatial delocalization
- Ollivier's Ricci curvature, local clustering and curvature-dimension inequalities on graphs
- Aging in metropolis dynamics of the REM: a proof
- On quantitative convergence to quasi-stationarity
- Analyzing Glauber dynamics by comparison of Markov chains
- Dobrushin Conditions and Systematic Scan
- Isoperimetric inequalities and Markov chains
- Multiscale diffusion processes with periodic coefficients and an application to solute transport in porous media
- Maximum flows and minimum cuts in the plane
- Aging of the Metropolis dynamics on the random energy model
- What do we know about the Metropolis algorithm?
- A new upper bound for the isoperimetric number of de Bruijn networks
- An Extension of the Metropolis Algorithm
- Evaluation of formal posterior distributions via Markov chain arguments
- A one-dimensional coagulation-fragmentation process with a dynamical phase transition
- On nodal domains and higher-order Cheeger inequalities of finite reversible Markov processes
- A cycle-based bound for subdominant eigenvalues of stochastic matrices
- Spectral and graph-theoretic bounds on steady-state-probability estimation performance for an ergodic Markov chain
- Normalized graph Laplacians for directed graphs
- Optimizing the asymptotic convergence rate of the Diaconis-Holmes-Neal sampler
- Walks on generating sets of Abelian groups
- Spectral gap for the zero range process with constant rate
- Convergence rate for predictive recursion estimation of finite mixtures
- A note on the relaxation time of two Markov chains on rooted phylogenetic tree spaces
- Nash inequalities for finite Markov chains
- On the two-dimensional dynamical Ising model in the phase coexistence region
- Algebraic algorithms for sampling from conditional distributions
- Analytic proof of dual variational formula for the first eigenvalue in dimension one
- Speed of convergence to equilibrium and to normality for diffusions with multiple periodic scales
- Logarithmic Sobolev inequalities for finite Markov chains
- The state reduction and related algorithms and their applications to the study of Markov chains, graph theory, and the optimal stopping problem
- Mixing times for the simple exclusion process with open boundaries
- Dynamics of \((2+1)\)-dimensional SOS surfaces above a wall: slow mixing induced by entropic repulsion
This page was built for publication: Geometric bounds for eigenvalues of Markov chains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q808102)
