Marked random graphs with given degree sequence: large deviations on the local topology

Abstract

We investigate the behavior of the empirical neighborhood distribution of marked graphs in the framework of local weak convergence. Here we extend known results by considering uniform random graphs with given degree sequences and i.i.d. marks on half-edges and vertices. We establish a large deviation principle for such families of empirical measures. The proof builds on Bordenave and Caputo's seminal 2015 paper, and Delgosha and Anantharam's 2019 introduction of BC entropy, relying on combinatorial lemmas that allow one to construct suitable approximations of measures supported on marked trees. Possible applications of these results are in the study of interacting diffusions on top of random graphs.

23 pages. Manuscript matching published version

References in corpus (8)

• Random graphs with a given degree sequence
• Large deviations of empirical neighborhood distribution in sparse random graphs
• A note on dynamical models on random graphs and Fokker-Planck equations
• Interacting diffusions on random graphs with diverging degrees: hydrodynamics and large deviations
• A large-deviations principle for all the cluster sizes of a sparse Erdős-Rényi graph
• The large deviation principle for inhomogeneous Erdős-Rényi random graphs
• A large-deviations principle for all the components in a sparse inhomogeneous random graph
• Large deviations for interacting diffusions with path-dependent McKean-Vlasov limit