For the new Random Connection Model of simplicial complexes, a generalized Euler characteristic is shown to satisfy quantitative central limit theorems in high-intensity and large-window limits.
Diestel.Graph Theory, volume 173 ofGraduate Texts in Mathematics
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
math.PR 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
Central limit theorems for the Euler characteristic in the Random Connection Model for higher-dimensional simplicial complexes
For the new Random Connection Model of simplicial complexes, a generalized Euler characteristic is shown to satisfy quantitative central limit theorems in high-intensity and large-window limits.