Limits of compact decorated graphs

Details Limits of compact decorated graphs Limits of compact decorated graphs

2010-10-25

arxiv.org/abs/1010.5155v1

Mathematics

Combinatorics

14 pages

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Limits of compact decorated graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Limits of compact decorated graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Limits of compact decorated graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-94297