Graphon

← Encyclopedia

External reading guide · Research

A symmetric measurable kernel represents a dense graph limit. Compare step graphons with sampled random graphs, then study how cut distance captures convergence without fixing vertex labels.

Before opening the references

Finite Simple Graph · Lebesgue Measure · Fubini's Theorem

Where to read

  1. Start here: Graph Theory and Additive Combinatorics: Exploring Structure and Randomness (author manuscript)

    Yufei Zhao · Book · English · Free full text

    §4.1 Graphons, Definitions 4.1.1, 4.1.4 and 4.1.5; §4.2 Cut Distance, Definitions 4.2.1 and 4.2.4; §4.4 W-Random Graphs

    Source page · Checked 2026-10-16

Continue from here

Combinatorics & Graph Theory in the library · Preparation and skip guidance

Suggest an edit · Report a correction

Original orientation: CC BY-SA 4.0. Linked texts retain their own licences.