关于图上时间一致平均场极限的一个注记
A note on uniform in time mean-field limit in graphs
AI总结:
本文针对随机图上非可交换粒子系统,利用反射耦合方法在Lipschitz连续、单边Lipschitz恢复力和图足够稠密条件下证明了时间一致的混沌传播与平均场极限,并给出显式依赖于图结构的界。
摘要:
本文以简明的方式证明了在随机图上相互作用的非可交换粒子系统的时间一致混沌传播结果。在相互作用满足Lipschitz连续、恢复力满足一般单边Lipschitz条件(从而允许非凸约束势)且图足够稠密的条件下,我们采用Eberle提出的称为反射耦合的耦合方法,获得了时间一致的平均场极限,其界显式依赖于图的结构。
英文摘要:
In this article we show, in a concise manner, a result of uniform in time propagation of chaos for non exchangeable systems of particles interacting according to a random graph. Provided the interaction is Lipschitz continuous, the restoring force satisfies a general one-sided Lipschitz condition (thus allowing for non-convex confining potential) and the graph is dense enough, we use a coupling method suggested by Eberle known as reflection coupling to obtain uniform in time mean-field limit with bounds that depend explicitly on the graph structure.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。