{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,25]],"date-time":"2025-02-25T05:24:29Z","timestamp":1740461069783,"version":"3.37.3"},"reference-count":34,"publisher":"Cambridge University Press (CUP)","issue":"1","license":[{"start":{"date-parts":[[2024,10,11]],"date-time":"2024-10-11T00:00:00Z","timestamp":1728604800000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["cambridge.org"],"crossmark-restriction":true},"short-container-title":["Combinator. Probab. Comp."],"published-print":{"date-parts":[[2025,1]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We study computational aspects of repulsive Gibbs point processes, which are probabilistic models of interacting particles in a finite-volume region of space. We introduce an approach for reducing a Gibbs point process to the hard-core model, a well-studied discrete spin system. Given an instance of such a point process, our reduction generates a random graph drawn from a natural geometric model. We show that the partition function of a hard-core model on graphs generated by the geometric model concentrates around the partition function of the Gibbs point process. Our reduction allows us to use a broad range of algorithms developed for the hard-core model to sample from the Gibbs point process and approximate its partition function. This is, to the extent of our knowledge, the first approach that deals with pair potentials of unbounded range.<\/jats:p>","DOI":"10.1017\/s0963548324000282","type":"journal-article","created":{"date-parts":[[2024,10,11]],"date-time":"2024-10-11T07:06:24Z","timestamp":1728630384000},"page":"63-89","update-policy":"https:\/\/doi.org\/10.1017\/policypage","source":"Crossref","is-referenced-by-count":0,"title":["Sampling repulsive Gibbs point processes using random graphs"],"prefix":"10.1017","volume":"34","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"}]},{"given":"Marcus","family":"Pappik","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2024,10,11]]},"reference":[{"key":"S0963548324000282_ref5","doi-asserted-by":"publisher","DOI":"10.1063\/1.1677837"},{"key":"S0963548324000282_ref26","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-9469.2007.00569.x"},{"key":"S0963548324000282_ref8","doi-asserted-by":"publisher","DOI":"10.1063\/1.481068"},{"key":"S0963548324000282_ref31","doi-asserted-by":"publisher","DOI":"10.1142\/p060"},{"key":"S0963548324000282_ref22","doi-asserted-by":"publisher","DOI":"10.1063\/1.1699114"},{"key":"S0963548324000282_ref19","doi-asserted-by":"crossref","unstructured":"[19] Jansen, S. (2018) Gibbsian point processes, pp. 1\u2013106","DOI":"10.1201\/9781351075817-1"},{"key":"S0963548324000282_ref2","first-page":"1","article-title":"Entropic independence II: optimal sampling and concentration via restricted modified log-sobolev inequalities","author":"Anari","year":"2021","journal-title":"CoRR"},{"key":"S0963548324000282_ref21","volume-title":"Large networks and graph limits","volume":"60","author":"Lov\u00e1sz","year":"2012"},{"volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","year":"2023","author":"Anand","key":"S0963548324000282_ref1"},{"key":"S0963548324000282_ref17","doi-asserted-by":"publisher","DOI":"10.1214\/21-AAP1728"},{"key":"S0963548324000282_ref7","first-page":"586","article-title":"The jackknife estimate of variance","author":"Efron","year":"1981","journal-title":"Ann. Stats."},{"key":"S0963548324000282_ref9","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.21079"},{"key":"S0963548324000282_ref20","first-page":"1","article-title":"Quasipolynomial-time algorithms for Gibbs point processes","volume":"33","author":"Jenssen","year":"2023","journal-title":"Comb. Probab. Comp"},{"key":"S0963548324000282_ref24","doi-asserted-by":"publisher","DOI":"10.1007\/BF00050669"},{"key":"S0963548324000282_ref33","doi-asserted-by":"publisher","DOI":"10.1145\/1132516.1132538"},{"key":"S0963548324000282_ref15","first-page":"159","article-title":"Perfect simulation of the hard disks model by partial rejection sampling","volume":"8","author":"Guo","year":"2021","journal-title":"Annales de l\u2019Institut Henri Poincar\u00e9 D."},{"key":"S0963548324000282_ref18","doi-asserted-by":"publisher","DOI":"10.3150\/10-BEJ350"},{"key":"S0963548324000282_ref4","doi-asserted-by":"publisher","DOI":"10.1007\/0-387-31144-0_2"},{"key":"S0963548324000282_ref12","first-page":"15","volume-title":"48th International Colloquium on Automata, Languages, and Programming (ICALP)","volume":"198","author":"Friedrich","year":"2021"},{"key":"S0963548324000282_ref10","doi-asserted-by":"crossref","unstructured":"[10] Friedrich, T. , G\u00f6bel, A. , Katzmann, M. , Krejca, M. and Pappik, M. (2022) Using random graphs to sample repulsive Gibbs point processes with arbitrary-range potentials. CoRR abs\/2204.01793 1\u201347","DOI":"10.1017\/S0963548324000282"},{"key":"S0963548324000282_ref30","doi-asserted-by":"publisher","DOI":"10.1145\/1516512.1516520"},{"key":"S0963548324000282_ref3","doi-asserted-by":"publisher","DOI":"10.1038\/ncomms6424"},{"key":"S0963548324000282_ref34","doi-asserted-by":"publisher","DOI":"10.1143\/PTP.52.822"},{"key":"S0963548324000282_ref29","doi-asserted-by":"publisher","DOI":"10.1007\/s00440-016-0708-2"},{"key":"S0963548324000282_ref23","doi-asserted-by":"publisher","DOI":"10.1007\/s10955-022-02969-5"},{"key":"S0963548324000282_ref25","doi-asserted-by":"publisher","DOI":"10.1201\/9780203496930"},{"volume-title":"An Introduction to the Theory of Point Processes. Volume II: General Theory and Structure","year":"2008","author":"Daley","key":"S0963548324000282_ref6"},{"key":"S0963548324000282_ref32","doi-asserted-by":"publisher","DOI":"10.37236\/1552"},{"key":"S0963548324000282_ref16","first-page":"641","volume-title":"Bernoulli","author":"H\u00e4ggstr\u00f6m","year":"1999"},{"key":"S0963548324000282_ref28","doi-asserted-by":"publisher","DOI":"10.1142\/4090"},{"key":"S0963548324000282_ref27","doi-asserted-by":"publisher","DOI":"10.1016\/0378-4371(89)90108-8"},{"key":"S0963548324000282_ref13","first-page":"283","volume-title":"Resenhas do Instituto de Matem\u00e1tica e Estat\u00edstica da Universidade de S\u00e3o Paulo","volume":"4","author":"Garcia","year":"2000"},{"key":"S0963548324000282_ref14","doi-asserted-by":"publisher","DOI":"10.2307\/3215003"},{"key":"S0963548324000282_ref11","doi-asserted-by":"crossref","unstructured":"[11] Friedrich, T. , G\u00f6bel, A. , Katzmann, M. , Krejca, M. S. and Pappik, M. (2023) Algorithms for hard-constraint point processes via discretization. In Computing and Combinatorics: 28th International Conference, COCOON 2022, Shenzhen, China, October 22-24, 2022. Springer, pp. 242\u2013254.","DOI":"10.1007\/978-3-031-22105-7_22"}],"container-title":["Combinatorics, Probability and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0963548324000282","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,24]],"date-time":"2025-02-24T09:51:27Z","timestamp":1740390687000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0963548324000282\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10,11]]},"references-count":34,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,1]]}},"alternative-id":["S0963548324000282"],"URL":"https:\/\/doi.org\/10.1017\/s0963548324000282","relation":{},"ISSN":["0963-5483","1469-2163"],"issn-type":[{"type":"print","value":"0963-5483"},{"type":"electronic","value":"1469-2163"}],"subject":[],"published":{"date-parts":[[2024,10,11]]},"assertion":[{"value":"\u00a9 The Author(s), 2024. Published by Cambridge University Press","name":"copyright","label":"Copyright","group":{"name":"copyright_and_licensing","label":"Copyright and Licensing"}},{"value":"This is an Open Access article, distributed under the terms of the Creative Commons Attribution licence (https:\/\/creativecommons.org\/licenses\/by\/4.0\/), which permits unrestricted re-use, distribution, and reproduction in any medium, provided the original work is properly cited.","name":"license","label":"License","group":{"name":"copyright_and_licensing","label":"Copyright and Licensing"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}