arXiv (All)
open access
Maximum degree for random geometric graphs in the connectivity regime and beyond
A random geometric graph is a random graph model whose vertex set is a binomial point process, where two vertices are connected by an edge if each lies within the ball of radius $r$ centered at the other. In this paper, we investigate the asymptotic fluctuations of the threshold radius required for
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
- An Approximate-Master-Equation Formulation of the Watts Threshold Model on Hypergraphs#1342311
- On the Turán Number of Generalized Theta Graphs#1122862
- Combinatorial Theory: Introduction to Graph Theory, Extremal and Enumerative Combinatorics#66909
- A Sharper Theory of Ball-Proximal Optimization: Convergence and Radius Selection#1129745
- Ergodic and Metastable Behavior of Stochastic Popularity Dynamics in Social Networks#1354701
Record · ID 1326874
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