Charles Explorer logo
🇨🇿

On limits of sparse random graphs

Publikace na Matematicko-fyzikální fakulta |
2016

Tento text není v aktuálním jazyce dostupný. Zobrazuje se verze "en".Abstrakt

We present a notion of convergence for sequences of finite graphs {Gn} that can be seen as a generalization of the Benjamini-Schramm convergence notion for bounded degree graphs, regarding the distribution of r-neighbourhoods of the vertices, and the left-convergence notion for dense graphs, regarding, given any finite graph F, the limit of the probabilities that a random map from V(F) to V(Gn) is a graph homomorphism.