arXiv (All)
open access
Planarity and number of crossings in general models of random geometric graphs
Consider a random geometric graph with vertices given by a Poisson point process, and whose edges depend on independent marks corresponding to the vertices and pairs of vertices. In this paper, we study two related questions on this general model: the number of edge crossings in a projection of this
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
- A law of thin processes with neighbour-count thinning#1061367
- A finite-graph conjecture related to $θ(p_c)=0$ for Bernoulli bond percolation on $\mathbb Z^d$#971895
- Entropy and singularity of spectral and pivotal sets in planar percolation#1109407
- Supercritical phase of the random connection model#972949
- The Borel Distinguishing Number of Schreier Graphs#1084902
Record · ID 985751
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