Hydrodynamic Limits of non-Markovian Interacting Particle Systems on Sparse Graphs
Ankan Ganguly, Kavita Ramanan

TL;DR
This paper establishes hydrodynamic limits for non-Markovian interacting particle systems on sparse graphs, showing convergence of empirical measures and dynamics under local graph convergence and dissociability conditions.
Contribution
It introduces new techniques for analyzing jump processes on sparse graphs and proves well-posedness and convergence results for these systems.
Findings
Empirical measures of particle trajectories converge to the limit dynamics.
Well-posedness holds on finitely dissociable graphs, including bounded degree and certain Galton-Watson trees.
Dynamics exhibit asymptotic correlation decay.
Abstract
Consider an interacting particle system indexed by the vertices of a (possibly random) locally finite graph whose vertices and edges are equipped with marks representing parameters of the model such as the environment and initial conditions. Each particle takes values in a countable state space and evolves according to a pure jump process whose jump intensities depend on only the states (or histories) and marks of itself and particles and edges in its neighborhood. Under mild conditions, it is shown that if the sequence of (marked) interaction graphs converges locally in probability to a limit (marked) graph that satisfies a certain finite dissociability property, then the corresponding sequence of empirical measures of the particle trajectories converges weakly to the law of the marginal dynamics at the root vertex of the limit graph. The proof of this limit relies on several results…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsStochastic processes and statistical mechanics · Cellular Automata and Applications · Random Matrices and Applications
