Large Deviation Principle for the Exploration Process of the Configuration Model
Abstract
The configuration model is a sequence of random graphs constructed such that in the large network limit the degree distribution converges to a pre-specified probability distribution. The component structure of such random graphs can be obtained from an infinite dimensional Markov chain referred to as the exploration process. We establish a large deviation principle for the exploration process associated with the configuration model. Proofs rely on a representation of the exploration process as a system of stochastic differential equations driven by Poisson random measures and variational formulas for moments of nonnegative functionals of Poisson random measures. Uniqueness results for certain controlled systems of deterministic equations play a key role in the analysis. Applications of the large deviation results, for studying asymptotic behavior of the degree sequence in large components of the random graphs, are discussed.
Cite
@article{arxiv.1708.01832,
title = {Large Deviation Principle for the Exploration Process of the Configuration Model},
author = {Shankar Bhamidi and Amarjit Budhiraja and Paul Dupuis and Ruoyu Wu},
journal= {arXiv preprint arXiv:1708.01832},
year = {2019}
}
Comments
36 pages; this submission has now been replaced with new url arXiv:1912.04714 with new results