Weak randomness in graphons and theons

TL;DR

This paper characterizes hereditary graph families with a property called strong persistence, linking them to substitution-closed families, and introduces the concept of weakly random graphons, extending results to relational structures.

Contribution

It provides a complete characterization of strongly persistent hereditary graph families and introduces the concept of weakly random graphons, extending the theory to relational structures.

Findings

Hereditary families strongly persistent are exactly those closed under substitutions.

Characterization of families with the weakly random Erdős–Hajnal property.

Extension of results to structures in finite relational languages.

Abstract

Call a hereditary family $\mathcal{F}$ of graphs strongly persistent if there exists a graphon $W$ such that in all subgraphons $W'$ of $W$, $\mathcal{F}$ is precisely the class of finite graphs that have positive density in $W'$. Our first result is a complete characterization of the hereditary families of graphs that are strongly persistent as precisely those that are closed under substitutions. We call graphons with the self-similarity property above weakly random. A hereditary family $\mathcal{F}$ is said to have the weakly random Erd\H{o}s--Hajnal property (WR) if every graphon that is a limit of graphs in $\mathcal{F}$ has a weakly random subgraphon. Among families of graphs that are closed under substitutions, we completely characterize the families that belong to WR as those with "few" prime graphs. We also extend some of the results above to structures in finite relational languages by using the theory of theons.