2000 character limit reached
Limits of subcritical random graphs and random graphs with excluded minors (1512.03572v2)
Published 11 Dec 2015 in math.CO and math.PR
Abstract: We prove local convergence results for the uniformly random, labelled or unlabelled, graphs from subcritical families. As an example special case, we prove Benjamini-Schramm convergence for the uniform random unlabelled tree. We introduce a compactification of the space of countable (connected) rooted graphs, and use it to generalise the notion of Benjamini-Schramm convergence in order to allow for vertices of infinite degree in the limit object.
Collections
Sign up for free to add this paper to one or more collections.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.