Fastest Mixing Markov Chain on a Path
From MaRDI portal
Recommendations
Cited in
(26)- The complete positivity of symmetric tridiagonal and pentadiagonal matrices
- Augmented Lagrangian methods for convex matrix optimization problems
- On the fastest finite Markov processes
- Fastest mixing reversible Markov chain on friendship graph: trade-off between transition probabilities among friends and convergence rate
- Optimizing the asymptotic convergence rate of the Diaconis-Holmes-Neal sampler
- Lifting Markov chains to speed up mixing
- Rapid mixing and Markov bases
- Random doubly stochastic tridiagonal matrices
- Random walks colliding before getting trapped
- Fastest mixing Markov chain problem for the union of two cliques
- Fastest mixing Markov chain on graphs with symmetries
- Comparison inequalities and fastest-mixing Markov chains
- Quadratic growth conditions for convex matrix optimization problems associated with spectral functions
- Linear time average consensus and distributed optimization on fixed graphs
- Fastest Mixing Markov Chain on a Graph
- Remarks and open problems on the minimum permanent of acyclic doubly stochastic matrices
- Fastest random walk on a path
- Nonreversible Jump Algorithms for Bayesian Nested Model Selection
- Random Walks, Directed Cycles, and Markov Chains
- A semismooth Newton-CG based dual PPA for matrix spectral norm approximation problems
- Fastest expected time to mixing for a Markov chain on a directed graph
- Geometric bounds on the fastest mixing Markov chain
- Metropolis-Hastings transition kernel couplings
- Cheeger's inequalities for vertex expansion and reweighted eigenvalues
- Inequalities for the spectra of symmetric doubly stochastic matrices
- On some aspects of perturbation analysis for matrix cone optimization induced by spectral norm
This page was built for publication: Fastest Mixing Markov Chain on a Path
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5440760)
