arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2007.13899math.PRmath.DS

The large deviation principle for interacting dynamical systems on random graphs

Paul Dupuis, Georgi Medvedev

英文摘要:

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{\' 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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑