All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

A Unified Approach to Structural Limits and Limits of Graphs with Bounded Tree-Depth

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F20%3A10422246" target="_blank" >RIV/00216208:11320/20:10422246 - isvavai.cz</a>

  • Result on the web

    <a href="https://verso.is.cuni.cz/pub/verso.fpl?fname=obd_publikace_handle&handle=Q~AWcwuUkW" target="_blank" >https://verso.is.cuni.cz/pub/verso.fpl?fname=obd_publikace_handle&handle=Q~AWcwuUkW</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1090/memo/1272" target="_blank" >10.1090/memo/1272</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    A Unified Approach to Structural Limits and Limits of Graphs with Bounded Tree-Depth

  • Original language description

    In this paper we introduce a general framework for the study of limits of relational structures and graphs in particular, which is based on a combination of model theory and (functional) analysis. We show how the various approaches to graph limits fit to this framework and that they naturally appear as &quot;tractable cases&quot; of a general theory. As an outcome of this, we provide extensions of known results. We believe that this puts these into a broader context. The second part of the paper is devoted to the study of sparse structures. First, we consider limits of structures with bounded diameter connected components and we prove that in this case the convergence can be &quot;almost&quot; studied component-wise. We also propose the structure of limit objects for convergent sequences of sparse structures. Eventually, we consider the specific case of limits of colored rooted trees with bounded height and of graphs with bounded tree-depth, motivated by their role as &quot;elementary bricks&quot; these graphs play in decompositions of sparse graphs, and give an explicit construction of a limit object in this case. This limit object is a graph built on a standard probability space with the property that every first-order definable set of tuples is measurable. This is an example of the general concept of modeling we introduce here. Our example is also the first &quot;intermediate class&quot; with explicitly defined limit structures where the inverse problem has been solved.

  • Czech name

  • Czech description

Classification

  • Type

    J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database

  • CEP classification

  • OECD FORD branch

    10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Result continuities

  • Project

  • Continuities

    I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Others

  • Publication year

    2020

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Name of the periodical

    Memoirs of the American Mathematical Society

  • ISSN

    0065-9266

  • e-ISSN

  • Volume of the periodical

    263

  • Issue of the periodical within the volume

    1272

  • Country of publishing house

    US - UNITED STATES

  • Number of pages

    109

  • Pages from-to

    1-109

  • UT code for WoS article

    000516766100001

  • EID of the result in the Scopus database

    2-s2.0-85080910455