{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,25]],"date-time":"2025-09-25T18:06:42Z","timestamp":1758823602464},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2012,4,18]],"date-time":"2012-04-18T00:00:00Z","timestamp":1334707200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2013,7]]},"DOI":"10.1007\/s00373-012-1175-x","type":"journal-article","created":{"date-parts":[[2012,4,17]],"date-time":"2012-04-17T07:29:24Z","timestamp":1334647764000},"page":"757-772","source":"Crossref","is-referenced-by-count":9,"title":["Exact Mixing Times for Random Walks on Trees"],"prefix":"10.1007","volume":"29","author":[{"given":"Andrew","family":"Beveridge","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Meng","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,4,18]]},"reference":[{"key":"1175_CR1","unstructured":"Aldous, D., Fill, J.: Reversible Markov Chains and Random Walks on Graphs. http:\/\/www.stat.berkeley.edu\/~aldous\/RWG\/book.html . Accessed 9 Aug 2010"},{"key":"1175_CR2","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/S0304-4149(97)00037-9","volume":"71","author":"D. Aldous","year":"1997","unstructured":"Aldous D., Lov\u00e1sz L., Winkler P.: Mixing times for uniformly ergodic Markov chains. Stoch. Process. Appl. 71, 165\u2013185 (1997)","journal-title":"Stoch. Process. Appl."},{"issue":"1","key":"1175_CR3","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1137\/070687402","volume":"23","author":"A. Beveridge","year":"2009","unstructured":"Beveridge A.: Centers for random walks on trees. SIAM J. Discrete Math. 23(1), 300\u2013318 (2009)","journal-title":"SIAM J. Discrete Math."},{"key":"1175_CR4","doi-asserted-by":"crossref","first-page":"541","DOI":"10.1017\/S0963548310000118","volume":"19","author":"A. Beveridge","year":"2010","unstructured":"Beveridge A., Lov\u00e1sz L.: Exit frequency matrices for finite Markov chains. Combin. Probab. Comput. 19, 541\u2013560 (2010)","journal-title":"Combin. Probab. Comput."},{"issue":"3","key":"1175_CR5","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1002\/rsa.3240010303","volume":"1","author":"G. Brightwell","year":"1990","unstructured":"Brightwell G., Winkler P.: Maximum hitting time for random walks on graphs. Random Struct. Algorithms 1(3), 263\u2013276 (1990)","journal-title":"Random Struct. Algorithms"},{"issue":"5","key":"1175_CR6","doi-asserted-by":"crossref","first-page":"547","DOI":"10.1002\/jgt.3190140505","volume":"14","author":"G. Brightwell","year":"1990","unstructured":"Brightwell G., Winkler P.: Extremal cover time for random walks on trees. J. Graph Theory 14(5), 547\u2013554 (1990)","journal-title":"J. Graph Theory"},{"issue":"3","key":"1175_CR7","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1137\/0406029","volume":"6","author":"D. Coppersmith","year":"1993","unstructured":"Coppersmith D., Tetali P., Winkler P.: Collisions among random walks on a graph. SIAM J. Discrete Math. 6(3), 363\u2013374 (1993)","journal-title":"SIAM J. Discrete Math."},{"issue":"4","key":"1175_CR8","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1002\/rsa.3240060406","volume":"6","author":"U. Feige","year":"1995","unstructured":"Feige U.: A tight lower bound on the cover time for random walks on graphs. Random Struct. Algorithms 6(4), 433\u2013438 (1995)","journal-title":"Random Struct. Algorithms"},{"key":"1175_CR9","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511613586","volume-title":"Finite Markov Chains and Algorithmic Applications","author":"O. H\u00e4ggstr\u00f6m","year":"2002","unstructured":"H\u00e4ggstr\u00f6m O.: Finite Markov Chains and Algorithmic Applications. Cambridge University Press, Cambridge (2002)"},{"key":"1175_CR10","unstructured":"Lov\u00e1sz, L.: Random walks on graphs: a survey. In: Mikl\u00f3s, D., S\u00f3s, V.T., Sz\u0151nyi, T. (eds.) Combinatorics, Paul Erd\u0151s is Eighty, vol. II, pp. 355\u2013397. J. Bolyai Math. Soc., Budapest (1996)"},{"key":"1175_CR11","doi-asserted-by":"crossref","unstructured":"Lov\u00e1sz, L., Winkler, P.: Efficient stopping rules for Markov chains. In: Proc. 27th ACM Symp. Theory Comput., pp. 76\u201382 (1995)","DOI":"10.1145\/225058.225086"},{"key":"1175_CR12","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1017\/S0963548397003349","volume":"7","author":"P. Lov\u00e1sz","year":"1998","unstructured":"Lov\u00e1sz P., Winkler P.: Reversal of Markov chains and the forget time. Combin. Probab. Comput. 7, 189\u2013204 (1998)","journal-title":"Combin. Probab. Comput."},{"key":"1175_CR13","doi-asserted-by":"crossref","first-page":"69","DOI":"10.2307\/1425817","volume":"9","author":"J.W. Pitman","year":"1977","unstructured":"Pitman J.W.: Occupation measures for Markov chains. Adv. Appl. Probab. 9, 69\u201386 (1977)","journal-title":"Adv. Appl. Probab."},{"key":"1175_CR14","unstructured":"Yaron, O.: Random walks on trees. Technical report, Hebrew University, Jerusalem (1988)"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-012-1175-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-012-1175-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-012-1175-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,27]],"date-time":"2019-06-27T07:33:04Z","timestamp":1561620784000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-012-1175-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,4,18]]},"references-count":14,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2013,7]]}},"alternative-id":["1175"],"URL":"https:\/\/doi.org\/10.1007\/s00373-012-1175-x","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,4,18]]}}}