Salvato in:
| Autori principali: | , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2016
|
| Soggetti: | |
| Accesso online: | https://arxiv.org/abs/1608.00146 |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866911589303582720 |
|---|---|
| author | Nesetril, J. de Mendez, P. Ossona |
| author_facet | Nesetril, J. de Mendez, P. Ossona |
| contents | A sequence of graphs is FO-convergent if the probability of satisfaction of every first-order formula converges. A graph modeling is a graph, whose domain is a standard probability space, with the property that every definable set is Borel. It was known that FO-convergent sequence of graphs do not always admit a modeling limit, and it was conjectured that this is the case if the graphs in the sequence are sufficiently sparse. Precisely, two conjectures were proposed:
* If a FO-convergent sequence of graphs is residual, that is if for every integer $d$ the maximum relative size of a ball of radius $d$ in the graphs of the sequence tends to zero, then the sequence has a modeling limit.
* A monotone class of graphs $\mathcal C$ has the property that every FO-convergent sequence of graphs from $\mathcal C$ has a modeling limit if and only if $\mathcal C$ is nowhere dense, that is if and only if for each integer $p$ there is $N(p)$ such that no graph in $\mathcal C$ contains the $p$th subdivision of a complete graph on $N(p)$ vertices as a subgraph. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_1608_00146 |
| institution | arXiv |
| publishDate | 2016 |
| record_format | arxiv |
| spellingShingle | Existence of Modeling Limits for Sequences of Sparse Structures Nesetril, J. de Mendez, P. Ossona Combinatorics A sequence of graphs is FO-convergent if the probability of satisfaction of every first-order formula converges. A graph modeling is a graph, whose domain is a standard probability space, with the property that every definable set is Borel. It was known that FO-convergent sequence of graphs do not always admit a modeling limit, and it was conjectured that this is the case if the graphs in the sequence are sufficiently sparse. Precisely, two conjectures were proposed: * If a FO-convergent sequence of graphs is residual, that is if for every integer $d$ the maximum relative size of a ball of radius $d$ in the graphs of the sequence tends to zero, then the sequence has a modeling limit. * A monotone class of graphs $\mathcal C$ has the property that every FO-convergent sequence of graphs from $\mathcal C$ has a modeling limit if and only if $\mathcal C$ is nowhere dense, that is if and only if for each integer $p$ there is $N(p)$ such that no graph in $\mathcal C$ contains the $p$th subdivision of a complete graph on $N(p)$ vertices as a subgraph. |
| title | Existence of Modeling Limits for Sequences of Sparse Structures |
| topic | Combinatorics |
| url | https://arxiv.org/abs/1608.00146 |