Alexander Pluska

On Local Limits of Sparse Random Graphs: Color Convergence and the Refined Configuration Model

Local convergence has emerged as a fundamental tool for analyzing sparse random graph models. We introduce a new notion of local convergence, _color convergence_, based on the Weisfeiler–Leman algorithm. Color convergence fully characterizes the class of random graphs that are well-behaved in the li…