arXiv (All)
open access
Sharp detection thresholds for random geometric graphs with polynomial average degrees
We study the random geometric graph formed by connecting $n$ independent uniform points on $\mathbb S^{d-1}$ whenever their inner product exceeds a threshold chosen to give edge density $p$. We establish the conjectured dimensionality threshold for indistinguishability from the Erdös-Rényi graph $G(
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
- Tight Bounds for Tusnády's Problem in the Plane#1217865
- The number of realisations of a random graph#820460
- Shape theorem for excited random walks on the integer lattice#1217099
- First-Order Laws for Random Geometric Graphs on the Torus#1062130
- The threshold for online balancing of i.i.d. binary vectors#1084877
Record · ID 1218252
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