The DOI matches its Crossref record.
Central Limit Theorems for Some Graphs in Computational Geometry
Open accessAbstract
Let $(B_n)$ be an increasing sequence of regions in $d$ -dimensional space with volume $n$ and with union $\mathbb{R}^d$. We prove a general central limit theorem for functionals of point sets, obtained either by restricting a homogeneous Poisson process to $(B_n)$, or by by taking $n$ uniformly distributed points in $(B_n)$. The sets $(B_n)$ could be all cubes but a more general class of regions$(B_n)$ is considered. Using this general result we obtain central limit theorems for specific functionals suchas total edge lengthand number of components, defined in terms of graphs such as the $k$-nearest neighbors graph, the sphere of influence graph and the Voronoi graph.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
An Introduction to Topological Data Analysis: Fundamental and Practical Aspects for Data Scientists
Chazal, F., & Michel, B. (2021) · Frontiers in Artificial Intelligence · doi:10.3389/frai.2021.667963 · Cited by 581
Residual Analysis for Spatial Point Processes (with Discussion)
Baddeley, A., Turner, R., Møller, J., & Hazelton, M. (2005) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.1467-9868.2005.00519.x · Cited by 313
Probability measures on the space of persistence diagrams
Mileyko, Y., Mukherjee, S., & Harer, J. (2011) · Inverse Problems · doi:10.1088/0266-5611/27/12/124007 · Cited by 249
Fréchet Means for Distributions of Persistence Diagrams
Turner, K., Mileyko, Y., Mukherjee, S., & Harer, J. (2014) · Discrete & Computational Geometry · doi:10.1007/s00454-014-9604-7 · Cited by 207
“Much of this work involved the study of random abstract simplicial complexes generated from stochastic processes [22, 23, 11, 10, 14, 12] and non-asymptotic bounds on the convergence or consistency of topological summaries as the number of points increase [19, 20, 6, 4, 2].”
Background
Metadata
- Authors
- Penrose, M. D., & Yukich, J. E.
- Venue
- The Annals of Applied Probability
- Publisher
- Institute of Mathematical Statistics
- Published
- 2001-11-01
- Volume
- 11
- Issue
- 4
- Pages
- 1005-1041
- ISSN
- 1050-5164 (ISSN-L)
- OpenAlex
- W2076283741
- Cited by
- 192
- References
- 0
- FWCI
- 9.13
- Type
- journal article
- Language
- en
- Open access
- hybrid
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Central Limit Theorems for Some Graphs in Computational Geometry. https://app.cochat.ai/papers/10.1214/aoap/1015345393
- The paper
- Penrose, M. D., & Yukich, J. E. (2001). Central Limit Theorems for Some Graphs in Computational Geometry. The Annals of Applied Probability. https://doi.org/10.1214/aoap/1015345393
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.