{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,2]],"date-time":"2026-02-02T15:39:51Z","timestamp":1770046791436,"version":"3.49.0"},"reference-count":55,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2026,1,14]],"date-time":"2026-01-14T00:00:00Z","timestamp":1768348800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2026,1,14]],"date-time":"2026-01-14T00:00:00Z","timestamp":1768348800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"NSF Grant","award":["CCF-2143762"],"award-info":[{"award-number":["CCF-2143762"]}]},{"name":"NSF Grant","award":["CCF-2143762"],"award-info":[{"award-number":["CCF-2143762"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2026,2]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>\n                    We consider spin systems on general\n                    <jats:italic>n<\/jats:italic>\n                    -vertex graphs of unbounded degree and explore the effects of spectral independence on the rate of convergence to equilibrium of global Markov chains. Spectral independence is a novel way of quantifying the decay of correlations in spin system models, which has significantly advanced the study of Markov chains for spin systems. We prove that whenever spectral independence holds, the popular Swendsen\u2013Wang dynamics for the\n                    <jats:italic>q<\/jats:italic>\n                    -state ferromagnetic Potts model on graphs of maximum degree\n                    <jats:inline-formula>\n                      <jats:tex-math>$$\\Delta $$<\/jats:tex-math>\n                    <\/jats:inline-formula>\n                    , where\n                    <jats:inline-formula>\n                      <jats:tex-math>$$\\Delta $$<\/jats:tex-math>\n                    <\/jats:inline-formula>\n                    is allowed to grow with\n                    <jats:italic>n<\/jats:italic>\n                    , converges in\n                    <jats:inline-formula>\n                      <jats:tex-math>$$O((\\Delta \\log n)^c)$$<\/jats:tex-math>\n                    <\/jats:inline-formula>\n                    steps where\n                    <jats:inline-formula>\n                      <jats:tex-math>$$c &gt; 0$$<\/jats:tex-math>\n                    <\/jats:inline-formula>\n                    is a constant independent of\n                    <jats:inline-formula>\n                      <jats:tex-math>$$\\Delta $$<\/jats:tex-math>\n                    <\/jats:inline-formula>\n                    and\n                    <jats:italic>n<\/jats:italic>\n                    . We also show a similar mixing time bound for the block dynamics of general spin systems, again assuming that spectral independence holds. Finally, for\n                    <jats:italic>monotone<\/jats:italic>\n                    spin systems such as the Ising model and the hardcore model on bipartite graphs, we show that spectral independence implies that the mixing time of the systematic scan dynamics is\n                    <jats:inline-formula>\n                      <jats:tex-math>$$O(\\Delta ^c \\log n)$$<\/jats:tex-math>\n                    <\/jats:inline-formula>\n                    for a constant\n                    <jats:inline-formula>\n                      <jats:tex-math>$$c&gt;0$$<\/jats:tex-math>\n                    <\/jats:inline-formula>\n                    independent of\n                    <jats:inline-formula>\n                      <jats:tex-math>$$\\Delta $$<\/jats:tex-math>\n                    <\/jats:inline-formula>\n                    and\n                    <jats:italic>n<\/jats:italic>\n                    . Systematic scan dynamics are widely popular but are notoriously difficult to analyze. Our result implies optimal\n                    <jats:inline-formula>\n                      <jats:tex-math>$$O(\\log n)$$<\/jats:tex-math>\n                    <\/jats:inline-formula>\n                    mixing time bounds for any systematic scan dynamics of the ferromagnetic Ising model on general graphs up to the tree uniqueness threshold. Our main technical contribution is an improved factorization of the entropy functional: this is the common starting point for all our proofs. Specifically, we establish the so-called\n                    <jats:italic>k<\/jats:italic>\n                    -partite factorization of entropy with a constant that depends polynomially on the maximum degree of the graph.\n                  <\/jats:p>","DOI":"10.1007\/s00453-025-01353-5","type":"journal-article","created":{"date-parts":[[2026,1,14]],"date-time":"2026-01-14T04:51:48Z","timestamp":1768366308000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Rapid Mixing of Global Markov Chains via Spectral Independence: The Unbounded Degree Case"],"prefix":"10.1007","volume":"88","author":[{"given":"Antonio","family":"Blanca","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xusheng","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,1,14]]},"reference":[{"key":"1353_CR1","doi-asserted-by":"publisher","unstructured":"Anari, N., Liu, K., Oveis\u00a0Gharan, S.: Spectral independence in high-dimensional expanders and applications to the hardcore model. In: 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS), pp. 1319\u20131330 (2020). https:\/\/doi.org\/10.1109\/FOCS46700.2020.00125","DOI":"10.1109\/FOCS46700.2020.00125"},{"key":"1353_CR2","doi-asserted-by":"crossref","unstructured":"Chen, Z., Liu, K., Vigoda, E.: Rapid mixing of Glauber dynamics up to uniqueness via contraction. In: 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS), pp. 1307\u20131318. IEEE Computer Society (2020)","DOI":"10.1109\/FOCS46700.2020.00124"},{"key":"1353_CR3","doi-asserted-by":"publisher","unstructured":"Chen, Z., Liu, K., Vigoda, E.: Optimal mixing of Glauber dynamics: entropy factorization via high-dimensional expansion. In: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing. STOC 2021, pp. 1537\u20131550. Association for Computing Machinery, New York (2021). https:\/\/doi.org\/10.1145\/3406325.3451035","DOI":"10.1145\/3406325.3451035"},{"key":"1353_CR4","doi-asserted-by":"publisher","unstructured":"Chen, X., Feng, W., Yin, Y., Zhang, X.: Rapid mixing of Glauber dynamics via spectral independence for all degrees. In: 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS), pp. 137\u2013148 (2022). https:\/\/doi.org\/10.1109\/FOCS52979.2021.00022","DOI":"10.1109\/FOCS52979.2021.00022"},{"key":"1353_CR5","doi-asserted-by":"crossref","unstructured":"Chen, X., Feng, W., Yin, Y., Zhang, X.: Optimal mixing for two-state anti-ferromagnetic spin systems. In: 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS), pp. 588\u2013599. IEEE (2022)","DOI":"10.1109\/FOCS54457.2022.00062"},{"key":"1353_CR6","doi-asserted-by":"publisher","unstructured":"Anari, N., Jain, V., Koehler, F., Pham, H.T., Vuong, T.-D.: Entropic independence: pptimal mixing of down-up random walks. In: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing. STOC 2022, pp. 1418\u20131430. Association for Computing Machinery, New York (2022). https:\/\/doi.org\/10.1145\/3519935.3520048","DOI":"10.1145\/3519935.3520048"},{"key":"1353_CR7","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2022.106268","volume":"177","author":"V Jain","year":"2022","unstructured":"Jain, V., Pham, H.T., Vuong, T.-D.: Spectral independence, coupling, and the spectral gap of the Glauber dynamics. Inf. Process. Lett. 177, 106268 (2022)","journal-title":"Inf. Process. Lett."},{"key":"1353_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1214\/22-EJP867","volume":"27","author":"A Blanca","year":"2022","unstructured":"Blanca, A., Caputo, P., Chen, Z., Parisi, D., Stefankovic, D., Vigoda, E.: On mixing of Markov chains: coupling, spectral independence, and entropy factorization. Electron. J. Probab. 27, 1\u201342 (2022). https:\/\/doi.org\/10.1214\/22-EJP867","journal-title":"Electron. J. Probab."},{"key":"1353_CR9","doi-asserted-by":"crossref","unstructured":"Chen, Z., Galanis, A., Stefankovic, D., Vigoda, E.: Rapid mixing for colorings via spectral independence. In: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1548\u20131557 (2021)","DOI":"10.1137\/1.9781611976465.94"},{"key":"1353_CR10","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1103\/PhysRevLett.58.86","volume":"58","author":"RH Swendsen","year":"1987","unstructured":"Swendsen, R.H., Wang, J.-S.: Nonuniversal critical dynamics in Monte Carlo simulations. Phys. Rev. Lett. 58, 86\u201388 (1987). https:\/\/doi.org\/10.1103\/PhysRevLett.58.86","journal-title":"Phys. Rev. Lett."},{"key":"1353_CR11","doi-asserted-by":"crossref","unstructured":"Guo, H., Jerrum, M.: Random cluster dynamics for the Ising model is rapidly mixing. In: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017, pp. 1818\u20131827 (2017)","DOI":"10.1137\/1.9781611974782.118"},{"key":"1353_CR12","doi-asserted-by":"publisher","unstructured":"Gore, V.K., Jerrum, M.R.: The Swendsen-Wang process does not always mix rapidly. In: Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing. STOC \u201997, pp. 674\u2013681. Association for Computing Machinery, New York (1997). https:\/\/doi.org\/10.1145\/258533.258662","DOI":"10.1145\/258533.258662"},{"issue":"3\u20134","key":"1353_CR13","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1007\/s00440-010-0329-0","volume":"152","author":"C Borgs","year":"2012","unstructured":"Borgs, C., Chayes, J.T., Tetali, P.: Tight bounds for mixing of the Swendsen-Wang algorithm at the Potts transition point. Probab. Theory Relat. Fields 152(3\u20134), 509\u2013557 (2012). https:\/\/doi.org\/10.1007\/s00440-010-0329-0","journal-title":"Probab. Theory Relat. Fields"},{"issue":"5","key":"1353_CR14","doi-asserted-by":"publisher","first-page":"994","DOI":"10.1002\/cpa.21718","volume":"71","author":"R Gheissari","year":"2018","unstructured":"Gheissari, R., Lubetzky, E.: Mixing times of critical two-dimensional Potts models. Comm. Pure Appl. Math 71(5), 994\u20131046 (2018)","journal-title":"Comm. Pure Appl. Math"},{"key":"1353_CR15","doi-asserted-by":"crossref","unstructured":"Gheissari, R., Lubetzky, E., Peres, Y.: Exponentially slow mixing in the mean-field Swendsen-Wang dynamics. Annales de l\u2019Institut Henri Poincare (B). Extended abstract appeared in Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2018), pp. 1981\u20131988 (2019)","DOI":"10.1137\/1.9781611975031.129"},{"key":"1353_CR16","doi-asserted-by":"publisher","DOI":"10.1007\/s00220-023-04644-6","author":"A Coja-Oghlan","year":"2023","unstructured":"Coja-Oghlan, A., Galanis, A., Goldberg, L.A., Ravelomanana, J.B., \u0160tefankovi\u010d, D., Vigoda, E.: Metastability of the Potts ferromagnet on random regular graphs. Commun. Math. Phys. (2023). https:\/\/doi.org\/10.1007\/s00220-023-04644-6","journal-title":"Commun. Math. Phys."},{"issue":"2","key":"1353_CR17","doi-asserted-by":"publisher","first-page":"1018","DOI":"10.1214\/21-AAP1702","volume":"32","author":"A Blanca","year":"2022","unstructured":"Blanca, A., Caputo, P., Parisi, D., Sinclair, A., Vigoda, E.: Entropy decay in the Swendsen Wang dynamics on $${\\mathbb{Z} ^{d}}$$. Ann. Appl. Probab. 32(2), 1018\u20131057 (2022). https:\/\/doi.org\/10.1214\/21-AAP1702","journal-title":"Ann. Appl. Probab."},{"key":"1353_CR18","doi-asserted-by":"crossref","unstructured":"Blanca, A., Chen, Z., Stefankovic, D., Vigoda, E.: The Swendsen Wang dynamics on trees. Random Struct. Algorithms (2023)","DOI":"10.1002\/rsa.21121"},{"key":"1353_CR19","unstructured":"Galanis, A., \u0160tefankovi\u010d, D., Vigoda, E.: Swendsen-Wang algorithm on the mean-field Potts model. In: Proceedings of APPROX\/RANDOM (2015)"},{"key":"1353_CR20","unstructured":"Blanca, A., Sinclair, A.: Dynamics for the mean-field random-cluster model. In: Proceedings of APPROX\/RANDOM (2015)"},{"issue":"1","key":"1353_CR21","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1002\/rsa.10071","volume":"22","author":"M Huber","year":"2003","unstructured":"Huber, M.: A bounding chain for Swendsen-Wang. Random Struct. Algorithms 22(1), 43\u201359 (2003)","journal-title":"Random Struct. Algorithms"},{"issue":"1","key":"1353_CR22","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1002\/rsa.20569","volume":"48","author":"M Bordewich","year":"2016","unstructured":"Bordewich, M., Greenhill, C., Patel, V.: Mixing of the Glauber dynamics for the ferromagnetic Potts model. Random Struct. Algorithms 48(1), 21\u201352 (2016)","journal-title":"Random Struct. Algorithms"},{"key":"1353_CR23","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/11830924_31","volume-title":"Approximation, Randomization, and Combinatorial Optimization Algorithms and Techniques","author":"M Dyer","year":"2006","unstructured":"Dyer, M., Goldberg, L.A., Jerrum, M.: Dobrushin conditions and systematic scan. In: D\u00edaz, J., Jansen, K., Rolim, J.D.P., Zwick, U. (eds.) Approximation, Randomization, and Combinatorial Optimization Algorithms and Techniques, pp. 327\u2013338. Springer, Berlin (2006)"},{"key":"1353_CR24","doi-asserted-by":"publisher","unstructured":"Hayes, T.P.: A simple condition implying rapid mixing of single-site dynamics on spin systems. In: The 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS\u201906), pp. 39\u201346 (2006). https:\/\/doi.org\/10.1109\/FOCS.2006.6","DOI":"10.1109\/FOCS.2006.6"},{"issue":"1","key":"1353_CR25","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1214\/08-AAP532","volume":"19","author":"M Dyer","year":"2009","unstructured":"Dyer, M., Goldberg, L.A., Jerrum, M.: Matrix norms and rapid mixing for spin systems. Ann. Appl. Probab. 19(1), 71\u2013107 (2009)","journal-title":"Ann. Appl. Probab."},{"issue":"1","key":"1353_CR26","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1214\/105051605000000683","volume":"16","author":"M Dyer","year":"2006","unstructured":"Dyer, M., Goldberg, L.A., Jerrum, M.: Systematic scan for sampling colorings. Ann. Appl. Probab. 16(1), 185\u2013230 (2006)","journal-title":"Ann. Appl. Probab."},{"issue":"3","key":"1353_CR27","doi-asserted-by":"publisher","first-page":"1007","DOI":"10.1007\/s00220-013-1776-0","volume":"323","author":"Y Peres","year":"2013","unstructured":"Peres, Y., Winkler, P.: Can extra updates delay mixing? Commun. Math. Phys. 323(3), 1007\u20131016 (2013)","journal-title":"Commun. Math. Phys."},{"key":"1353_CR28","unstructured":"Guo, H., Kara, K., Zhang, C.: Layerwise systematic scan: deep Boltzmann machines and beyond. In: International Conference on Artificial Intelligence and Statistics, pp. 178\u2013187. PMLR (2018)"},{"issue":"3","key":"1353_CR29","doi-asserted-by":"publisher","first-page":"584","DOI":"10.1002\/rsa.20844","volume":"55","author":"A Blanca","year":"2019","unstructured":"Blanca, A., Caputo, P., Sinclair, A., Vigoda, E.: Spatial mixing and nonlocal Markov chains. Random Struct. Algorithms 55(3), 584\u2013614 (2019). https:\/\/doi.org\/10.1002\/rsa.20844","journal-title":"Random Struct. Algorithms"},{"key":"1353_CR30","doi-asserted-by":"crossref","unstructured":"Chen, Z., Liu, K., Mani, N., Moitra, A.: Strong spatial mixing for colorings on trees and its algorithmic applications (2023)","DOI":"10.1109\/FOCS57990.2023.00053"},{"issue":"2","key":"1353_CR31","doi-asserted-by":"publisher","first-page":"793","DOI":"10.1007\/s00220-021-04237-1","volume":"388","author":"P Caputo","year":"2021","unstructured":"Caputo, P., Parisi, D.: Block factorization of the relative entropy via spatial mixing. Commun. Math. Phys. 388(2), 793\u2013818 (2021). https:\/\/doi.org\/10.1007\/s00220-021-04237-1","journal-title":"Commun. Math. Phys."},{"issue":"1","key":"1353_CR32","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/BF02099735","volume":"165","author":"F Martinelli","year":"1994","unstructured":"Martinelli, F., Olivieri, E., Schonmann, R.H.: For $$2$$-D lattice spin systems weak mixing implies strong mixing. Commun. Math. Phys. 165(1), 33\u201347 (1994)","journal-title":"Commun. Math. Phys."},{"key":"1353_CR33","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1007\/s004400050155","volume":"110","author":"KS Alexander","year":"1998","unstructured":"Alexander, K.S.: On weak mixing in lattice models. Probab. Theory Relat. Fields 110, 441\u2013471 (1998)","journal-title":"Probab. Theory Relat. Fields"},{"key":"1353_CR34","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1007\/s00440-011-0353-8","volume":"153","author":"V Beffara","year":"2012","unstructured":"Beffara, V., Duminil-Copin, H.: The self-dual point of the two-dimensional random-cluster model is critical for $$q\\ge 1$$. Probab. Theory Relat. Fields 153, 511\u2013542 (2012)","journal-title":"Probab. Theory Relat. Fields"},{"issue":"5","key":"1353_CR35","doi-asserted-by":"publisher","first-page":"1778","DOI":"10.1214\/12-AAP886","volume":"23","author":"JA Fill","year":"2013","unstructured":"Fill, J.A., Kahn, J.: Comparison inequalities and fastest-mixing Markov chains. Ann. Appl. Probab. 23(5), 1778\u20131816 (2013). https:\/\/doi.org\/10.1214\/12-AAP886","journal-title":"Ann. Appl. Probab."},{"issue":"2","key":"1353_CR36","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1002\/rsa.20858","volume":"56","author":"A Blanca","year":"2020","unstructured":"Blanca, A., Chen, Z., Vigoda, E.: Swendsen-Wang dynamics for general graphs in the tree uniqueness region. Random Struct. Algorithms 56(2), 373\u2013400 (2020)","journal-title":"Random Struct. Algorithms"},{"issue":"4","key":"1353_CR37","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1002\/rsa.20004","volume":"24","author":"M Dyer","year":"2004","unstructured":"Dyer, M., Sinclair, A., Vigoda, E., Weitz, D.: Mixing in time and space for lattice spin systems: a combinatorial view. Random Struct. Algorithms 24(4), 461\u2013479 (2004). https:\/\/doi.org\/10.1002\/rsa.20004","journal-title":"Random Struct. Algorithms"},{"issue":"3","key":"1353_CR38","doi-asserted-by":"publisher","first-page":"695","DOI":"10.1214\/aoap\/1034968224","volume":"6","author":"P Diaconis","year":"1996","unstructured":"Diaconis, P., Saloff-Coste, L.: Logarithmic Sobolev inequalities for finite Markov chains. Ann. Appl. Probab. 6(3), 695\u2013750 (1996). https:\/\/doi.org\/10.1214\/aoap\/1034968224","journal-title":"Ann. Appl. Probab."},{"key":"1353_CR39","doi-asserted-by":"publisher","unstructured":"Bobkov, S., Tetali, P.: Modified log-Sobolev inequalities, mixing and hypercontractivity. In: Proceedings of the Thirty-Fifth Annual ACM Symposium on Theory of Computing. STOC \u201903, pp. 287\u2013296. Association for Computing Machinery, New York (2003). https:\/\/doi.org\/10.1145\/780542.780586","DOI":"10.1145\/780542.780586"},{"issue":"6","key":"1353_CR40","doi-asserted-by":"publisher","first-page":"919","DOI":"10.1017\/S0963548319000099","volume":"28","author":"K Marton","year":"2019","unstructured":"Marton, K.: Logarithmic Sobolev inequalities in discrete product spaces. Comb. Probab. Comput. 28(6), 919\u2013935 (2019). https:\/\/doi.org\/10.1017\/S0963548319000099","journal-title":"Comb. Probab. Comput."},{"key":"1353_CR41","doi-asserted-by":"publisher","unstructured":"Caputo, P., Menz, G., Tetali, P.: Approximate tensorization of entropy at high temperature (2014). https:\/\/doi.org\/10.48550\/ARXIV.1405.0608. https:\/\/arxiv.org\/abs\/1405.0608","DOI":"10.48550\/ARXIV.1405.0608"},{"key":"1353_CR42","doi-asserted-by":"publisher","first-page":"569","DOI":"10.1007\/PL00008792","volume":"120","author":"F Cesi","year":"2001","unstructured":"Cesi, F.: Quasi-factorization of the entropy and logarithmic Sobolev inequalities for Gibbs random fields. Probab. Theory Relat. Fields 120, 569\u2013584 (2001)","journal-title":"Probab. Theory Relat. Fields"},{"key":"1353_CR43","doi-asserted-by":"crossref","unstructured":"Martinelli, F.: Lectures on Glauber dynamics for Discrete Spin Models. Lectures on Probability Theory and Statistics (Saint-Flour, 1997), vol. 1717, pp. 93\u2013191 (1999)","DOI":"10.1007\/978-3-540-48115-7_2"},{"key":"1353_CR44","doi-asserted-by":"publisher","DOI":"10.1145\/3531008","author":"W Feng","year":"2022","unstructured":"Feng, W., Guo, H., Yin, Y., Zhang, C.: Rapid mixing from spectral independence beyond the Boolean domain. ACM Trans. Algorithms (2022). https:\/\/doi.org\/10.1145\/3531008","journal-title":"ACM Trans. Algorithms"},{"key":"1353_CR45","doi-asserted-by":"publisher","first-page":"1","DOI":"10.4064\/dm502-0-1","volume":"502","author":"M Ullrich","year":"2014","unstructured":"Ullrich, M.: Rapid mixing of Swendsen-Wang dynamics in two dimensions. Diss. Math. 502, 1\u201364 (2014). https:\/\/doi.org\/10.4064\/dm502-0-1","journal-title":"Diss. Math."},{"issue":"3","key":"1353_CR46","doi-asserted-by":"publisher","first-page":"1335","DOI":"10.4007\/annals.2005.162.1335","volume":"162","author":"D Achlioptas","year":"2005","unstructured":"Achlioptas, D., Naor, A.: The two possible values of the chromatic number of a random graph. Ann. Math. 162(3), 1335\u20131351 (2005)","journal-title":"Ann. Math."},{"issue":"1","key":"1353_CR47","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1214\/aoap\/1177005981","volume":"1","author":"JA Fill","year":"1991","unstructured":"Fill, J.A.: Eigenvalue bounds on convergence to stationarity for nonreversible Markov chains, with an application to the exclusion process. Ann. Appl. Probab. 1(1), 62\u201387 (1991). https:\/\/doi.org\/10.1214\/aoap\/1177005981","journal-title":"Ann. Appl. Probab."},{"issue":"3","key":"1353_CR48","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1561\/0400000003","volume":"1","author":"R Montenegro","year":"2006","unstructured":"Montenegro, R., Tetali, P.: Mathematical aspects of mixing times in Markov chains. Found. Trends Theor. Comput. Sci. 1(3), 237\u2013354 (2006). https:\/\/doi.org\/10.1561\/0400000003","journal-title":"Found. Trends Theor. Comput. Sci."},{"key":"1353_CR49","doi-asserted-by":"publisher","DOI":"10.1214\/105051607000000104","author":"TP Hayes","year":"2007","unstructured":"Hayes, T.P., Sinclair, A.: A general lower bound for mixing of single-site dynamics on graphs. Ann. Appl. Probab. (2007). https:\/\/doi.org\/10.1214\/105051607000000104","journal-title":"Ann. Appl. Probab."},{"key":"1353_CR50","unstructured":"Levin, D.A., Peres, Y., Wilmer, E.L.: Markov Chains and Mixing Times, 1st edn. American Mathematical Society (2006). http:\/\/scholar.google.com\/scholar.bib?q=info:3wf9IU94tyMJ:scholar.google.com\/&output=citation &hl=en &as_sdt=2000 &ct=citation &cd=0"},{"key":"1353_CR51","unstructured":"Simon, B.: The Statistical Mechanics of Lattice Gases, vol. I, 1st edn. Princeton University Press (1993). http:\/\/www.jstor.org\/stable\/j.ctt7ztwsn Accessed 2022-09-12"},{"key":"1353_CR52","doi-asserted-by":"crossref","unstructured":"Chen, X., Liu, J., Yin, Y.: Uniqueness and Rapid Mixing in the Bipartite Hardcore Model (2023)","DOI":"10.1109\/FOCS57990.2023.00121"},{"key":"1353_CR53","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/s00440-016-0708-2","volume":"168","author":"A Sinclair","year":"2017","unstructured":"Sinclair, A., Srivastava, P., Stefankovic, D., Yin, Y.: Spatial mixing and the connective constant: optimal bounds. Probab. Theory Relat. Fields 168, 153\u2013197 (2017). https:\/\/doi.org\/10.1007\/s00440-016-0708-2","journal-title":"Probab. Theory Relat. Fields"},{"key":"1353_CR54","doi-asserted-by":"publisher","DOI":"10.1007\/s00440-012-0421-8","author":"R Restrepo","year":"2013","unstructured":"Restrepo, R., Shin, J., Tetali, P., Vigoda, E., Yang, L.: Improved mixing condition on the grid for counting and sampling independent sets. Probab. Theory Relat. Fields (2013). https:\/\/doi.org\/10.1007\/s00440-012-0421-8","journal-title":"Probab. Theory Relat. Fields"},{"issue":"1","key":"1353_CR55","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/0890-5401(89)90067-9","volume":"82","author":"A Sinclair","year":"1989","unstructured":"Sinclair, A., Jerrum, M.: Approximate counting, uniform generation and rapidly mixing Markov chains. Inf. Comput. 82(1), 93\u2013133 (1989). https:\/\/doi.org\/10.1016\/0890-5401(89)90067-9","journal-title":"Inf. Comput."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-025-01353-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00453-025-01353-5","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-025-01353-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,2]],"date-time":"2026-02-02T05:11:52Z","timestamp":1770009112000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00453-025-01353-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,1,14]]},"references-count":55,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,2]]}},"alternative-id":["1353"],"URL":"https:\/\/doi.org\/10.1007\/s00453-025-01353-5","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,1,14]]},"assertion":[{"value":"31 August 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 September 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 January 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no Conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"19"}}