arXiv (All)
open access
Explicit Bounds on the Entropy of Piecewise Hölder Graphon Models
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 th
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
- Zeros of the independence polynomial on recursive sequences of graphs#1129703
- Asymptotic normality of embedding distributions of some families of graphs#1201897
- Encoding and Enumerating Acyclic Orientations of Graphs#1200707
- On the number of edges of restricted matchstick graphs#1327233
- Iterated Graph Systems (II): Bernoulli percolation and critical-exponent universality classes on hierarchical lattices#1234894
Record · ID 1247466
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