Graph limits: An alternative approach to s-graphons
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985840%3A_____%2F22%3A00548748" target="_blank" >RIV/67985840:_____/22:00548748 - isvavai.cz</a>
Result on the web
<a href="https://doi.org/10.1002/jgt.22728" target="_blank" >https://doi.org/10.1002/jgt.22728</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1002/jgt.22728" target="_blank" >10.1002/jgt.22728</a>
Alternative languages
Result language
angličtina
Original language name
Graph limits: An alternative approach to s-graphons
Original language description
We show that s-convergence of graph sequences is equivalent to the convergence of certain compact sets, called shapes, of Borel probability measures. This result is analogous to the characterization of graphon convergence (with respect to the cut distance) by the convergence of envelopes, due to Doležal, Grebík, Hladký, Rocha, and Rozhoň.
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
10101 - Pure mathematics
Result continuities
Project
<a href="/en/project/GJ18-01472Y" target="_blank" >GJ18-01472Y: Graph limits and inhomogeneous random graphs</a><br>
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace
Others
Publication year
2022
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
Journal of Graph Theory
ISSN
0364-9024
e-ISSN
1097-0118
Volume of the periodical
99
Issue of the periodical within the volume
1
Country of publishing house
US - UNITED STATES
Number of pages
17
Pages from-to
90-106
UT code for WoS article
000681346900001
EID of the result in the Scopus database
2-s2.0-85111891325