Fractionally log-concave and sector-stable polynomials: counting planar matchings and more

Y Alimohammadi, N Anari, K Shiragur… - Proceedings of the 53rd …, 2021 - dl.acm.org
We show fully polynomial time randomized approximation schemes (FPRAS) for counting
matchings of a given size, or more generally sampling/counting monomer-dimer systems in …

The Poisson binomial distribution—Old & new

W Tang, F Tang - Statistical Science, 2023 - projecteuclid.org
The Poisson Binomial Distribution-Old & New Page 1 Statistical Science 2023, Vol. 38, No. 1,
108–119 https://doi.org/10.1214/22-STS852 © Institute of Mathematical Statistics, 2023 The …

The method of cumulants for the normal approximation

H Döring, S Jansen, K Schubert - Probability Surveys, 2022 - projecteuclid.org
The survey is dedicated to a celebrated series of quantitave results, developed by the
Lithuanian school of probability, on the normal approximation for a real-valued random …

Absence of zeros implies strong spatial mixing

G Regts - Probability Theory and Related Fields, 2023 - Springer
In this paper we show that absence of complex zeros of the partition function of the hard-
core model on any family of bounded degree graphs that is closed under taking induced …

Approximately counting independent sets of a given size in bounded-degree graphs

E Davies, W Perkins - SIAM Journal on Computing, 2023 - SIAM
We determine the computational complexity of approximately counting and sampling
independent sets of a given size in bounded-degree graphs. That is, we identify a critical …

Computational thresholds for the fixed-magnetization Ising model

C Carlson, E Davies, A Kolla, W Perkins - Proceedings of the 54th …, 2022 - dl.acm.org
The ferromagnetic Ising model is a model of a magnetic material and a central topic in
statistical physics. It also plays a starring role in the algorithmic study of approximate …

Optimal mixing of the down-up walk on independent sets of a given size

V Jain, M Michelen, HT Pham… - 2023 IEEE 64th Annual …, 2023 - ieeexplore.ieee.org
Let G be a graph on n vertices of maximum degree Δ. We show that, for any δ\gt0, the down-
up walk on independent sets of size k≦(1-δ)c(Δ)n mixes in time O_Δ,δ(k\logn), thereby …

Probabilistic limit theorems induced by the zeros of polynomials

N Heerten, H Sambale, C Thäle - Mathematische Nachrichten, 2024 - Wiley Online Library
Sequences of discrete random variables are studied whose probability generating functions
are zero‐free in a sector of the complex plane around the positive real axis. Sharp bounds …

Paving property for real stable polynomials and strongly rayleigh processes

K Alishahi, M Barzegar - Bernoulli, 2022 - projecteuclid.org
Paving property for real stable polynomials and strongly Rayleigh processes Page 1 Bernoulli
28(2), 2022, 1198–1223 https://doi.org/10.3150/21-BEJ1383 Paving property for real stable …

Quantification of the Fourth Moment Theorem for Cyclotomic Generating Functions

B Rednoß, C Thäle - arxiv preprint arxiv:2401.09418, 2024 - arxiv.org
This paper deals with sequences of random variables $ X_n $ only taking values in
$\{0,\ldots, n\} $. The probability generating functions of such random variables are …