Fast and perfect sampling of subgraphs and polymer systems

A Blanca, S Cannon, W Perkins - ACM Transactions on Algorithms, 2024 - dl.acm.org
We give an efficient perfect sampling algorithm for weighted, connected induced subgraphs
(or graphlets) of rooted, bounded degree graphs. Our algorithm utilizes a vertex-percolation …

Sampling repulsive Gibbs point processes using random graphs

T Friedrich, A Göbel, M Katzmann… - Combinatorics …, 2025 - cambridge.org
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 …

Analyticity for classical hard-core gases via recursion

Q He - arxiv preprint arxiv:2405.04451, 2024 - arxiv.org
In the recent work of [Michelen, Perkins, Comm. Math. Phys. 399: 1 (2023)], a new lower
bound of $ eC_ {\phi}(\beta)^{-1} $ is obtained for the positive activity up to which the …

Leibniz International Proceedings in Informatics (LIPIcs): Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX …

S Chawla, E Gergatsouli, J McMahan, C Tzamos - APPROX RANDOM, 2023 - par.nsf.gov
We revisit the classic Pandora's Box (PB) problem under correlated distributions on the box
values. Recent work of [Shuchi Chawla et al., 2020] obtained constant approximate …

Potential-Weighted Connective Constants and Uniqueness of Gibbs Measures

M Michelen, W Perkins - Communications in Mathematical Physics, 2025 - Springer
We define a new 'potential-weighted connective constant'that measures the effective
strength of a repulsive pair potential of a Gibbs point process modulated by the geometry of …