TY  - BOOK
AU  - Lovász, László
TI  - Large networks and graph limits
T3  - American Mathematical Society colloquium publications ; 60.
PB  - American Mathematical Society (AMS)
CY  - Providence (RI)
PY  - 2012
SN  - 0821890859
UR  - https://m2.mtmt.hu/api/publication/2588739
ID  - 2588739
LA  - English
DB  - MTMT
ER  - 

TY  - JOUR
AU  - Lovász, László
AU  - Szegedy, Balázs
TI  - Limits of Dense Graph Sequences
JF  - JOURNAL OF COMBINATORIAL THEORY SERIES B
J2  - J COMB THEORY B
VL  - 96
PY  - 2006
IS  - 6
SP  - 933
EP  - 957
PG  - 25
SN  - 0095-8956
DO  - 10.1016/j.jctb.2006.05.002
UR  - https://m2.mtmt.hu/api/publication/1086784
ID  - 1086784
AB  - We show that if a sequence of dense graphs G, has the property that for every fixed graph F, the density of copies of F in G, tends to a limit, then there is a natural "limit object," namely a symmetric measurable function W: [0, 1](2) ->. [0, 1]. This limit object determines all the limits of subgraph densities. Conversely, every such function arises as a limit object. We also characterize graph parameters that are obtained as limits of subgraph densities by the "reflection positivity" property. Along the way we introduce a rather general model of random graphs, which seems to be interesting on its own right. (c) 2006 Elsevier Inc. All rights reserved.
LA  - English
DB  - MTMT
ER  -