Interacting Diffusions on Random Graphs with Diverging Average Degrees: Hydrodynamics and Large Deviations

arXiv: Probability(2019)

引用 17|浏览6
暂无评分
摘要
We consider systems of mean-field interacting diffusions, where the pairwise interaction structure is described by a sparse (and potentially inhomogeneous) random graph. Examples include the stochastic Kuramoto model with pairwise interactions given by an Erdős–Rényi graph. Our problem is to compare the bulk behavior of such systems with that of corresponding systems with dense nonrandom interactions. For a broad class of interaction functions, we find the optimal sparsity condition that implies that the two systems have the same hydrodynamic limit, which is given by a McKean–Vlasov diffusion. Moreover, we also prove matching behavior of the two systems at the level of large deviations. Our results extend classical results of dai Pra and den Hollander and provide the first examples of LDPs for systems with sparse random interactions.
更多
查看译文
关键词
McKean–Vlasov equations,Mean-field models,Random graphs,Large deviations
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要