Interval Graph Limits

被引:11
|
作者
Diaconis, Persi [1 ]
Holmes, Susan [2 ]
Janson, Svante [3 ]
机构
[1] Stanford Univ, Dept Math, Stanford, CA 94305 USA
[2] Stanford Univ, Dept Stat, Stanford, CA 94305 USA
[3] Uppsala Univ, Dept Math, S-75238 Uppsala, Sweden
基金
美国国家科学基金会;
关键词
interval graphs; graph limits; intersection graphs; RANDOM INTERSECTION GRAPHS; TOPOLOGY;
D O I
10.1007/s00026-012-0175-0
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
We work out a 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.
引用
收藏
页码:27 / 52
页数:26
相关论文
共 50 条
  • [1] Interval Graph Limits
    Persi Diaconis
    Susan Holmes
    Svante Janson
    Annals of Combinatorics, 2013, 17 : 27 - 52
  • [3] Graph properties, graph limits, and entropy
    Hatami, Hamed
    Janson, Svante
    Szegedy, Balazs
    JOURNAL OF GRAPH THEORY, 2018, 87 (02) : 208 - 229
  • [4] Interval graph mining
    Kemmar, Amina
    Lebbah, Yahia
    Loudni, Samir
    INTERNATIONAL JOURNAL OF DATA MINING MODELLING AND MANAGEMENT, 2018, 10 (01) : 1 - 22
  • [5] Hyperfinite graph limits
    Schramm, Oded
    ELECTRONIC RESEARCH ANNOUNCEMENTS IN MATHEMATICAL SCIENCES, 2008, 15 : 17 - 23
  • [6] ON MINIMAL AUGMENTATION OF A GRAPH TO OBTAIN AN INTERVAL GRAPH
    OHTSUKI, T
    MORI, H
    KASHIWABARA, T
    FUJISAWA, T
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1981, 22 (01) : 60 - 97
  • [7] Limits of interval orders and semiorders
    Janson, Svante
    JOURNAL OF COMBINATORICS, 2012, 3 (02) : 163 - 183
  • [8] Interval graph representation with given interval and intersection lengths
    Koebler, Johannes
    Kuhnert, Sebastian
    Watanabe, Osamu
    JOURNAL OF DISCRETE ALGORITHMS, 2015, 34 : 108 - 117
  • [9] Interval Graph Representation with Given Interval and Intersection Lengths
    Koebler, Johannes
    Kuhnert, Sebastian
    Watanabe, Osamu
    ALGORITHMS AND COMPUTATION, ISAAC 2012, 2012, 7676 : 517 - 526
  • [10] On the connectivity of a random interval graph
    Godehardt, E
    Jaworski, J
    RANDOM STRUCTURES & ALGORITHMS, 1996, 9 (1-2) : 137 - 161