{"title":"Gibbs点过程的拟多项式时间算法","authors":"Matthew Jenssen, Marcus Michelen, M. Ravichandran","doi":"10.1017/s0963548323000251","DOIUrl":null,"url":null,"abstract":"\n We demonstrate a quasipolynomial-time deterministic approximation algorithm for the partition function of a Gibbs point process interacting via a stable potential. This result holds for all activities \n \n \n \n$\\lambda$\n\n \n for which the partition function satisfies a zero-free assumption in a neighbourhood of the interval \n \n \n \n$[0,\\lambda ]$\n\n \n . As a corollary, for all finiterange stable potentials, we obtain a quasipolynomial-time deterministic algorithm for all \n \n \n \n$\\lambda \\lt 1/(e^{B + 1} \\hat C_\\phi )$\n\n \n where \n \n \n \n$\\hat C_\\phi$\n\n \n is a temperedness parameter and \n \n \n \n$B$\n\n \n is the stability constant of \n \n \n \n$\\phi$\n\n \n . In the special case of a repulsive potential such as the hard-sphere gas we improve the range of activity by a factor of at least \n \n \n \n$e^2$\n\n \n and obtain a quasipolynomial-time deterministic approximation algorithm for all \n \n \n \n$\\lambda \\lt e/\\Delta _\\phi$\n\n \n , where \n \n \n \n$\\Delta _\\phi$\n\n \n is the potential-weighted connective constant of the potential \n \n \n \n$\\phi$\n\n \n . Our algorithm approximates coefficients of the cluster expansion of the partition function and uses the interpolation method of Barvinok to extend this approximation throughout the zero-free region.","PeriodicalId":10503,"journal":{"name":"Combinatorics, Probability and Computing","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2022-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Quasipolynomial-time algorithms for Gibbs point processes\",\"authors\":\"Matthew Jenssen, Marcus Michelen, M. Ravichandran\",\"doi\":\"10.1017/s0963548323000251\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\\n We demonstrate a quasipolynomial-time deterministic approximation algorithm for the partition function of a Gibbs point process interacting via a stable potential. This result holds for all activities \\n \\n \\n \\n$\\\\lambda$\\n\\n \\n for which the partition function satisfies a zero-free assumption in a neighbourhood of the interval \\n \\n \\n \\n$[0,\\\\lambda ]$\\n\\n \\n . As a corollary, for all finiterange stable potentials, we obtain a quasipolynomial-time deterministic algorithm for all \\n \\n \\n \\n$\\\\lambda \\\\lt 1/(e^{B + 1} \\\\hat C_\\\\phi )$\\n\\n \\n where \\n \\n \\n \\n$\\\\hat C_\\\\phi$\\n\\n \\n is a temperedness parameter and \\n \\n \\n \\n$B$\\n\\n \\n is the stability constant of \\n \\n \\n \\n$\\\\phi$\\n\\n \\n . In the special case of a repulsive potential such as the hard-sphere gas we improve the range of activity by a factor of at least \\n \\n \\n \\n$e^2$\\n\\n \\n and obtain a quasipolynomial-time deterministic approximation algorithm for all \\n \\n \\n \\n$\\\\lambda \\\\lt e/\\\\Delta _\\\\phi$\\n\\n \\n , where \\n \\n \\n \\n$\\\\Delta _\\\\phi$\\n\\n \\n is the potential-weighted connective constant of the potential \\n \\n \\n \\n$\\\\phi$\\n\\n \\n . Our algorithm approximates coefficients of the cluster expansion of the partition function and uses the interpolation method of Barvinok to extend this approximation throughout the zero-free region.\",\"PeriodicalId\":10503,\"journal\":{\"name\":\"Combinatorics, Probability and Computing\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-09-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Combinatorics, Probability and Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1017/s0963548323000251\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Combinatorics, Probability and Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1017/s0963548323000251","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Quasipolynomial-time algorithms for Gibbs point processes
We demonstrate a quasipolynomial-time deterministic approximation algorithm for the partition function of a Gibbs point process interacting via a stable potential. This result holds for all activities
$\lambda$
for which the partition function satisfies a zero-free assumption in a neighbourhood of the interval
$[0,\lambda ]$
. As a corollary, for all finiterange stable potentials, we obtain a quasipolynomial-time deterministic algorithm for all
$\lambda \lt 1/(e^{B + 1} \hat C_\phi )$
where
$\hat C_\phi$
is a temperedness parameter and
$B$
is the stability constant of
$\phi$
. In the special case of a repulsive potential such as the hard-sphere gas we improve the range of activity by a factor of at least
$e^2$
and obtain a quasipolynomial-time deterministic approximation algorithm for all
$\lambda \lt e/\Delta _\phi$
, where
$\Delta _\phi$
is the potential-weighted connective constant of the potential
$\phi$
. Our algorithm approximates coefficients of the cluster expansion of the partition function and uses the interpolation method of Barvinok to extend this approximation throughout the zero-free region.