arXiv (All)
open access
Detecting Random Geometric Graphs with General Kernel
We study testing a random geometric graph with a fixed kernel against an Erdős-Rényi graph with the same edge density. Under the null hypothesis, the graph has $n$ vertices and independent edges with probability $p$. Under the alternative hypothesis, latent points $X_1,\ldots,X_n$ are independent an
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
- Optimal detection of geometry in random graphs and kernel matrices at critical thresholds#1326522
- Counterexamples to the Mao-Wu-Xu spectral conjecture and a three-scale boundary for spherical random graphs#1013687
- Identication and Estimation of Nonsymmetric Determinantal Point Processes#1325416
- The number of realisations of a random graph#820460
- First-Order Laws for Random Geometric Graphs on the Torus#1062130
Record · ID 1296772
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