arXiv (All)
open access
Gaussian and non-Gaussian limits for the total edge-length of random directional nearest-neighbour graphs
We study planar random spatial graphs defined by inserting an edge between every point of a homogeneous Poisson process on the unit square and a nearest-neighbour within a fixed cone of directions (if there is such a point). We prove large-sample distributional limit theorems for the total Euclidean
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Identication and Estimation of Nonsymmetric Determinantal Point Processes#1325416
- Optimal detection of geometry in random graphs and kernel matrices at critical thresholds#1326522
- Covering large-dimensional Euclidean spaces by random translates of a given convex body#617880
- Covering large-dimensional Euclidean spaces by random translates of a given convex body#617380
- The anisotropic local law for sample covariance matrices under quadratic-form concentration#999897
Record · ID 1491748
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive