Skip to content
DraconiticResearch
Search Sources API
203,203 studies31 sourcesUpdated 3 min ago
PreprintCC BY 4.0arXiv

Density of states of randomly sprinkled graphs

  • Antti Knowles
  • Steffen Polzer
Open at sourcePDFDOICite

Abstract

Independently at every vertex x of a large core graph 𝔾, 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 disorder arises from local perturbations to the graph geometry. We show that it is naturally connected both to the Anderson model and to site percolation on 𝔾 by deriving an Anderson-percolation representation for its spectrum. We characterize the support of the spectrum and derive quantitative bounds on the integrated density of states. We also analyse in detail the regime of sparse sprinkling, in particular investigating the behaviour of the density of states in the vicinity of atoms.

Related

  1. A universal dichotomy for concentration in randomly colored graphs
    Nicola Apollonio
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  2. Powers of Hamiltonian Cycles in Randomly Augmented Pósa-Seymour Graphs
    Sylwia Antoniuk, Andrzej Dudek, Andrzej Ruciński
    The Electronic Journal of CombinatoricsPeer-reviewedCC BY 4.0Full textCombinatorics & discrete mathematicsCrossref
  3. Maximizing Kr + Ir in graphs with fixed edge density
    József Balogh, Andrzej Grzesik, Bernard Lidický +3
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  4. A sharp density bound for 5-connected graphs with no Ke minor
    Caibing Chang, Zijian Deng, Qinfei Tang +1
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  5. Characterizing $3$-graphs with Degenerate Codegree Turán Density
    Dylan King, Simón Piga, Marcelo Sales +1
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv

Cite

BibTeXRIS
BibTeX
@misc{knowles2026density,
  title = {{Density of states of randomly sprinkled graphs}},
  author = {Antti Knowles and Steffen Polzer},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2609.17348},
  eprint = {2609.17348},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.17348},
  note = {CC BY 4.0},
}
RIS
TY  - UNPB
TI  - Density of states of randomly sprinkled graphs
AU  - Antti Knowles
AU  - Steffen Polzer
PY  - 2026
DA  - 2026/09/15
PB  - arXiv
DO  - 10.48550/arxiv.2609.17348
UR  - https://arxiv.org/abs/2609.17348
AB  - Independently at every vertex x of a large core graph 𝔾, 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 disorder arises from local perturbations to the graph geometry. We show that it is naturally connected both to the Anderson model and to site percolation on 𝔾 by deriving an Anderson-percolation representation for its spectrum. We characterize the support of the spectrum and derive quantitative bounds on the integrated density of states. We also analyse in detail the regime of sparse sprinkling, in particular investigating the behaviour of the density of states in the vicinity of atoms.
ER  -