arXiv Analytics

Sign in

arXiv:1708.01832 [math.PR]AbstractReferencesReviewsResources

Large Deviation Principle for the Exploration Process of the Configuration Model

Shankar Bhamidi, Amarjit Budhiraja, Paul Dupuis, Ruoyu Wu

Published 2017-08-06Version 1

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.

Related articles: Most relevant | Search more
arXiv:1912.04714 [math.PR] (Published 2019-12-09)
Rare event asymptotics for exploration processes for random graphs
arXiv:1611.05728 [math.PR] (Published 2016-11-17)
Component structure of the configuration model: barely supercritical case
arXiv:2001.05905 [math.PR] (Published 2020-01-16)
Almost-2-regular random graphs