×
Aug 2, 2021 · Our results are based on a new framework for exploiting local central limit theorems as an algorithmic tool. We use a combination of Fourier ...
Jun 10, 2022 · We prove a new local central limit theorem for the hard-core model that applies to all fugacities below λ c (Δ), the uniqueness threshold on the infinite Δ- ...
2022. "Approximate. Counting and Sampling via Local Central Limit Theorems." As Published: https://doi.org/10.1145/3519935.3519957.
People also ask
Sep 6, 2024 · Our results are based on a new framework for exploiting local central limit theorems as an algorithmic tool. We use a combination of Fourier ...
Jun 2, 2022 · Approximate counting and sampling via local central limit theorems. Vishesh Jain (Stanford University), Will Perkins (UIC), Ashwin Sah (MIT) ...
A new local central limit theorem for the hard-core model that applies to all fugacities below λc(Δ), the uniqueness threshold on the infinite Δ-regular ...
We introduce a framework for exploiting local central limit theorems as algorithmic tools. As applications, for general graphs $G$ with bounded maximum ...
We demonstrate a natural example by giving a quantitative central limit theorem (also known as Berry-Esseen inequality) for the size of a random independent set ...
Sep 3, 2021 · We give deterministic approximate counting algorithms for the number of matchings and independent sets of a given size in bounded degree ...
I will describe how local central limit theorems (and Fourier-analytic proofs of local central limit theorems) can be used to design fast sampling algorithms.
Missing: via | Show results with:via