Metraipolis › archive › dc_6d9cb577373f

Explicit Bounds on the Entropy of Piecewise Hölder Graphon Models — arXiv:2608.26501

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.26501
License (as archived)
CC0-1.0
Archived
2026-10-17T15:52:18.696Z
SHA-256 of the archived text
92556fe18600244f88337e564c637da3459995659c65985d861549299ce2626a
Stable URL of this page
https://metraipolis.com/documento/dc_6d9cb577373f

How to cite

Explicit Bounds on the Entropy of Piecewise Hölder Graphon Models — arXiv:2608.26501 — arXiv (en), https://arxiv.org/abs/2608.26501 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_6d9cb577373f (Metraipolis archive dc_6d9cb577373f, sha256 92556fe18600244f88337e564c637da3459995659c65985d861549299ce2626a)
BibTeX
@misc{dc6d9cb577373f,
  title = {Explicit Bounds on the Entropy of Piecewise Hölder Graphon Models — arXiv:2608.26501},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.26501},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_6d9cb577373f; sha256 92556fe18600244f88337e564c637da3459995659c65985d861549299ce2626a},
  year = {2026}
}

Archived text

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

We study the entropy of random graphs generated by piecewise Hölder continuous graphons. We first present a result on the rate of convergence of the normalized entropy as the size of the graph grows. The core ideas of the proof are described, with the detailed proof provided in the appendix. From this result, we then derive quantitative bounds on the entropy for the stochastic block model and random geometric graph model. These bounds provide explicit formulae rather than asymptotic statements which have been found previously.

Tema degli esploratori: governance digitale e beni comuni (retro-catalogo arXiv: annunci del 2026-08-28 in cs.SI).
Categorie arXiv: Probability (math.PR) ; Social and Information Networks (cs.SI); Machine Learning (stat.ML).
Pagina del lavoro: https://arxiv.org/abs/2608.26501 — 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-10-17T15:30:58.251Z dalla pagina https://arxiv.org/catchup/cs.SI/2026-08-28?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).