Limits of dense graph sequences

Details Limits of dense graph sequences Limits of dense graph sequences

2004-08-12

arxiv.org/abs/math/0408173v2

Mathematics

Combinatorics

27 pages; added extension of result (Sept 22, 2004)

Scientific paper

We show that if a sequence of dense graphs has the property that for every fixed graph F, the density of copies of F in these graphs tends to a limit, then there is a natural ``limit object'', namely a symmetric measurable 2-variable function on [0,1]. This limit object determines all the limits of subgraph densities. We also show that the graph parameters obtained as limits of subgraph densities can be characterized by ``reflection positivity'', semidefiniteness of an associated matrix. Conversely, every such function arises as a limit object. Along the lines we introduce a rather general model of random graphs, which seems to be interesting on its own right.

Affiliated with

Also associated with

No associations

Rating

Limits of dense graph sequences 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 dense graph sequences, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Limits of dense graph sequences will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-200951