{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T14:38:46Z","timestamp":1774967926511,"version":"3.50.1"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2023,4,25]],"date-time":"2023-04-25T00:00:00Z","timestamp":1682380800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,4,25]],"date-time":"2023-04-25T00:00:00Z","timestamp":1682380800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100000001","name":"national science foundation","doi-asserted-by":"publisher","award":["1839323"],"award-info":[{"award-number":["1839323"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"national science foundation","doi-asserted-by":"publisher","award":["1909756"],"award-info":[{"award-number":["1909756"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"national science foundation","doi-asserted-by":"publisher","award":["2007443"],"award-info":[{"award-number":["2007443"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Discrete Comput Geom"],"published-print":{"date-parts":[[2023,9]]},"DOI":"10.1007\/s00454-023-00497-x","type":"journal-article","created":{"date-parts":[[2023,4,25]],"date-time":"2023-04-25T19:02:36Z","timestamp":1682449356000},"page":"406-425","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Convergence of Gibbs Sampling: Coordinate Hit-and-Run Mixes Fast"],"prefix":"10.1007","volume":"70","author":[{"given":"Aditi","family":"Laddha","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Santosh S.","family":"Vempala","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,4,25]]},"reference":[{"issue":"4","key":"497_CR1","first-page":"5","volume":"148","author":"HC Andersen","year":"2007","unstructured":"Andersen, H.C., Diaconis, P.: Hit and run as a unifying device. J. Soc. Fr. Stat. Rev. Stat. Appl. 148(4), 5\u201328 (2007)","journal-title":"J. Soc. Fr. Stat. Rev. Stat. Appl."},{"key":"497_CR2","doi-asserted-by":"crossref","unstructured":"Boneh, A.: Preduce\u2014a probabilistic algorithm identifying redundancy by a random feasible point generator (RFPG). In: Redundancy in Mathematical Programming. Lecture Notes in Economics and Mathematical Systems Book Series, vol. 206, pp. 108\u2013134. Springer, Berlin (1983)","DOI":"10.1007\/978-3-642-45535-3_10"},{"key":"497_CR3","unstructured":"Cousins, B., Vempala, S.: Volume-and-Sampling, v.2.2.1. MATLAB File Exchange (2013). https:\/\/www.mathworks.com\/matlabcentral\/fileexchange\/43596-volume-and-sampling"},{"key":"497_CR4","doi-asserted-by":"crossref","unstructured":"Cousins, B., Vempala, S.: Bypassing KLS: Gaussian cooling and an $${\\rm O}^*(n^3)$$ volume algorithm. In: 47th Annual ACM Symposium on Theory of Computing (Portland 2015), pp. 539\u2013548. ACM, New York (2015)","DOI":"10.1145\/2746539.2746563"},{"issue":"2","key":"497_CR5","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/s12532-015-0097-z","volume":"8","author":"B Cousins","year":"2016","unstructured":"Cousins, B., Vempala, S.: A practical volume algorithm. Math. Program. Comput. 8(2), 133\u2013160 (2016)","journal-title":"Math. Program. Comput."},{"issue":"1","key":"497_CR6","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1007\/s13171-010-0004-7","volume":"72","author":"P Diaconis","year":"2010","unstructured":"Diaconis, P., Khare, K., Saloff-Coste, L.: Gibbs sampling, conjugate priors and coupling. Sankhya A 72(1), 136\u2013169 (2010)","journal-title":"Sankhya A"},{"issue":"1\u20132","key":"497_CR7","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/s00209-011-0924-5","volume":"272","author":"P Diaconis","year":"2012","unstructured":"Diaconis, P., Lebeau, G., Michel, L.: Gibbs\/Metropolis algorithms on a convex polytope. Math. Z. 272(1\u20132), 109\u2013129 (2012)","journal-title":"Math. Z."},{"key":"497_CR8","doi-asserted-by":"crossref","unstructured":"Emiris, I.Z., Fisikopoulos, V.: Efficient random-walk methods for approximating polytope volume. In: 30th Annual Symposium on Computational Geometry (Kyoto 2014), pp. 318\u2013327. ACM, New York (2014)","DOI":"10.1145\/2582112.2582133"},{"key":"497_CR9","doi-asserted-by":"crossref","unstructured":"Finkel, J.R., Grenager, T., Manning, Ch.: Incorporating non-local information into information extraction systems by Gibbs sampling. In: 43rd Annual Meeting of the Association for Computational Linguistics (Ann Arbor 2005), pp. 363\u2013370. ACL, Stroudsburg (2005)","DOI":"10.3115\/1219840.1219885"},{"issue":"6","key":"497_CR10","doi-asserted-by":"publisher","first-page":"721","DOI":"10.1109\/TPAMI.1984.4767596","volume":"6","author":"S Geman","year":"1984","unstructured":"Geman, S., Geman, D.: Stochastic relaxation, Gibbs distributions, and the Bayesian restoration of images. IEEE Trans. Pattern Anal. Mach. Intell. 6(6), 721\u2013741 (1984)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"423","key":"497_CR11","doi-asserted-by":"publisher","first-page":"881","DOI":"10.1080\/01621459.1993.10476353","volume":"88","author":"EI George","year":"1993","unstructured":"George, E.I., McCulloch, R.E.: Variable selection via Gibbs sampling. J. Am. Stat. Assoc. 88(423), 881\u2013889 (1993)","journal-title":"J. Am. Stat. Assoc."},{"key":"497_CR12","unstructured":"Kannan, R.: Rapid mixing in Markov chains (2003). arXiv:math\/0304470"},{"issue":"3\u20134","key":"497_CR13","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1007\/BF02574061","volume":"13","author":"R Kannan","year":"1995","unstructured":"Kannan, R., Lov\u00e1sz, L., Simonovits, M.: Isoperimetric problems for convex bodies and a localization lemma. Discrete Comput. Geom. 13(3\u20134), 541\u2013559 (1995)","journal-title":"Discrete Comput. Geom."},{"issue":"1","key":"497_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1002\/(SICI)1098-2418(199708)11:1<1::AID-RSA1>3.0.CO;2-X","volume":"11","author":"R Kannan","year":"1997","unstructured":"Kannan, R., Lov\u00e1sz, L., Simonovits, M.: Random walks and an $$O^*(n^5)$$ volume algorithm for convex bodies. Random Struct. Algorithms 11(1), 1\u201350 (1997)","journal-title":"Random Struct. Algorithms"},{"key":"497_CR15","doi-asserted-by":"crossref","unstructured":"Lee, Y.T., Vempala, S.S.: Eldan\u2019s stochastic localization and the KLS hyperplane conjecture: an improved lower bound for expansion. In: 58th Annual IEEE Symposium on Foundations of Computer Science (Berkeley 2017), pp. 998\u20131007. IEEE Computer Society, Los Alamitos (2017)","DOI":"10.1109\/FOCS.2017.96"},{"key":"497_CR16","doi-asserted-by":"publisher","first-page":"961","DOI":"10.1090\/S0002-9904-1949-09320-5","volume":"55","author":"LH Loomis","year":"1949","unstructured":"Loomis, L.H., Whitney, H.: An inequality related to the isoperimetric inequality. Bull. Am. Math. Soc. 55, 961\u2013962 (1949)","journal-title":"Bull. Am. Math. Soc."},{"key":"497_CR17","unstructured":"Lov\u00e1sz, L.: How to compute the volume? In: Jahresbericht der Deutschen Mathematiker-Vereinigung. Jubil\u00e4umstagung 100 Jahre DMV (Bremen 1990), pp. 138\u2013151. Teubner, Stuttgart (1990)"},{"issue":"3","key":"497_CR18","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1007\/s101070050099","volume":"86","author":"L Lov\u00e1sz","year":"1999","unstructured":"Lov\u00e1sz, L.: Hit-and-run mixes fast. Math. Program. 86(3), 443\u2013461 (1999)","journal-title":"Math. Program."},{"issue":"4","key":"497_CR19","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1002\/rsa.3240040402","volume":"4","author":"L Lov\u00e1sz","year":"1993","unstructured":"Lov\u00e1sz, L., Simonovits, M.: Random walks in a convex body and an improved volume algorithm. Random Struct. Algorithms 4(4), 359\u2013412 (1993)","journal-title":"Random Struct. Algorithms"},{"issue":"4","key":"497_CR20","doi-asserted-by":"publisher","first-page":"985","DOI":"10.1137\/S009753970544727X","volume":"35","author":"L Lov\u00e1sz","year":"2006","unstructured":"Lov\u00e1sz, L., Vempala, S.: Hit-and-run from a corner. SIAM J. Comput. 35(4), 985\u20131005 (2006)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"497_CR21","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1016\/j.jcss.2005.08.004","volume":"72","author":"L Lov\u00e1sz","year":"2006","unstructured":"Lov\u00e1sz, L., Vempala, S.: Simulated annealing in convex bodies and an $$O^*(n^4)$$ volume algorithm. J. Comput. Syst. Sci. 72(2), 392\u2013417 (2006)","journal-title":"J. Comput. Syst. Sci."},{"issue":"3","key":"497_CR22","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1002\/rsa.20135","volume":"30","author":"L Lov\u00e1sz","year":"2007","unstructured":"Lov\u00e1sz, L., Vempala, S.: The geometry of logconcave functions and sampling algorithms. Random Struct. Algorithms 30(3), 307\u2013358 (2007)","journal-title":"Random Struct. Algorithms"},{"issue":"2","key":"497_CR23","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1017\/S0963548321000328","volume":"31","author":"H Narayanan","year":"2022","unstructured":"Narayanan, H., Srivastava, P.: On the mixing time of coordinate hit-and-run. Combin. Probab. Comput. 31(2), 320\u2013332 (2022)","journal-title":"Combin. Probab. Comput."},{"issue":"1","key":"497_CR24","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. Inform. Comput. 82(1), 93\u2013133 (1989)","journal-title":"Inform. Comput."},{"issue":"6","key":"497_CR25","doi-asserted-by":"publisher","first-page":"1296","DOI":"10.1287\/opre.32.6.1296","volume":"32","author":"RL Smith","year":"1984","unstructured":"Smith, R.L.: Efficient Monte Carlo procedures for generating points uniformly distributed over bounded regions. Oper. Res. 32(6), 1296\u20131308 (1984)","journal-title":"Oper. Res."},{"issue":"7","key":"497_CR26","doi-asserted-by":"publisher","first-page":"606","DOI":"10.4169\/amer.math.monthly.119.07.606","volume":"119","author":"T Tkocz","year":"2012","unstructured":"Tkocz, T.: An upper bound for spherical caps. Am. Math. Mon. 119(7), 606\u2013607 (2012)","journal-title":"Am. Math. Mon."},{"issue":"4","key":"497_CR27","doi-asserted-by":"publisher","first-page":"720","DOI":"10.1137\/1116083","volume":"16","author":"VF Turchin","year":"1971","unstructured":"Turchin, V.F.: On the computation of multidimensional integrals by the Monte-Carlo method. Theory Probab. Appl. 16(4), 720\u2013724 (1971)","journal-title":"Theory Probab. Appl."}],"container-title":["Discrete &amp; Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-023-00497-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00454-023-00497-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-023-00497-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,12]],"date-time":"2023-08-12T19:02:43Z","timestamp":1691866963000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00454-023-00497-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,4,25]]},"references-count":27,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,9]]}},"alternative-id":["497"],"URL":"https:\/\/doi.org\/10.1007\/s00454-023-00497-x","relation":{},"ISSN":["0179-5376","1432-0444"],"issn-type":[{"value":"0179-5376","type":"print"},{"value":"1432-0444","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,4,25]]},"assertion":[{"value":"1 August 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 July 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 July 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 April 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}