Fastest Mixing Markov Chain on a Path
From MaRDI portal
Publication:5440760
DOI10.2307/27641840zbMath1135.60046OpenAlexW4236352634MaRDI QIDQ5440760
No author found.
Publication date: 5 February 2008
Published in: The American Mathematical Monthly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/27641840
Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Paths and cycles (05C38) Combinatorial probability (60C05)
Related Items (16)
Nonreversible Jump Algorithms for Bayesian Nested Model Selection ⋮ Augmented Lagrangian methods for convex matrix optimization problems ⋮ Inequalities for the spectra of symmetric doubly stochastic matrices ⋮ Comparison inequalities and fastest-mixing Markov chains ⋮ On some aspects of perturbation analysis for matrix cone optimization induced by spectral norm ⋮ Quadratic Growth Conditions for Convex Matrix Optimization Problems Associated with Spectral Functions ⋮ Linear Time Average Consensus and Distributed Optimization on Fixed Graphs ⋮ Geometric bounds on the fastest mixing Markov chain ⋮ Optimizing the asymptotic convergence rate of the Diaconis-Holmes-Neal sampler ⋮ Remarks and open problems on the minimum permanent of acyclic doubly stochastic matrices ⋮ A semismooth Newton-CG based dual PPA for matrix spectral norm approximation problems ⋮ Fastest mixing Markov chain problem for the union of two cliques ⋮ Random doubly stochastic tridiagonal matrices ⋮ The complete positivity of symmetric tridiagonal and pentadiagonal matrices ⋮ Random Walks, Directed Cycles, and Markov Chains ⋮ Fastest random walk on a path
This page was built for publication: Fastest Mixing Markov Chain on a Path
