The Fastest Mixing Markov Process on a Graph and a Connection to a Maximum Variance Unfolding Problem
- 1 January 2006
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Review
- Vol. 48 (4) , 681-699
- https://doi.org/10.1137/s0036144504443821
Abstract
No abstract availableThis publication has 19 references indexed in Scilit:
- Fastest Mixing Markov Chain on a PathThe American Mathematical Monthly, 2006
- Fastest Mixing Markov Chain on a GraphSIAM Review, 2004
- Where Best to Hold a Drum FastSIAM Journal on Optimization, 1999
- CSDP, A C library for semidefinite programmingOptimization Methods and Software, 1999
- Logarithmic Sobolev inequalities for finite Markov chainsThe Annals of Applied Probability, 1996
- Convex Analysis on the Hermitian MatricesSIAM Journal on Optimization, 1996
- Eigenvalue optimizationActa Numerica, 1996
- Some minimax problems for graphsDiscrete Mathematics, 1993
- On the Optimal Design of Columns Against BucklingSIAM Journal on Mathematical Analysis, 1992
- Absolute algebraic connectivity of treesLinear and Multilinear Algebra, 1990