{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,4,29]],"date-time":"2024-04-29T11:58:50Z","timestamp":1714391930008},"reference-count":8,"publisher":"Wiley","issue":"3","license":[{"start":{"date-parts":[[2011,3,4]],"date-time":"2011-03-04T00:00:00Z","timestamp":1299196800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Graph Theory"],"published-print":{"date-parts":[[2012,3]]},"abstract":"Abstract<\/jats:title>Motivated by the observation that the sparse tree\u2010like subgraphs in a small world graph have large diameter, we analyze random spanning trees in a given host graph. We show that the diameter of a random spanning tree of a given host graph G<\/jats:italic> is between and with high probability., where c<\/jats:italic> and c<\/jats:italic>\u2032 depend on the spectral gap of G<\/jats:italic> and the ratio of the moments of the degree sequence. For the special case of regular graphs, this result improves the previous lower bound by Aldous by a factor of logn<\/jats:italic>. Copyright \u00a9 2011 John Wiley Periodicals, Inc. J Graph Theory 69:\n223\u2013240, 2012<\/jats:p>","DOI":"10.1002\/jgt.20577","type":"journal-article","created":{"date-parts":[[2011,3,4]],"date-time":"2011-03-04T22:16:38Z","timestamp":1299276998000},"page":"223-240","source":"Crossref","is-referenced-by-count":4,"title":["Diameter of random spanning trees in a given graph"],"prefix":"10.1002","volume":"69","author":[{"given":"Fan","family":"Chung","sequence":"first","affiliation":[{"name":"University of california San diego"}]},{"given":"Paul","family":"Horn","sequence":"additional","affiliation":[{"name":"Emory university Atlanta"}]},{"given":"L.","family":"Lu","sequence":"additional","affiliation":[{"name":"University of south carolina South carolina"}]}],"member":"311","published-online":{"date-parts":[[2011,3,4]]},"reference":[{"key":"e_1_2_7_2_1","doi-asserted-by":"publisher","DOI":"10.1137\/0403039"},{"key":"e_1_2_7_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1989.63516"},{"key":"e_1_2_7_4_1","volume-title":"Spectral Graph Theory","author":"Chung F.","year":"1997"},{"key":"e_1_2_7_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/PL00012580"},{"key":"e_1_2_7_6_1","doi-asserted-by":"publisher","DOI":"10.1090\/cbms\/107"},{"key":"e_1_2_7_7_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0937490100"},{"key":"e_1_2_7_8_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0708471105"},{"key":"e_1_2_7_9_1","doi-asserted-by":"publisher","DOI":"10.1017\/S1446788700004432"}],"container-title":["Journal of Graph Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fjgt.20577","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/jgt.20577","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,30]],"date-time":"2023-10-30T04:13:11Z","timestamp":1698639191000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/jgt.20577"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,3,4]]},"references-count":8,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2012,3]]}},"alternative-id":["10.1002\/jgt.20577"],"URL":"https:\/\/doi.org\/10.1002\/jgt.20577","archive":["Portico"],"relation":{},"ISSN":["0364-9024","1097-0118"],"issn-type":[{"value":"0364-9024","type":"print"},{"value":"1097-0118","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,3,4]]}}}