Pages that link to "Item:Q808102"

The following pages link to Geometric bounds for eigenvalues of Markov chains (Q808102):

Displaying 50 items.

• Choosing a random spanning subtree: A case study (Q1181414) (← links)
• Strong stationary duality for continuous-time Markov chains. I: Theory (Q1185795) (← links)
• Expectations for nonreversible Markov chains (Q1270857) (← links)
• Simulated annealing with time-dependent energy function via Sobolev inequalities (Q1272167) (← links)
• Relaxation of product Markov chains on product spaces (Q1273731) (← links)
• What do we know about the Metropolis algorithm? (Q1273859) (← links)
• Comparing eigenvalue bounds for Markov chains: When does Poincaré beat Cheeger? (Q1296583) (← links)
• The spectral gap of the REM under Metropolis dynamics (Q1296612) (← links)
• Piecewise constant triangular cooling schedules for generalized simulated annealing algorithms (Q1296737) (← links)
• The state reduction and related algorithms and their applications to the study of Markov chains, graph theory, and the optimal stopping problem (Q1304617) (← links)
• Finite approximations to the critical reversible nearest particle system (Q1307463) (← links)
• Comparison theorems for reversible Markov chains (Q1308697) (← links)
• Asymptotic behaviour of time-inhomogeneous evolutions on von Neumann algebras (Q1318890) (← links)
• Slow droplet-driven relaxation of stochastic Ising models in the vicinity of the phase coexistence region (Q1325572) (← links)
• Moderate growth and random walk on finite groups (Q1326533) (← links)
• Coupling, spectral gap and related topics. II (Q1375818) (← links)
• A new upper bound for the isoperimetric number of de Bruijn networks (Q1375854) (← links)
• Admissibility in quadratically regular problems and recurrence of symmetric Markov chains: Why the connection? (Q1378814) (← links)
• A rapidly mixing stochastic system of finite interacting particles on the circle (Q1382526) (← links)
• Algebraic convergence of Markov chains (Q1413683) (← links)
• Honest exploration of intractable probability distributions via Markov chain Monte Carlo. (Q1431211) (← links)
• A discipline of evolutionary programming (Q1575454) (← links)
• Importance sampling for families of distributions (Q1578598) (← links)
• Multiscale diffusion processes with periodic coefficients and an application to solute transport in porous media (Q1578604) (← links)
• Decay of correlations for piecewise expanding maps. (Q1593190) (← links)
• Speed of convergence to equilibrium and to normality for diffusions with multiple periodic scales (Q1593610) (← links)
• Bounds on regeneration times and convergence rates for Markov chains (Q1593619) (← links)
• Reversible algorithm of simulating multivariate densities with multi-hump (Q1609649) (← links)
• Security from the adversary's inertia-controlling convergence speed when playing mixed strategy equilibria (Q1630490) (← links)
• Spectral gap of random hyperbolic graphs and related parameters (Q1650095) (← links)
• Random cluster dynamics for the Ising model is rapidly mixing (Q1650104) (← links)
• The effect of boundary conditions on mixing of 2D Potts models at discontinuous phase transitions (Q1663879) (← links)
• The normalized Laplacian spectrum of subdivisions of a graph (Q1733531) (← links)
• A framework for imperfectly observed networks (Q1756569) (← links)
• Efficiency test of pseudorandom number generators using random walks (Q1765462) (← links)
• Eigenvalue bounds on restrictions of reversible nearly uncoupled Markov chains (Q1774996) (← links)
• On the control of opinion dynamics in social networks (Q1782950) (← links)
• Sensitivity analysis of a railway station track layout with respect to a given timetable (Q1806663) (← links)
• Algebraic algorithms for sampling from conditional distributions (Q1807063) (← links)
• The smallest eigenvalue for reversible Markov chains (Q1826846) (← links)
• Random walks on a finite graph with congestion points (Q1827003) (← links)
• Optimization problems for weighted graphs and related correlation estimates (Q1827724) (← links)
• Finding optimal routings in Hamming graphs (Q1864615) (← links)
• Markov chain decomposition for convergence rate analysis (Q1872401) (← links)
• Applications of geometric bounds to the convergence rate of Markov chains on \(\mathbb R^ {n}\). (Q1877387) (← links)
• Extreme eigenfunctions of adjacency matrices for planar graphs employed in spatial analyses (Q1881069) (← links)
• An empirical study of policy convergence in Markov decision process value iteration (Q1886733) (← links)
• An adaptive simulated annealing algorithm. (Q1888770) (← links)
• Note on the knapsack Markov chain. (Q1888773) (← links)
• Convergence of independent particle systems (Q1890702) (← links)