Table of Contents
Fetching ...

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

Rangel Baldasso, Alan Pereira, Guilherme Reis

Abstract

We investigate the behavior of the empirical neighbourhood distribution of marked graphs in the framework of local weak convergence. 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.

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

Abstract

We investigate the behavior of the empirical neighbourhood distribution of marked graphs in the framework of local weak convergence. 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.
Paper Structure (13 sections, 12 theorems, 69 equations)

This paper contains 13 sections, 12 theorems, 69 equations.

Key Result

Theorem 1.1

Consider the sequence of marked graphs $\bar{G}_n$ as above. The sequence of empirical neighborhood measures $U(\bar{G}_n)$ satisfies a large deviation principle with rate function presented in Theorem theorem:main.

Theorems & Definitions (25)

  • Theorem 1.1
  • Lemma 2.1
  • proof
  • Definition 2.2: Local weak convergence
  • Proposition 2.3
  • Remark 2.4
  • Definition 2.5
  • Theorem 2.6: da, Theorem 2
  • Remark 3.1
  • Theorem 3.2
  • ...and 15 more