English

Normal approximation for statistics of randomly weighted complexes

Probability 2024-07-18 v2

Abstract

We prove normal approximation bounds for statistics of randomly weighted (simplicial) complexes. In particular, we consider the complete dd-dimensional complex on nn vertices with dd-simplices equipped with i.i.d. weights. Our normal approximation bounds are quantified in terms of stabilization of difference operators, i.e., the effect on the statistic under addition/deletion of simplices. Our proof is based on Chatterjee's normal approximation bound and is a higher-dimensional analogue of the work of Cao on sparse Erd\H{o}s-R\'enyi random graphs but our bounds are more in the spirit of `quantitative two-scale stabilization' bounds by Lachi\`eze-Rey, Peccati, and Yang. As applications, we prove a CLT for nearest face-weights in randomly weighted dd-complexes and give a normal approximation bound for local statistics of random dd-complexes.

Keywords

Cite

@article{arxiv.2312.07771,
  title  = {Normal approximation for statistics of randomly weighted complexes},
  author = {Shu Kanazawa and Khanh Duy Trinh and D. Yogeshwaran},
  journal= {arXiv preprint arXiv:2312.07771},
  year   = {2024}
}

Comments

Apart from typographical changes, a minor error in the bounds in Corollaries 2.7 and 2.8 has been corrected; 24 pages

R2 v1 2026-06-28T13:49:08.356Z