Fastest Mixing Markov Chain on a Graph
Top Cited Papers
- 1 January 2004
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Review
- Vol. 46 (4) , 667-689
- https://doi.org/10.1137/s0036144503423264
Abstract
No abstract availableThis publication has 28 references indexed in Scilit:
- Symmetric dual nonlinear programming and matrix game equivalenceJournal of Mathematical Analysis and Applications, 2004
- Interior‐point method for non‐linear non‐convex optimizationNumerical Linear Algebra with Applications, 2004
- A Geometric Interpretation of the Metropolis-Hastings AlgorithmStatistical Science, 2001
- Solving Large-Scale Sparse Semidefinite Programs for Combinatorial OptimizationSIAM Journal on Optimization, 2000
- What Do We Know about the Metropolis Algorithm ?Journal of Computer and System Sciences, 1998
- Algebraic algorithms for sampling from conditional distributionsThe Annals of Statistics, 1998
- Logarithmic Sobolev inequalities for finite Markov chainsThe Annals of Applied Probability, 1996
- Interior Point Methods in Semidefinite Programming with Applications to Combinatorial OptimizationSIAM Journal on Optimization, 1995
- Geometric Bounds for Eigenvalues of Markov ChainsThe Annals of Applied Probability, 1991
- The minimization of certain nondifferentiable sums of eigenvalues of symmetric matricesPublished by Springer Nature ,1975