Metraipolis › archive › dc_d3dcedc588d0

Two moments suffice for Bessel approximation: conditioned differences, contingency tables, and probabilistic divide-and-conquer — arXiv:2611.00263

Source
arXiv (en)
Original
https://arxiv.org/abs/2611.00263
License (as archived)
CC0-1.0
Archived
2026-11-03T11:33:43.794Z
SHA-256 of the archived text
347c79be2fd55739c4be025086105bbf51d36e418e32d82f7dc7a468539d4f10
Stable URL of this page
https://metraipolis.com/documento/dc_d3dcedc588d0

How to cite

Two moments suffice for Bessel approximation: conditioned differences, contingency tables, and probabilistic divide-and-conquer — arXiv:2611.00263 — arXiv (en), https://arxiv.org/abs/2611.00263 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_d3dcedc588d0 (Metraipolis archive dc_d3dcedc588d0, sha256 347c79be2fd55739c4be025086105bbf51d36e418e32d82f7dc7a468539d4f10)
BibTeX
@misc{dcd3dcedc588d0,
  title = {Two moments suffice for Bessel approximation: conditioned differences, contingency tables, and probabilistic divide-and-conquer — arXiv:2611.00263},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.00263},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_d3dcedc588d0; sha256 347c79be2fd55739c4be025086105bbf51d36e418e32d82f7dc7a468539d4f10},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.00263. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

We develop Stein's method, with explicit constants throughout, for the discrete Bessel distribution: the law of a Poisson variable given its difference from an independent Poisson variable. The Bessel family is characterized by a birth-death operator with quadratic death rate $n(n+k)$ and as the exact fixed-point set of a centered quadratic-bias transform, and we prove a dependency expansion of Arratia-Goldstein-Gordon type: two joint moments of a column array control the total-variation distance from the conditioned row sum to a matched Bessel law. Applied to the row-constrained Fisher-Yates ensemble on $2\times c$ contingency tables -- independent Bernoulli or capped-Poisson entries conditioned on the row-sum difference, column sums free -- this yields a limit theorem -- which upgrades to the entire conditioned table at the same two-moment error -- a completely explicit enumeration estimate, and an exact divide-and-conquer sampler with certified acceptance. The entire apparatus -- operator, expansion, enumeration, sampler -- generalizes to $r\times c$ tables, where conditioning on all successive row differences produces a hyper-Bessel law. Verification scripts are included as ancillary files.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.PR, nuovi lavori del giorno).
Categorie arXiv: Probability (math.PR) ; Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2611.00263 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-03T11:04:52.200Z dalla pagina https://arxiv.org/list/math.PR/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).