A semidefinite bound for mixing rates of Markov chains

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1084, Issue , 1996, Pages 190-203

  Kahale, Nabil ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL OPTIMIZATION; MARKOV PROCESSES; POLYNOMIAL APPROXIMATION;

ARBITRARY PRECISION; LENGTH FUNCTIONS; MIXING RATES; MULTI-COMMODITY FLOW; POLYNOMIAL-TIME; SEMI-DEFINITE PROGRAMMING; SEMIDEFINITE BOUNDS; VARIABLE LENGTH;

INTEGER PROGRAMMING;

EID: 84947909878     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61310-2_15     Document Type: Conference Paper

References (18)

1. D. Aldous. Reversible Markov Chains and random walks on graphs. Book in preparation.
2. P. Diaconis and L. Saloff-Coste. Personal Communication, 1995.
3. P. Diaconis and L. Saloff-Coste. Comparison theorems for reversible Markov Chains. The Annals of Applied Probability, 3:696-730, 1993.
4. P. Diaconis and Ł. Saloff-Coste, What do we know about the Metropolis algorithm? In 27th Annual ACM Symposium on Theory of Computing, pages 112-129. ACM Press, 1995.
5. P. Diaconis and D. Stroock. Geometric bounds for eigenvalues of Markov Chains. The Annals of Applied Probability, 1:36-61, 1991.
6. J. Fill. Unpublished manuscript, July 1990.
7. J. Fill. Eigenvalue bounds on convergence to stationarity for nonreversible markov chains with an application to the exclusion process. The Annals of Applied Probability, 1:62-87, 1991.
8. M. R. Garey and D. S. Johnson. Computers and intractability: a guide to the theory of NP-completeness. Freeman and Company, San Fransisco, 1979.
9. M. Grötschel, L. Lovász, and A. Schrijver. The ellipsoid method and its consequences in combinatorial optimization. Combinatorial, 1:169-197, 1981.
10. M. Jerrum and A. Sinclair. Approximating the permanent. SIAM J. on Comput., 18:1149-1178, 1989.
11. N. Linial, E. London, and Y. Rabinovich. The geometry of graphs and some of its algorithmic applications. Combinatorica, 15:215-245, 1995.
12. L. Lovász and M. Simonovits. Random walks in a convex body and an improved volume algorithm. Random Strutures & Algorithms, 4(4):359-412, 1993.
13. E. Seneta. Non-negative matrices and Markov Chains. Springer-Verlag, 1981.
14. A. Sinclair. Improved bounds for mixing rates of Markov Chains and multicommodity fiow. Combinatorics, Probability and Computing, 1:351-370, 1992.
15. A. Sinclair and M. Jerrum. Approximate counting, uniform generation, and rapidly mixing Markov Chains. Information and Computation, 82:93-113, 1989.
16. A. D. Sokal. Optimal Poincaré inequalities for the spectra of Markov Chains. Unpublished manuscript, September 1992.
17. L. Vandenberghe and S. Boyd. Semidefinite programming. SIAM Review, 1995. To appear.
18. G. A. Watson. Characterization of the subdifferential of some matrix norms. Linear Algebra and Appl., 170:33-45, 1992.