Papers
Topics
Authors
Recent
Search
2000 character limit reached

Vlasov Equations on Directed Hypergraph Measures

Published 8 Jul 2022 in math.AP, math.CA, math.DS, math.FA, and math.PR | (2207.03806v3)

Abstract: In this paper we propose a framework to investigate the mean field limit (MFL) of interacting particle systems on directed hypergraphs. We provide a non-trivial measure-theoretic viewpoint and make extensions of directed hypergraphs as directed hypergraph measures (DHGMs), which are measure-valued functions on a compact metric space. These DHGMs can be regarded as hypergraph limits which include limits of a sequence of hypergraphs that are sparse, dense, or of intermediate densities. Our main results show that the Vlasov equation on DHGMs are well-posed and its solution can be approximated by empirical distributions of large networks of higher-order interactions. The results are applied to a Kuramoto network in physics, an epidemic network, and an ecological network, all of which include higher-order interactions. To prove the main results on the approximation and well-posedness of the Vlasov equation on DHGMs, we robustly generalize the method of [Kuehn, Xu. Vlasov equations on digraph measures, JDE, 339 (2022), 261--349] to higher-dimensions.

Authors (2)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.