Analytic representations of large graphs
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F19%3A00113689" target="_blank" >RIV/00216224:14330/19:00113689 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1017/9781108649094.003" target="_blank" >http://dx.doi.org/10.1017/9781108649094.003</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1017/9781108649094.003" target="_blank" >10.1017/9781108649094.003</a>
Alternative languages
Result language
angličtina
Original language name
Analytic representations of large graphs
Original language description
The recently emerged theory of graph limits provides analytic tools to represent and analyse large graphs, which appear in various scenarios in mathematics and computer science. We survey basic concepts concerning dense graph limits and then focus on recent results on finitely forcible graph limits. We conclude with presenting some of the existing notions concerning sparse graph limits and discussing their mutual relation.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
—
OECD FORD branch
10101 - Pure mathematics
Result continuities
Project
—
Continuities
R - Projekt Ramcoveho programu EK
Others
Publication year
2019
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
Article name in the collection
Surveys in Combinatorics 2019
ISBN
9781108649094
ISSN
—
e-ISSN
—
Number of pages
32
Pages from-to
57-88
Publisher name
Cambridge University Press
Place of publication
Cambridge
Event location
Birmingham
Event date
Jan 1, 2019
Type of event by nationality
CST - Celostátní akce
UT code for WoS article
000668435800002