An undecidability result on limits of sparse graphs
Abstract
Given a set B of finite rooted graphs and a radius r as an input, we prove that it is undecidable to determine whether there exists a sequence (Gi) of finite bounded degree graphs such that the rooted r-radius neighbourhood of a random node of Gi is isomorphic to a rooted graph in B with probability tending to 1. Our proof implies a similar result for the case where the sequence (Gi) is replaced by a unimodular random graph.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.