
We work out the graph limit theory for dense interval graphs. The theory developed departs from the usual description of a graph limit as a symmetric function $W(x,y)$ on the unit square, with $x$ and $y$ uniform on the interval $(0,1)$. Instead, we fix a $W$ and change the underlying distribution of the coordinates $x$ and $y$. We find choices such that our limits are continuous. Connections to random interval graphs are given, including some examples. We also show a continuity result for the chromatic number and clique number of interval graphs. Some results on uniqueness of the limit description are given for general graph limits.
28 pages, 4 figures
Combinatorial probability, Random graphs (graph-theoretic aspects), FOS: Mathematics, Mathematics - Combinatorics, 60c05 (68P10), interval graphs, Combinatorics (math.CO), graph limits, Searching and sorting, intersection graphs
Combinatorial probability, Random graphs (graph-theoretic aspects), FOS: Mathematics, Mathematics - Combinatorics, 60c05 (68P10), interval graphs, Combinatorics (math.CO), graph limits, Searching and sorting, intersection graphs
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 13 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
