Pith. sign in

REVIEW

Vlasov Equations on Directed Hypergraph Measures

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2207.03806 v3 pith:64GAXKZJ submitted 2022-07-08 math.AP math.CAmath.DSmath.FAmath.PR

classification math.APmath.CAmath.DSmath.FAmath.PR
keywords dhgmsdirectedvlasovhypergraphhypergraphsmeasuresnetworkresults
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original 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.

Discussion (0). Continue with ORCID to comment.

Pith tools