The large deviation principle for interacting dynamical systems on random graphs

DOI10.1007/S00220-022-04312-1zbMATH Open1484.60029OpenAlexW3046196160MaRDI QIDQ2113491FDOQ2113491

Authors: Paul Dupuis, Georgi S. Medvedev 

Publication date: 14 March 2022

Published in: Communications in Mathematical Physics (Search for Journal in Brave)

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 ErdH{o}s-R{' e}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.

Full work available at URL: https://arxiv.org/abs/2007.13899

Recommendations

• A sample-path large deviation principle for dynamic Erdős-Rényi random graphs
• A law of large numbers and large deviations for interacting diffusions on Erdős-Rényi graphs
• The large deviation principle for inhomogeneous Erdős-Rényi random graphs
• scientific article; zbMATH DE number 1191595
• Large deviation principles for empirical measures of colored random graphs

zbMATH Keywords

random graphlarge deviationinteracting particle system

Mathematics Subject Classification ID

Large deviations (60F10) Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• A law of large numbers and large deviations for interacting diffusions on Erdős-Rényi graphs
• A review of the mean field limits for Vlasov equations
• An \(L^p\) theory of sparse graph convergence. I: Limits, sparse random graph models, and power law distributions
• An introduction to large deviations for random graphs
• Analysis and approximation of rare events. Representations and weak convergence methods
• Chemical oscillations, waves, and turbulence
• Community detection in sparse networks via Grothendieck's inequality
• Interacting diffusions on random graphs with diverging average degrees: hydrodynamics and large deviations
• Large deviations for random graphs. École d'Été de Probabilités de Saint-Flour XLV -- 2015
• Large networks and graph limits
• Limits of dense graph sequences
• Nonlinear large deviations
• Szemerédi's lemma for the analyst
• The Vlasov dynamics and its fluctuations in the \(1/N\) limit of interacting classical particles
• The continuum limit of the Kuramoto model on sparse random graphs
• The large deviation principle for the Erdős-Rényi random graph
• The nonlinear heat equation on \(W\)-random graphs
• The nonlinear heat equation on dense graphs and graph limits

Cited In (8)

• Graphon mean field systems
• A sample-path large deviation principle for dynamic Erdős-Rényi random graphs
• Central limit theorems for global and local empirical measures of diffusions on Erdős-Rényi graphs
• Stationarity and uniform in time convergence for the graphon particle system
• Large deviations for mean field model in Erdős-Rényi graph
• Mean-field and graph limits for collective dynamics models with time-varying weights
• Macroscopic determinism in interacting systems using large deviation theory
• Graphon particle system: uniform-in-time concentration bounds

This page was built for publication: The large deviation principle for interacting dynamical systems on random graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2113491)