Journal article
The Large Deviation Principle for Interacting Dynamical Systems on Random Graphs
Communications in mathematical physics, v 390(2), pp 545-575
2022
Featured in Collection : UN Sustainable Development Goals @ Drexel
Abstract
Using the weak convergence approach to large deviations, we formulate and prove the large deviation principle (LDP) for W-random graphs in the cut-norm topology. This generalizes the LDP for Erdős–Rényi random graphs by Chatterjee and Varadhan. Furthermore, we translate the LDP for random graphs to a class of interacting dynamical systems on such graphs. To this end, we demonstrate that the solutions of the dynamical models depend continuously on the underlying graphs with respect to the cut-norm and apply the contraction principle.
Metrics
Details
- Title
- The Large Deviation Principle for Interacting Dynamical Systems on Random Graphs
- Creators
- Paul Dupuis - Brown UniversityGeorgi S. Medvedev - Drexel University
- Publication Details
- Communications in mathematical physics, v 390(2), pp 545-575
- Publisher
- Springer Berlin Heidelberg
- Grant note
- 1904992; 2009233 / National Science Foundation (http://dx.doi.org/10.13039/100000001)
- Resource Type
- Journal article
- Language
- English
- Academic Unit
- Mathematics
- Web of Science ID
- WOS:000752189100001
- Scopus ID
- 2-s2.0-85124255239
- Other Identifier
- 991019170499604721
UN Sustainable Development Goals (SDGs)
This publication has contributed to the advancement of the following goals:
Source: SDGs in the Output
InCites Highlights
Data related to this publication, from InCites Benchmarking & Analytics tool:
- Collaboration types
- Domestic collaboration
- Web of Science research areas
- Physics, Mathematical