Limits of compact decorated graphs
arXiv:1010.5155
Abstract
Following a general program of studying limits of discrete structures, and motivated by the theory of limit objects of converge sequences of dense simple graphs, we study the limit of graph sequences such that every edge is labeled by an element of a compact second-countable Hausdorff space K. The "local structure" of these objects can be explored by a sampling process, which is shown to be equivalent to knowing homomorphism numbers from graphs whose edges are decorated by continuous functions on K. The model includes multigraphs with bounded edge multiplicities, graphs whose edges are weighted with real numbers from a finite interval, edge-colored graphs, and other models. In all these cases, a limit object can be defined in terms of 2-variable functions whose values are probability distributions on K.
14 pages
Cited by in corpus (7)
- Graphons, cut norm and distance, couplings and rearrangements
- Limits of discrete distributions and Gibbs measures on random graphs
- Multicolour containers and the entropy of decorated graph limits
- Samplings and observables. Invariants of metric measure spaces
- Probability-graphons: Limits of large dense weighted graphs
- Complexity of Nondeterministic Graph Parameter Testing
- Limits of CSP Problems and Efficient Parameter Testing