{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:12:30Z","timestamp":1725664350888},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540613107"},{"type":"electronic","value":"9783540684534"}],"license":[{"start":{"date-parts":[[1996,1,1]],"date-time":"1996-01-01T00:00:00Z","timestamp":820454400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61310-2_15","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T16:26:36Z","timestamp":1330273596000},"page":"190-203","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A semidefinite bound for mixing rates of Markov chains"],"prefix":"10.1007","author":[{"given":"Nabil","family":"Kahale","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,3]]},"reference":[{"key":"15_CR1","unstructured":"D. Aldous. Reversible Markov Chains and random walks on graphs. Book in preparation."},{"key":"15_CR2","unstructured":"P. Diaconis and L. Saloff-Coste. Personal Communication, 1995."},{"key":"15_CR3","doi-asserted-by":"crossref","first-page":"696","DOI":"10.1214\/aoap\/1177005359","volume":"3","author":"P. Diaconis","year":"1993","unstructured":"P. Diaconis and L. Saloff-Coste. Comparison theorems for reversible Markov Chains. The Annals of Applied Probability, 3:696\u2013730, 1993.","journal-title":"The Annals of Applied Probability"},{"key":"15_CR4","doi-asserted-by":"crossref","unstructured":"P. Diaconis and L. Saloff-Coste. What do we know about the Metropolis algorithm? In 27th Annual ACM Symposium on Theory of Computing, pages 112\u2013129. ACM Press, 1995.","DOI":"10.1145\/225058.225095"},{"key":"15_CR5","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1214\/aoap\/1177005980","volume":"1","author":"P. Diaconis","year":"1991","unstructured":"P. Diaconis and D. Stroock. Geometric bounds for eigenvalues of Markov Chains. The Annals of Applied Probability, 1:36\u201361, 1991.","journal-title":"The Annals of Applied Probability"},{"key":"15_CR6","unstructured":"J. Fill. Unpublished manuscript, July 1990."},{"key":"15_CR7","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1214\/aoap\/1177005981","volume":"1","author":"J. Fill","year":"1991","unstructured":"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\u201387, 1991.","journal-title":"The Annals of Applied Probability"},{"key":"15_CR8","volume-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"M. R. Garey","year":"1979","unstructured":"M. R. Garey and D. S. Johnson. Computers and intractability: a guide to the theory of NP-completeness. Freeman and Company, San Fransisco, 1979."},{"key":"15_CR9","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/BF02579273","volume":"1","author":"M. Gr\u00f6tschel","year":"1981","unstructured":"M. Gr\u00f6tschel, L. Lov\u00e1sz, and A. Schrijver. The ellipsoid method and its consequences in combinatorial optimization. Combinatorica, 1:169\u2013197, 1981.","journal-title":"Combinatorica"},{"key":"15_CR10","doi-asserted-by":"publisher","first-page":"1149","DOI":"10.1137\/0218077","volume":"18","author":"M. Jerrum","year":"1989","unstructured":"M. Jerrum and A. Sinclair. Approximating the permanent. SIAM J. on Comput., 18:1149\u20131178, 1989.","journal-title":"SIAM J. on Comput."},{"key":"15_CR11","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/BF01200757","volume":"15","author":"N. Linial","year":"1995","unstructured":"N. Linial, E. London, and Y. Rabinovich. The geometry of graphs and some of its algorithmic applications. Combinatorica, 15:215\u2013245, 1995.","journal-title":"Combinatorica"},{"issue":"4","key":"15_CR12","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1002\/rsa.3240040402","volume":"4","author":"L. Lov\u00e1sz","year":"1993","unstructured":"L. Lov\u00e1sz and M. Simonovits. Random walks in a convex body and an improved volume algorithm. Random Strutures & Algorithms, 4(4):359\u2013412, 1993.","journal-title":"Random Strutures & Algorithms"},{"key":"15_CR13","doi-asserted-by":"crossref","unstructured":"E. Seneta. Non-negative matrices and Markov Chains. Springer-Verlag, 1981.","DOI":"10.1007\/0-387-32792-4"},{"key":"15_CR14","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1017\/S0963548300000390","volume":"1","author":"A. Sinclair","year":"1992","unstructured":"A. Sinclair. Improved bounds for mixing rates of Markov Chains and multicommodity flow. Combinatorics, Probability and Computing, 1:351\u2013370, 1992.","journal-title":"Combinatorics, Probability and Computing"},{"key":"15_CR15","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/0890-5401(89)90067-9","volume":"82","author":"A. Sinclair","year":"1989","unstructured":"A. Sinclair and M. Jerrum. Approximate counting, uniform generation, and rapidly mixing Markov Chains. Information and Computation, 82:93\u2013113, 1989.","journal-title":"Information and Computation"},{"key":"15_CR16","unstructured":"A. D. Sokal. Optimal Poincar\u00e9 inequalities for the spectra of Markov Chains. Unpublished manuscript, September 1992."},{"key":"15_CR17","doi-asserted-by":"crossref","unstructured":"L. Vandenberghe and S. Boyd. Semidefinite programming. SIAM Review, 1995. To appear.","DOI":"10.1137\/1038003"},{"key":"15_CR18","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/0024-3795(92)90407-2","volume":"170","author":"G. A. Watson","year":"1992","unstructured":"G. A. Watson. Characterization of the subdiflerential of some matrix norms. Linear Algebra and Appl., 170:33\u201345, 1992.","journal-title":"Linear Algebra and Appl."}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61310-2_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T08:48:07Z","timestamp":1558255687000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61310-2_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540613107","9783540684534"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-61310-2_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]},"assertion":[{"value":"3 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}