Metraipolis › archive › dc_52a259d82e86

A Direct Proof of the Locally Dense Graphon Inequality — arXiv:2609.19014

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.19014
License (as archived)
CC0-1.0
Archived
2026-10-15T16:13:12.681Z
SHA-256 of the archived text
b7e92d7ff812819840169abd4fab54d067ef66fedd1558bbc80c5ae28815c64c
Stable URL of this page
https://metraipolis.com/documento/dc_52a259d82e86

How to cite

A Direct Proof of the Locally Dense Graphon Inequality — arXiv:2609.19014 — arXiv (en), https://arxiv.org/abs/2609.19014 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_52a259d82e86 (Metraipolis archive dc_52a259d82e86, sha256 b7e92d7ff812819840169abd4fab54d067ef66fedd1558bbc80c5ae28815c64c)
BibTeX
@misc{dc52a259d82e86,
  title = {A Direct Proof of the Locally Dense Graphon Inequality — arXiv:2609.19014},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.19014},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_52a259d82e86; sha256 b7e92d7ff812819840169abd4fab54d067ef66fedd1558bbc80c5ae28815c64c},
  year = {2026}
}

Archived text

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

Bradač, Sudakov, and Wigderson characterized $p$-locally dense graphons by a quadratic inequality for all bounded nonnegative functions. Their proof uses Reiher's finite lemma and graphon approximation, and they asked for a direct proof. We give one by rounding simple functions. Divide each level set into $m$ equal-measure pieces and retain each piece independently with probability equal to its level. Off-diagonal terms agree in expectation; the diagonal error is at most $\norminf{W-p}/(4m)$. Letting $m\to\infty$ and then approximating in $L^1$ proves the inequality. A three-atom example shows that atomlessness is necessary if arbitrary probability spaces are allowed.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-17 in math.CO).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2609.19014 — 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-15T15:38:58.265Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-17?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).