arXiv (All)
open access
First-Order Laws for Random Geometric Graphs on the Torus
Let $G_D(n;r)$ be the random geometric graph generated by $n$ independent uniform points on the $D$-dimensional torus, with adjacency defined by torus $L^\infty$-distance at most $r$. We study first-order zero-one and convergence laws at fixed radius and in sparse regimes. At fixed radius, we determ
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
- Point process convergence of large inradii of Poisson-Laguerre tessellations#1034546
- Local laws and spectral properties of deformed sparse random matrices#179199
- Random burning of the Euclidean torus#1129108
- Distribution-uniform strong laws of large numbers#1063704
- The number of realisations of a random graph#820460
Record · ID 1062130
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