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.
- A note on geometric bounds for eigenvalues (Q2250780) (← links)
- The convergence rate of the Gibbs sampler for generalized 1-D Ising model (Q2273720) (← links)
- Flocking with general local interaction and large population (Q2287365) (← links)
- Metropolis-Hastings reversiblizations of non-reversible Markov chains (Q2289820) (← links)
- Convergence time to equilibrium of the Metropolis dynamics for the GREM (Q2302656) (← links)
- A note on Sobolev type inequalities on graphs with polynomial volume growth (Q2316823) (← links)
- Quantum ergodicity on graphs: from spectral to spatial delocalization (Q2320600) (← links)
- Consistent estimation of the spectrum of trace class data augmentation algorithms (Q2325394) (← links)
- A version of Aldous' spectral-gap conjecture for the zero range process (Q2330459) (← links)
- Opinion dynamics in social networks with stubborn agents: equilibrium and convergence rate (Q2342451) (← links)
- Invariance principle for the random conductance model in a degenerate ergodic environment (Q2354153) (← links)
- Network cohesion (Q2363420) (← links)
- Uniform upper bound of the second largest eigenvalue of stochastic matrices with equal-neighbor rule (Q2411420) (← links)
- Aging in metropolis dynamics of the REM: a proof (Q2416556) (← links)
- Randomized scheduling algorithm for queueing networks (Q2428047) (← links)
- A note on the relaxation time of two Markov chains on rooted phylogenetic tree spaces (Q2444407) (← links)
- The dual Cheeger constant and spectra of infinite graphs (Q2445372) (← links)
- On asymptotics for Vaserstein coupling of Markov chains (Q2447721) (← links)
- On perturbation bounds for continuous-time Markov chains (Q2453875) (← links)
- Optimizing the asymptotic convergence rate of the Diaconis-Holmes-Neal sampler (Q2455515) (← links)
- A Markov chain sampler for contingency table exact inference (Q2488380) (← links)
- Analysis of top to bottom-\(k\) shuffles (Q2494572) (← links)
- Systematic scan for sampling colorings (Q2494577) (← links)
- Capacity of an associative memory model on random graph architectures (Q2515521) (← links)
- A dynamic programming approach to efficient sampling from Boltzmann distributions (Q2517788) (← links)
- Logarithmic Sobolev inequalities for finite Markov chains (Q2564686) (← links)
- Spectral homogenization of reversible random walks on \(\mathbb Z^d\) in a random environment. (Q2574547) (← links)
- On swapping and simulated tempering algorithms. (Q2574553) (← links)
- Monte Carlo algorithms for computing \(\alpha \)-permanents (Q2631360) (← links)
- Some remarks on replicated simulated annealing (Q2659822) (← links)
- Geometric bounds for convergence rates of averaging algorithms (Q2672273) (← links)
- Self-testing algorithms for self-avoiding walks (Q2737885) (← links)
- Analyzing Glauber dynamics by comparison of Markov chains (Q2737887) (← links)
- Markov Chain Approach to Probabilistic Guidance for Swarms of Autonomous Agents (Q2813952) (← links)
- Mixing times for the Swapping Algorithm on the Blume-Emery-Griffiths model (Q2877769) (← links)
- Comparisons of Three Approaches for Discrete Conditional Models (Q2905713) (← links)
- 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)