Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
134 tokens/sec
GPT-4o
9 tokens/sec
Gemini 2.5 Pro Pro
47 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Thermodynamic Limit of Interacting Particle Systems over Time-varying Sparse Random Networks (1702.08447v1)

Published 26 Feb 2017 in math.PR, math-ph, and math.MP

Abstract: We establish a functional weak law of large numbers for observable macroscopic state variables of interacting particle systems (e.g., voter and contact processes) over fast time-varying sparse random networks of interactions. We show that, as the number of agents $N$ grows large, the proportion of agents $\left(\overline{Y}{k}{N}(t)\right)$ at a certain state $k$ converges in distribution -- or, more precisely, weakly with respect to the uniform topology on the space of \emph{c`adl`ag} sample paths -- to the solution of an ordinary differential equation over any compact interval $\left[0,T\right]$. Although the limiting process is Markov, the prelimit processes, i.e., the normalized macrostate vector processes $\left(\mathbf{\overline{Y}}{N}(t)\right)=\left(\overline{Y}{1}{N}(t),\ldots,\overline{Y}_{K}{N}(t)\right)$, are non-Markov as they are tied to the \emph{high-dimensional} microscopic state of the system, which precludes the direct application of standard arguments for establishing weak convergence. The techniques developed in the paper for establishing weak convergence might be of independent interest.

Summary

We haven't generated a summary for this paper yet.