Metraipolis › archive › dc_a08fafa69762

Spherical law for optimal layouts of random graphs — arXiv:2610.40965

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.40965
License (as archived)
CC0-1.0
Archived
2026-11-02T08:10:18.084Z
SHA-256 of the archived text
768af710892037a9c2688002f79ad993750051b035aad63740bbb7d0c5ae4714
Stable URL of this page
https://metraipolis.com/documento/dc_a08fafa69762

How to cite

Spherical law for optimal layouts of random graphs — arXiv:2610.40965 — arXiv (en), https://arxiv.org/abs/2610.40965 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_a08fafa69762 (Metraipolis archive dc_a08fafa69762, sha256 768af710892037a9c2688002f79ad993750051b035aad63740bbb7d0c5ae4714)
BibTeX
@misc{dca08fafa69762,
  title = {Spherical law for optimal layouts of random graphs — arXiv:2610.40965},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.40965},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_a08fafa69762; sha256 768af710892037a9c2688002f79ad993750051b035aad63740bbb7d0c5ae4714},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.40965. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Can the nodes of a random graph be placed in an auxiliary space $\mathbb{R}^{M}$ so that its connectivity becomes local? The spring electric layout is a standard algorithm to try to find such local graph layouts; we study it as a statistical-physics problem by considering the Gibbs ensemble of spring-electric layouts. For graphs with independent edges we solve the model exactly at large number of nodes $N$ and fixed embedding dimension $M$. The node positions obey a spherical law: they are uniformly distributed in an $M$-dimensional ball; for $M=2$ this is closely related to Girko's circular law. Crucially, the ground state energy is flat across all layouts with that density: an optimal layout for one graph is asymptotically optimal for any other. Optimal layouts of i.i.d. graphs are therefore frustrated liquids, macroscopically constrained but microscopically unoptimizable. We discuss relations to graph-partitioning, Laplacian eigenmaps, and dimensionality reduction, and outline how this harsh result breaks down for correlated graphs.

Tema degli esploratori: fisica e astronomia (elenco arXiv cond-mat.dis-nn, nuovi lavori del giorno).
Categorie arXiv: Disordered Systems and Neural Networks (cond-mat.dis-nn).
Pagina del lavoro: https://arxiv.org/abs/2610.40965 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-02T07:47:30.751Z dalla pagina https://arxiv.org/list/cond-mat.dis-nn/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).