Pages that link to "Item:Q808102"
From MaRDI portal
The following pages link to Geometric bounds for eigenvalues of Markov chains (Q808102):
Displayed 50 items.
- The mixing time of Glauber dynamics for coloring regular trees (Q3057064) (← links)
- Error bounds for computing the expectation by Markov chain Monte Carlo (Q3068187) (← links)
- Bounds for the second largest eigenvalue of a transition matrix (Q3090723) (← links)
- Fastest mixing Markov chain problem for the union of two cliques (Q3090727) (← links)
- Strong Spatial Mixing and Rapid Mixing with Five Colours for the Kagome Lattice (Q3091978) (← links)
- The exit path of a Markov chain with rare transitions (Q3127365) (← links)
- Generalization of discrete-time geometric bounds to convergence rate of Markov processes on R<sup><i>n</i></sup> (Q3147441) (← links)
- Diffusions on graphs, Poisson problems and spectral geometry (Q3151270) (← links)
- Convergence in the Wasserstein Metric for Markov Chain Monte Carlo Algorithms with Applications to Image Restoration (Q3157863) (← links)
- Ordering in voter models on networks: exact reduction to a single-coordinate diffusion (Q3161086) (← links)
- Sampling Edge Covers in 3-Regular Graphs (Q3182920) (← links)
- Dynamic Phase Diagram of the REM (Q3296411) (← links)
- Simulated annealing for tensor network states (Q3387033) (← links)
- A monotonicity in reversible Markov chains (Q3410928) (← links)
- Distributed Optimization in Networking: Recent Advances in Combinatorial and Robust Formulations (Q3454971) (← links)
- The Quantum Complexity of Markov Chain Monte Carlo (Q3507468) (← links)
- Long-Range Percolation Mixing Time (Q3527537) (← links)
- Maximum Flows and Minimum Cuts in the Plane (Q3565455) (← links)
- Random walks on the vertices of transportation polytopes with constant number of sources (Q3608299) (← links)
- A cycle-based bound for subdominant eigenvalues of stochastic matrices (Q3625587) (← links)
- Geometric Approaches to the Estimation of the Spectral Gap of Reversible Markov Chains (Q4289296) (← links)
- Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow (Q4291194) (← links)
- Estimation of spectral gap for Markov chains (Q4332300) (← links)
- A hierarchy of gaussian and non-gaussian asymptotics of a class of Fokker-Planck equations with multiple scales (Q4378456) (← links)
- Rate of convergence of the Swendsen-Wang dynamics in image segmentation problems: a theoretical and experimental study (Q4386046) (← links)
- Une variante de l'inégalité de Cheeger pour les chaînes de Markov finies (Q4386347) (← links)
- Estimate of exponential convergence rate in total variation by spectral gap (Q4391489) (← links)
- Markov-chain monte carlo: Some practical implications of theoretical results (Q4399495) (← links)
- Conductance bounds on the <i>L</i><sup>2</sup> convergence rate of Metropolis algorithms on unbounded state spaces (Q4464174) (← links)
- A hierarchical method for obtaining eigenvalue enclosures (Q4501034) (← links)
- Right order spectral gap estimates for generating sets of ℤ<sub>4</sub> (Q4543629) (← links)
- Optimal Variance Reduction for Markov Chain Monte Carlo (Q4581261) (← links)
- Achieving Geometric Convergence for Distributed Optimization Over Time-Varying Graphs (Q4602346) (← links)
- (Q4638090) (← links)
- A note on random walks with absorbing barriers and sequential Monte Carlo methods (Q4639177) (← links)
- A semidefinite bound for mixing rates of Markov chains (Q4645923) (← links)
- Functional inequalities for discrete gradients and application to the geometric distribution (Q4671810) (← links)
- An Extension of the Metropolis Algorithm (Q4678836) (← links)
- An Almost <i>m</i>-wise Independent Random Permutation of the Cube (Q4715261) (← links)
- Extremal first passage times for trees (Q4762930) (← links)
- Improved bounds for the large-time behaviour of simulated annealing (Q4819508) (← links)
- Stability and exponential convergence of continuous-time Markov chains (Q4819509) (← links)
- Isoperimetric Inequalities and Decay of Iterated Kernels for Almost-transitive Markov Chains (Q4868739) (← links)
- Remarks and open problems on the minimum permanent of acyclic doubly stochastic matrices (Q4908206) (← links)
- Rapid mixing for lattice colourings with fewer colours (Q4968808) (← links)
- Mixing of MCMC algorithms (Q5107455) (← links)
- Mod-ϕ Convergence, II: Estimates on the Speed of Convergence (Q5126533) (← links)
- (Q5214254) (← links)
- Generalized quasirandom properties of expanding graph sequences (Q5216273) (← links)
- A Decomposition Based Proof for Fast Mixing of a Markov Chain over Balanced Realizations of a Joint Degree Matrix (Q5251622) (← links)