Banach-valued graph limits: Graphon representability and Banach-space structure
arXiv:2607.26687
The paper investigates when limits of sequences of Banach‑decorated graphs can be represented by Banach‑valued graphons, linking this graph‑limit problem to structural properties of the underlying Banach space.
Abstract
We study a graph-limit problem for Banach-decorated graphs. Given a sequence of -decorated graphs whose homomorphism densities converge against all -decorated test graphs, we ask whether the limiting densities are represented by an -valued graphon. The results connect this graph-limit problem with Banach-space structure. If is separable, then the graphon representation property for graph sequences uniformly bounded in for every finite holds if and only if is reflexive. For Banach lattices, it is equivalent to the Radon--Nikodým property. For dual Banach spaces, it is equivalent to the conjunction of the Radon--Nikodým property and weak sequential completeness. In the bounded setting, the same characterization extends to arbitrary Banach spaces: for every Banach space , the representation property for uniformly -bounded graph sequences holds if and only if has the Radon--Nikodým property and is weakly sequentially complete.
31 pages, 3 figures