{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T07:04:16Z","timestamp":1743059056299,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031221040"},{"type":"electronic","value":"9783031221057"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-3-031-22105-7_22","type":"book-chapter","created":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T05:12:32Z","timestamp":1672549952000},"page":"242-254","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Algorithms for\u00a0Hard-Constraint Point Processes via\u00a0Discretization"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0076-6308","authenticated-orcid":false,"given":"Tobias","family":"Friedrich","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5180-7205","authenticated-orcid":false,"given":"Andreas","family":"G\u00f6bel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maximilian","family":"Katzmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1765-1219","authenticated-orcid":false,"given":"Martin S.","family":"Krejca","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2480-3073","authenticated-orcid":false,"given":"Marcus","family":"Pappik","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,1,1]]},"reference":[{"key":"22_CR1","unstructured":"Anari, N., Jain, V., Koehler, F., Pham, H.T., Vuong, T.D.: Entropic independence II: optimal sampling and concentration via restricted modified log-Sobolev inequalities. CoRR abs\/2111.03247 (2021). https:\/\/arxiv.org\/abs\/2111.03247"},{"key":"22_CR2","doi-asserted-by":"crossref","unstructured":"Anari, N., Liu, K., Gharan, S.O.: Spectral independence in high-dimensional expanders and applications to the hardcore model. CoRR abs\/2001.00303 (2020). http:\/\/arxiv.org\/abs\/2001.00303","DOI":"10.1109\/FOCS46700.2020.00125"},{"key":"22_CR3","unstructured":"Boublik, T., Nezbeda, I., Hlavaty, K.: Statistical thermodynamics of simple liquids and their mixtures. Fundam. Stud. Eng. Elsevier (1980)"},{"key":"22_CR4","unstructured":"Chen, X., Feng, W., Yin, Y., Zhang, X.: Rapid mixing of Glauber dynamics via spectral independence for all degrees. CoRR abs\/2105.15005 (2021). http:\/\/arxiv.org\/abs\/2105.15005"},{"key":"22_CR5","doi-asserted-by":"crossref","unstructured":"Chen, Z., Liu, K., Vigoda, E.: Rapid mixing of Glauber dynamics up to uniqueness via contraction. CoRR abs\/2004.09083 (2020). http:\/\/arxiv.org\/abs\/2004.09083","DOI":"10.1109\/FOCS46700.2020.00124"},{"key":"22_CR6","doi-asserted-by":"publisher","unstructured":"Chen, Z., Liu, K., Vigoda, E.: Optimal mixing of Glauber dynamics: entropy factorization via high-dimensional expansion. In: STOC, pp. 1537\u20131550. ACM (2021). https:\/\/doi.org\/10.1145\/3406325.3451035","DOI":"10.1145\/3406325.3451035"},{"key":"22_CR7","unstructured":"Friedrich, T., G\u00f6bel, A., Katzmann, M., Krejca, M., Pappik, M.: Using random graphs to sample repulsive gibbs point processes with arbitrary-range potentials. CoRR abs\/2204.01793 (2022). http:\/\/arxiv.org\/abs\/2204.01793"},{"key":"22_CR8","doi-asserted-by":"publisher","unstructured":"Friedrich, T., G\u00f6bel, A., Krejca, M., Pappik, M.: A spectral independence view on hard spheres via block dynamics. In: Proceedings of the 48th International Colloquium on Automata, Languages, and Programming (ICALP), vol. 198, pp. 66:1\u201366:15 (2021). https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2021.66","DOI":"10.4230\/LIPIcs.ICALP.2021.66"},{"issue":"1","key":"22_CR9","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1002\/rsa.20479","volume":"45","author":"A Galanis","year":"2014","unstructured":"Galanis, A., Ge, Q., Stefankovic, D., Vigoda, E., Yang, L.: Improved inapproximability results for counting independent sets in the hard-core model. Random Struct. Algorithms 45(1), 78\u2013110 (2014). https:\/\/doi.org\/10.1002\/rsa.20479","journal-title":"Random Struct. Algorithms"},{"key":"22_CR10","unstructured":"Guo, H., Jerrum, M.: Perfect simulation of the hard disks model by partial rejection sampling. CoRR abs\/1801.07342 (2018). https:\/\/arxiv.org\/abs\/1801.07342v2"},{"key":"22_CR11","doi-asserted-by":"publisher","unstructured":"Hansen, J.P., McDonald, I.R.: Theory of Simple Liquids. Academic Press, 4th edn. (2013). https:\/\/doi.org\/10.1016\/B978-0-12-387032-2.00013-1","DOI":"10.1016\/B978-0-12-387032-2.00013-1"},{"key":"22_CR12","doi-asserted-by":"publisher","unstructured":"Helmuth, T., Perkins, W., Regts, G.: Algorithmic Pirogov-Sinai theory. In: Proceedings of the 51st Annual ACM Symposium on the Theory of Computing (STOC), pp. 1009\u20131020 (2019). https:\/\/doi.org\/10.1145\/3313276.3316305","DOI":"10.1145\/3313276.3316305"},{"key":"22_CR13","doi-asserted-by":"publisher","first-page":"e1","DOI":"10.1017\/fms.2018.25","volume":"7","author":"M Jenssen","year":"2019","unstructured":"Jenssen, M., Joos, F., Perkins, W.: On the hard sphere model and sphere packings in high dimensions. Forum Math. Sigma 7, e1 (2019). https:\/\/doi.org\/10.1017\/fms.2018.25","journal-title":"Forum Math. Sigma"},{"key":"22_CR14","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/0304-3975(86)90174-X","volume":"43","author":"M Jerrum","year":"1986","unstructured":"Jerrum, M., Valiant, L.G., Vazirani, V.V.: Random generation of combinatorial structures from a uniform distribution. Theoret. Comput. Sci. 43, 169\u2013188 (1986). https:\/\/doi.org\/10.1016\/0304-3975(86)90174-X","journal-title":"Theoret. Comput. Sci."},{"key":"22_CR15","doi-asserted-by":"publisher","unstructured":"Kendall, W.S.: Perfect simulation for the area-interaction point process. In: Accardi, L., Heyde, C.C. (eds.) Probability Towards 2000. Lecture Notes in Statistics, vol. 128, pp. 218\u2013234. Springer, Cham (1998). https:\/\/doi.org\/10.1007\/978-1-4612-2224-8_13","DOI":"10.1007\/978-1-4612-2224-8_13"},{"issue":"6","key":"22_CR16","doi-asserted-by":"publisher","first-page":"1087","DOI":"10.1063\/1.1699114","volume":"21","author":"N Metropolis","year":"1953","unstructured":"Metropolis, N., Rosenbluth, A.W., Rosenbluth, M.N., Teller, A.H., Teller, E.: Equation of state calculations by fast computing machines. J. Chem. Phys. 21(6), 1087\u20131092 (1953). https:\/\/doi.org\/10.1063\/1.1699114","journal-title":"J. Chem. Phys."},{"key":"22_CR17","unstructured":"Michelen, M., Perkins, W.: Strong spatial mixing for repulsive point processes. CoRR abs\/2202.08753 (2022). https:\/\/arxiv.org\/abs\/2202.08753"},{"issue":"6","key":"22_CR18","doi-asserted-by":"publisher","first-page":"1893","DOI":"10.1137\/16M1101003","volume":"46","author":"V Patel","year":"2017","unstructured":"Patel, V., Regts, G.: Deterministic polynomial-time approximation algorithms for partition functions and graph polynomials. SIAM J. Comput. 46(6), 1893\u20131919 (2017). https:\/\/doi.org\/10.1137\/16M1101003","journal-title":"SIAM J. Comput."},{"issue":"1\u20132","key":"22_CR19","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/BF02186829","volume":"77","author":"MD Penrose","year":"1994","unstructured":"Penrose, M.D.: Self-avoiding walks and trees in spread-out lattices. J. Stat. Phys. 77(1\u20132), 3\u201315 (1994). https:\/\/doi.org\/10.1007\/BF02186829","journal-title":"J. Stat. Phys."},{"key":"22_CR20","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., \u0160tefankovi\u010d, 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":"22_CR21","doi-asserted-by":"publisher","unstructured":"Sly, A.: Computational transition at the uniqueness threshold. In: Proceedings of the 51st Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 287\u2013296 (2010). https:\/\/doi.org\/10.1109\/FOCS.2010.34","DOI":"10.1109\/FOCS.2010.34"},{"issue":"3","key":"22_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1516512.1516520","volume":"56","author":"D \u0160tefankovi\u010d","year":"2009","unstructured":"\u0160tefankovi\u010d, D., Vempala, S., Vigoda, E.: Adaptive simulated annealing: a near-optimal connection between sampling and counting. J. ACM 56(3), 1\u201336 (2009). https:\/\/doi.org\/10.1145\/1516512.1516520","journal-title":"J. ACM"},{"key":"22_CR23","doi-asserted-by":"publisher","DOI":"10.1002\/9781118658222","volume-title":"Stochastic Geometry and its Applications","author":"D Stoyan","year":"2013","unstructured":"Stoyan, D., Kendall, W.S., Chiu, S.N., Mecke, J.: Stochastic Geometry and its Applications. Wiley, Hoboken (2013). https:\/\/doi.org\/10.1002\/9781118658222"},{"key":"22_CR24","doi-asserted-by":"publisher","unstructured":"Weitz, D.: Counting independent sets up to the tree threshold. In: Proceedings of the 38th Annual ACM Symposium on the Theory of Computing (STOC), pp. 140\u2013149 (2006). https:\/\/doi.org\/10.1145\/1132516.1132538","DOI":"10.1145\/1132516.1132538"},{"issue":"4","key":"22_CR25","doi-asserted-by":"publisher","first-page":"1670","DOI":"10.1063\/1.1673203","volume":"52","author":"B Widom","year":"1970","unstructured":"Widom, B., Rowlinson, J.S.: New model for the study of liquid-vapor phase transitions. J. Chem. Phys. 52(4), 1670\u20131684 (1970). https:\/\/doi.org\/10.1063\/1.1673203","journal-title":"J. Chem. Phys."}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-22105-7_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,30]],"date-time":"2023-03-30T22:04:59Z","timestamp":1680213899000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-22105-7_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031221040","9783031221057"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-22105-7_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"1 January 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOON","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computing and Combinatorics Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Shenzhen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 October 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 October 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cocoon-conference.org\/2022\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EquinOCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"101","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"39","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"12","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"39% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}