Interval graph limits (Q1950423): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(14 intermediate revisions by 8 users not shown)
Property / instance of
 
Property / instance of: scholarly article / rank
Normal rank
 
Property / author
 
Property / author: Persi Diaconis / rank
Normal rank
 
Property / author
 
Property / author: Susan P. Holmes / rank
Normal rank
 
Property / author
 
Property / author: Svante Janson / rank
Normal rank
 
Property / published in
 
Property / published in: Annals of Combinatorics / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Nicko G. Gamkrelidze / rank
Normal rank
 
Property / instance of
 
Property / instance of: scholarly article / rank
 
Normal rank
Property / author
 
Property / author: Persi Diaconis / rank
 
Normal rank
Property / author
 
Property / author: Susan P. Holmes / rank
 
Normal rank
Property / author
 
Property / author: Svante Janson / rank
 
Normal rank
Property / published in
 
Property / published in: Annals of Combinatorics / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: Nicko G. Gamkrelidze / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q40503072 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1102.2841 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2007695797 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On exchangeable random variables and the statistics of large graphs and hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5560061 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Metrics for sparse graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Moments of two-variable functions and the uniqueness of graph limits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Classes: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Statistical problems involving permutations with restricted positions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Threshold Graph Limits and Random Threshold Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph limits and exchangeable random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonparametric Methods for Doubly Truncated Data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interval graphs and interval orders / rank
 
Normal rank
Property / cites work
 
Property / cites work: Barcodes: The persistent topology of data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic graph theory and perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of DNA physical mapping / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sorting using complete subintervals and the maximum number of runs in a randomly evolving sequence / rank
 
Normal rank
Property / cites work
 
Property / cites work: The largest component in a subcritical random graph with a power law degree distribution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Poset limits and exchangeable random posets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphons, cut norm and distance, couplings and rearrangements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random Intervals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2774021 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic Symmetries and Invariance Principles / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Random Intersection Graphs: The Subgraph Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mapping the genome / rank
 
Normal rank
Property / cites work
 
Property / cites work: Limits of dense graph sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regularity partitions and the topology of graphons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topics in Intersection Graph Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Threshold graphs and related topics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5533878 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On rectangle intersection and overlap graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An evolution of interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The vertex degree distribution of random intersection graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random time changes for sock-sorting and other stochastic process limit theorems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interval graphs and maps of DNA / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:05, 6 July 2024

scientific article
Language Label Description Also known as
English
Interval graph limits
scientific article

    Statements

    Interval graph limits (English)
    0 references
    13 May 2013
    0 references
    The authors investigate a graph limit theory for dense interval graphs. This theory developed departs from 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, they fix a \(W\) and change underlying distribution of the coordinates \(x\) and \(y\). The main theorem is stated that a sequence of graphs \(G_n\) converges if the empirical measures \(\mu_n\) converge to a limiting probability \(\mu\) in the usual weak star topology, provided \(\mu\) satisfies a technical condition. They also show a continuity result for chromatic number and clique number of interval graphs. Some results on uniqueness of the limit description are given for general graph limits.
    0 references
    interval graphs
    0 references
    graph limits
    0 references
    intersection graphs
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references