SOURCE-LINKED INTELLIGENCE

Explicit Bounds on the Entropy of Piecewise Hölder Graphon Models

arXiv · AI, language, vision and robotics · article · Aug 27, 2026 · UTC

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.

Read original source ↗ Open in workspace

recordType

paper

region

Global