Cut distance identifying graphon parameters over weak* limits

@article{Dolevzal2022CutDI,
  title={Cut distance identifying graphon parameters over weak* limits},
  author={Martin Dolevzal and Jan Greb'ik and Jan Hladk'y and Israel Rocha and V{\'a}clav Rozhoň},
  journal={J. Comb. Theory, Ser. A},
  year={2022},
  volume={189},
  pages={105615}
}

Figures from this paper

Relating the cut distance and the weak* topology for graphons
Convex graphon parameters and graph norms
Sidorenko's conjecture states that the number of copies of a bipartite graph $H$ in a graph $G$ is asymptotically minimised when $G$ is a quasirandom graph. A notorious example where this conjecture
Left-cut-percolation and induced-Sidorenko bigraphs
A Sidorenko bigraph is one whose density in a bigraphon W is minimized precisely when W is constant. Several techniques of the literature to prove the Sidorenko property consist of decomposing
Finitely forcible graphons with an almost arbitrary structure
Graphons are analytic objects representing convergent sequences of large graphs. A graphon is said to be finitely forcible if it is determined by finitely many subgraph densities, i.e., if the
Subgraph densities in Markov spaces
We generalize subgraph densities, arising in dense graph limit theory, to Markov spaces (symmetric measures on the square of a standard Borel space). More generally, we define an analogue of the set
Two Remarks on Graph Norms
TLDR
The theory of (weakly) norming graphs is studied and two results that contribute to the theory are obtained.
Cut-norm and entropy minimization over weak⁎ limits

References

SHOWING 1-10 OF 44 REFERENCES
Relating the cut distance and the weak* topology for graphons
Subgraph Densities in Signed Graphons and the Local Simonovits-Sidorenko Conjecture
TLDR
This study proves inequalities between the densities of various bipartite subgraphs in signed graphs in the framework of graphons (2-variable functions serving as limit objects for graph sequences), which in this context was already used by Sidorenko.
Convex graphon parameters and graph norms
Sidorenko's conjecture states that the number of copies of a bipartite graph $H$ in a graph $G$ is asymptotically minimised when $G$ is a quasirandom graph. A notorious example where this conjecture
The step Sidorenko property and non-norming edge-transitive graphs
Large Networks and Graph Limits
The book Large Networks and Graph Limits, xiv + 475 pp., published in late 2012, comprises five parts, the first an illuminating introduction and the last a tantalizing taste of how the scope of the
On exchangeable random variables and the statistics of large graphs and hypergraphs
De Finetti’s classical result of [18] identifying the law of an exchangeable family of random variables as a mixture of i.i.d. laws was extended to structure theorems for more complex notions of
Finitely forcible graph limits are universal
Limits of dense graph sequences
On the Local Approach to Sidorenko's Conjecture
Finitely forcible graphons with an almost arbitrary structure
Graphons are analytic objects representing convergent sequences of large graphs. A graphon is said to be finitely forcible if it is determined by finitely many subgraph densities, i.e., if the
...
...