Geometric bounds for eigenvalues of Markov chains
From MaRDI portal
(Redirected from Publication:808102)
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)- Fixed Precision MCMC Estimation by Median of Products of Averages
- On the number of Eulerian orientations of a graph
- Bounds for the Kirchhoff index via majorization techniques
- Opinion dynamics in social networks with stubborn agents: equilibrium and convergence rate
- Self-testing algorithms for self-avoiding walks
- The swapping algorithm for the Hopfield model with two patterns
- The Quantum Complexity of Markov Chain Monte Carlo
- Explicit bounds for spectral theory of geometrically ergodic Markov kernels and applications
- Curvature, diameter and signs of graphs
- A general class of Markov processes with explicit matrix-geometric solutions
- Network cohesion
- The spatial smoothing method of clock synchronization in wireless networks
- Diffusions on graphs, Poisson problems and spectral geometry
- Functional inequalities for discrete gradients and application to the geometric distribution
- The long-run behavior of Markov chains
- Ordering in voter models on networks: exact reduction to a single-coordinate diffusion
- Improved bounds for the large-time behaviour of simulated annealing
- Long-Range Percolation Mixing Time
- Achieving Geometric Convergence for Distributed Optimization Over Time-Varying Graphs
- Homophily outlier detection in non-IID categorical data
- Spectral gap of random hyperbolic graphs and related parameters
- 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
- Time-Inhomogeneous Diffusion Geometry and Topology
- Mod-\(\phi\) convergence. II: Estimates on the speed of convergence
- Subset Glauber dynamics on graphs, hypergraphs and matroids of bounded tree-width
- Asymptotic optimality of isoperimetric constants
- Aging of the Metropolis dynamics on the random energy model
- Log-concave polynomials. II: High-dimensional walks and an FPRAS for counting bases of a matroid
- Constructing optimal transition matrix for Markov chain Monte Carlo
- Mixing times for the simple exclusion process with open boundaries
- An empirical study of policy convergence in Markov decision process value iteration
- Stability and exponential convergence of continuous-time Markov chains
- Generalization of discrete-time geometric bounds to convergence rate of Markov processes on Rn
- Analytic proof of dual variational formula for the first eigenvalue in dimension one
- Comparisons of three approaches for discrete conditional models
- Poisson approximations for Markov-driven point processes
- Nash inequalities for finite Markov chains
- Geometric bounds for convergence rates of averaging algorithms
- On improved bounds and conditions for the convergence of Markov chains
- Asymptotic behaviour of time-inhomogeneous evolutions on von Neumann algebras
- Explicit error bounds for lazy reversible Markov chain Monte Carlo
- Importance sampling for families of distributions
- Comparison theorems for reversible Markov chains
- Bounds on regeneration times and convergence rates for Markov chains
- Invariance principle for the random conductance model in a degenerate ergodic environment
- Finding optimal routings in Hamming graphs
- Multi-way dual Cheeger constants and spectral bounds of graphs
- A version of Aldous' spectral-gap conjecture for the zero range process
- Aging in metropolis dynamics of the REM: a proof
- Piecewise constant triangular cooling schedules for generalized simulated annealing algorithms
- On the rate of convergence of the Gibbs sampler for the 1-D Ising model by geometric bound
- Some remarks on replicated simulated annealing
- Spectral partitioning works: planar graphs and finite element meshes
- Obtaining a linear combination of the principal components of a matrix on quantum computers
- Honest exploration of intractable probability distributions via Markov chain Monte Carlo.
- Logarithmic Sobolev, isoperimetry and transport inequalities on graphs
- The convergence rate of the Gibbs sampler for generalized 1-D Ising model
- On perturbation bounds for continuous-time Markov chains
- Distributions of values of indefinite forms and higher-order spectral estimates for finite Markov chains.
- The effect of boundary conditions on mixing of 2D Potts models at discontinuous phase transitions
- Multiscale diffusion processes with periodic coefficients and an application to solute transport in porous media
- Exponential convergence for attractive reversible subcritical nearest particle systems
- A Decomposition Based Proof for Fast Mixing of a Markov Chain over Balanced Realizations of a Joint Degree Matrix
- Algebraic algorithms for sampling from conditional distributions
- Markov-chain monte carlo: Some practical implications of theoretical results
- Rapid mixing for lattice colourings with fewer colours
- Rates of convergence of some multivariate Markov chains with polynomial eigenfunctions
- Choosing a random spanning subtree: A case study
- A note on geometric bounds for eigenvalues
- Right order spectral gap estimates for generating sets of ℤ4
- Maximum flows and minimum cuts in the plane
- Finite-Time Behavior of Slowly Cooled Annealing Chains
- Geometric Approaches to the Estimation of the Spectral Gap of Reversible Markov Chains
- Dynamic normal forms and dynamic characteristic polynomial
- Rates of convergence for Gibbs sampling in the analysis of almost exchangeable data
- Sensitivity analysis of a railway station track layout with respect to a given timetable
- Flocking with general local interaction and large population
- Dimension spectrum of Axiom A diffeomorphisms. I: The Bowen-Margulis measure
- Markov chain approach to probabilistic guidance for swarms of autonomous agents
- Strong stationary duality for continuous-time Markov chains. I: Theory
- The dual Cheeger constant and spectra of infinite graphs
- The exit path of a Markov chain with rare transitions
- Simulated annealing for tensor network states
- Estimate of exponential convergence rate in total variation by spectral gap
- Applications of geometric bounds to the convergence rate of Markov chains on \(\mathbb R^ {n}\).
- A note on Markov normalized magnetic eigenmaps
- Exact and asymptotic results on coarse Ricci curvature of graphs
- Spectral homogenization of reversible random walks on \(\mathbb Z^d\) in a random environment.
- Oja's algorithm for graph clustering, Markov spectral decomposition, and risk sensitive control
- Comparing eigenvalue bounds for Markov chains: When does Poincaré beat Cheeger?
- When does allow the Hardy inequality to calculate an exact Poincaré constant on a line?
- A discipline of evolutionary programming
- Geometric inequalities for the eigenvalues of concentrated Markov chains
- An Extension of the Metropolis Algorithm
- Bounds for the second largest eigenvalue of a transition matrix
- Remarks and open problems on the minimum permanent of acyclic doubly stochastic matrices
- Convergence rate of Markov chain methods for genomic motif discovery
- What do we know about the Metropolis algorithm?
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)
