arXiv (OAI Expanded)
open access
Density of states of randomly sprinkled graphs
Independently at every vertex $x$ of a large core graph $\mathbb G$, we draw a random graph and connect $x$ to a subset of its vertices. This model of a randomly sprinkled graph captures qualitative features of commonly observed graphs; it can also be regarded as a model of quantum disorder, where d
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
- Quantum percolation conjecture on regular trees#1142318
- Generating Functions and the Entropy Hierarchy of Strongly Connected Digraphs#1123701
- Efficient Community Search on Attributed Public-Private Graphs#19090
- Determinantal random subgraphs#799804
- On walk entropies in graphs. Response to Dehmer and Mowshowitz#76098
Record · ID 1123715
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