{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T06:38:30Z","timestamp":1774334310389,"version":"3.50.1"},"publisher-location":"Singapore","reference-count":20,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819571260","type":"print"},{"value":"9789819571277","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-981-95-7127-7_19","type":"book-chapter","created":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T10:07:06Z","timestamp":1770977226000},"page":"276-290","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Subexponential and\u00a0Parameterized Mixing Times of\u00a0Glauber Dynamics on\u00a0Independent Sets"],"prefix":"10.1007","author":[{"given":"Malory","family":"Marin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,2,14]]},"reference":[{"issue":"6","key":"19_CR1","doi-asserted-by":"publisher","first-page":"1291","DOI":"10.1137\/20M1320870","volume":"49","author":"M de Berg","year":"2020","unstructured":"de Berg, M., Bodlaender, H.L., Kisfaludi-Bak, S., Marx, D., van der Zanden, T.C.: A framework for exponential-time-hypothesis-tight algorithms and lower bounds in geometric intersection graphs. SIAM J. Comput. 49(6), 1291\u20131331 (2020)","journal-title":"SIAM J. Comput."},{"key":"19_CR2","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/j.dam.2018.05.029","volume":"250","author":"M de Berg","year":"2018","unstructured":"de Berg, M., Jansen, B.M., Mukherjee, D.: Independent-set reconfiguration thresholds of hereditary graph classes. Discret. Appl. Math. 250, 165\u2013182 (2018)","journal-title":"Discret. Appl. Math."},{"issue":"6","key":"19_CR3","doi-asserted-by":"publisher","first-page":"1652","DOI":"10.1007\/s00453-022-01041-8","volume":"85","author":"M de Berg","year":"2023","unstructured":"de Berg, M., Kisfaludi-Bak, S., Monemizadeh, M., Theocharous, L.: Clique-based separators for geometric intersection graphs. Algorithmica 85(6), 1652\u20131678 (2023)","journal-title":"Algorithmica"},{"key":"19_CR4","doi-asserted-by":"crossref","unstructured":"Bez\u00e1kov\u00e1, I., Sun, W.: Mixing of Markov chains for independent sets on chordal graphs with bounded separators. In: International Computing and Combinatorics Conference, pp. 664\u2013676. Springer, Cham (2020)","DOI":"10.1007\/978-3-030-58150-3_54"},{"issue":"4","key":"19_CR5","doi-asserted-by":"publisher","first-page":"834","DOI":"10.1016\/j.disc.2008.01.021","volume":"309","author":"BS Bharadwaj","year":"2009","unstructured":"Bharadwaj, B.S., Chandran, L.S.: Bounds on isoperimetric values of trees. Discret. Math. 309(4), 834\u2013842 (2009)","journal-title":"Discret. Math."},{"issue":"4","key":"19_CR6","first-page":"P4","volume":"21","author":"M Bordewich","year":"2014","unstructured":"Bordewich, M., Kang, R.J.: Subset Glauber dynamics on graphs, hypergraphs and matroids of bounded tree-width. Electron. J. Comb. 21(4), P4-19 (2014)","journal-title":"Electron. J. Comb."},{"key":"19_CR7","doi-asserted-by":"crossref","unstructured":"Borgs, C., et\u00a0al.: Torpid mixing of some Monte Carlo Markov chain algorithms in statistical physics. In: 40th Annual Symposium on Foundations of Computer Science (Cat. No. 99CB37039), pp. 218\u2013229. IEEE (1999)","DOI":"10.1109\/SFFCS.1999.814594"},{"key":"19_CR8","doi-asserted-by":"crossref","unstructured":"Chen, Z., Liu, K., Vigoda, E.: Optimal mixing of Glauber dynamics: entropy factorization via high-dimensional expansion. SIAM J. Comput. 49(6), STOC21\u2013104\u2013STOC21\u2013153 (2023)","DOI":"10.1137\/21M1443340"},{"key":"19_CR9","doi-asserted-by":"crossref","unstructured":"Dallard, C., Milani\u010d, M., \u0160torgel, K.: Treewidth versus clique number. II. Tree-independence number. J. Comb. Theory Ser. B 164, 404\u2013442 (2024)","DOI":"10.1016\/j.jctb.2023.10.006"},{"issue":"2","key":"19_CR10","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1002\/rsa.21003","volume":"59","author":"M Dyer","year":"2021","unstructured":"Dyer, M., Greenhill, C., M\u00fcller, H.: Counting independent sets in graphs with bounded bipartite pathwidth. Random Struct. Algorithms 59(2), 204\u2013237 (2021)","journal-title":"Random Struct. Algorithms"},{"key":"19_CR11","unstructured":"Eppstein, D., Frishberg, D.: Rapid mixing for the Hardcore Glauber dynamics and other Markov chains in bounded-treewidth graphs. In: 34th International Symposium on Algorithms and Computation (ISAAC 2023), pp. 30\u20131. Schloss Dagstuhl\u2013Leibniz-Zentrum f\u00fcr Informatik (2023)"},{"key":"19_CR12","doi-asserted-by":"crossref","unstructured":"Jerrum, M.: Glauber dynamics for the hard-core model on bounded-degree $$h$$-free graphs. arXiv preprint arXiv:2404.07615 (2024)","DOI":"10.1017\/S0963548325100163"},{"issue":"1","key":"19_CR13","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/0166-218X(93)90171-J","volume":"43","author":"E Korach","year":"1993","unstructured":"Korach, E., Solel, N.: Tree-width, path-width, and cutwidth. Discret. Appl. Math. 43(1), 97\u2013101 (1993)","journal-title":"Discret. Appl. Math."},{"issue":"2","key":"19_CR14","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1137\/0136016","volume":"36","author":"RJ Lipton","year":"1979","unstructured":"Lipton, R.J., Tarjan, R.E.: A separator theorem for planar graphs. SIAM J. Appl. Math. 36(2), 177\u2013189 (1979)","journal-title":"SIAM J. Appl. Math."},{"key":"19_CR15","doi-asserted-by":"crossref","unstructured":"Marx, D., Sidiropoulos, A.: The limited blessing of low dimensionality: when $$1 - 1\/d$$ is the best possible exponent for d-dimensional geometric problems. In: Proceedings of the Thirtieth Annual Symposium on Computational Geometry, pp. 67\u201376 (2014)","DOI":"10.1145\/2582112.2582124"},{"issue":"3","key":"19_CR16","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/s00440-007-0131-9","volume":"143","author":"E Mossel","year":"2009","unstructured":"Mossel, E., Weitz, D., Wormald, N.: On the hardness of sampling independent sets beyond the tree threshold. Probab. Theory Relat. Fields 143(3), 401\u2013439 (2009)","journal-title":"Probab. Theory Relat. Fields"},{"key":"19_CR17","doi-asserted-by":"crossref","unstructured":"Randall, D.: Slow mixing of Glauber dynamics via topological obstructions. In: Symposium on Discrete Algorithms: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, vol.\u00a022, pp. 870\u2013879. Citeseer (2006)","DOI":"10.1145\/1109557.1109653"},{"issue":"4","key":"19_CR18","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1017\/S0963548300000390","volume":"1","author":"A Sinclair","year":"1992","unstructured":"Sinclair, A.: Improved bounds for mixing rates of Markov chains and multicommodity flow. Comb. Probab. Comput. 1(4), 351\u2013370 (1992)","journal-title":"Comb. Probab. Comput."},{"key":"19_CR19","doi-asserted-by":"crossref","unstructured":"Sly, A.: Computational transition at the uniqueness threshold. In: 2010 IEEE 51st Annual Symposium on Foundations of Computer Science, pp. 287\u2013296. IEEE (2010)","DOI":"10.1109\/FOCS.2010.34"},{"key":"19_CR20","doi-asserted-by":"crossref","unstructured":"Smith, W.D., Wormald, N.C.: Geometric separator theorems and applications. In: Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No. 98CB36280), pp. 232\u2013243. IEEE (1998)","DOI":"10.1109\/SFCS.1998.743449"}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-95-7127-7_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T04:15:54Z","timestamp":1774325754000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-7127-7_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9789819571260","9789819571277"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-7127-7_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"14 February 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WALCOM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference and Workshops on Algorithms and Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Perugia","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 March 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 March 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"walcom2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/mozart.diei.unipg.it\/walcom2026","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}