On String Graph Limits and the Structure of a Typical String Graph

被引:4
|
作者
Janson, Svante [1 ]
Uzzell, Andrew J. [1 ]
机构
[1] Uppsala Univ, Dept Math, SE-75106 Uppsala, Sweden
关键词
hereditary property; graph limits; string graph; INTERSECTION GRAPHS; NUMBER; HEREDITARY; SEQUENCES;
D O I
10.1002/jgt.22031
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
We study limits of convergent sequences of string graphs, that is graphs with an intersection representation consisting of curves in the plane. We use these results to study the limiting behavior of a sequence of random string graphs. We also prove similar results for several related graph classes. (C) 2016 Wiley Periodicals, Inc.
引用
收藏
页码:386 / 407
页数:22
相关论文
共 50 条
  • [31] A Model of String System Deformations on a Star Graph with Nonlinear Condition at the Node
    Zvereva M.B.
    Journal of Mathematical Sciences, 2024, 283 (1) : 76 - 92
  • [32] The role of string in hybrid string structure
    Saitoh, M
    Okada, A
    ENGINEERING STRUCTURES, 1999, 21 (08) : 756 - 769
  • [33] Role of string in hybrid string structure
    Saitoh, Masao
    Okada, Akira
    Engineering Structures, 21 (08): : 756 - 769
  • [34] Graph properties, graph limits, and entropy
    Hatami, Hamed
    Janson, Svante
    Szegedy, Balazs
    JOURNAL OF GRAPH THEORY, 2018, 87 (02) : 208 - 229
  • [35] On semiclassical limits of string states
    Blanco-Pillado, Jose J.
    Iglesias, Alberto
    Siegel, Warren
    PHYSICS LETTERS B, 2007, 655 (5-6) : 284 - 289
  • [36] Synonymy Extraction From Semantic Networks Using String and Graph Kernel Methods
    vor der Brueck, Tim
    Wang, Yu-Fang Helena
    20TH EUROPEAN CONFERENCE ON ARTIFICIAL INTELLIGENCE (ECAI 2012), 2012, 242 : 822 - +
  • [37] Readjoiner: a fast and memory efficient string graph-based sequence assembler
    Giorgio Gonnella
    Stefan Kurtz
    BMC Bioinformatics, 13
  • [38] Readjoiner: a fast and memory efficient string graph-based sequence assembler
    Gonnella, Giorgio
    Kurtz, Stefan
    BMC BIOINFORMATICS, 2012, 13
  • [39] Diamond Subgraphs in the Reduction Graph of a One-Rule String Rewriting System
    Adinayev, Arthur
    Stein, Itamar
    FUNDAMENTA INFORMATICAE, 2021, 178 (03) : 173 - 185
  • [40] Parallel String Graph Construction and Transitive Reduction for De Novo Genome Assembly
    Guidi, Giulia
    Selvitopi, Oguz
    Ellis, Marquita
    Oliker, Leonid
    Yelick, Katherine
    Buluc, Aydm
    2021 IEEE 35TH INTERNATIONAL PARALLEL AND DISTRIBUTED PROCESSING SYMPOSIUM (IPDPS), 2021, : 517 - 526