IDEAS home Printed from https://ideas.repec.org/a/spr/pardea/v6y2025i1d10.1007_s42985-025-00313-6.html
   My bibliography  Save this article

Vlasov equations on directed hypergraph measures

Author

Listed:
  • Christian Kuehn

    (Technical University of Munich
    Technical University of Munich)

  • Chuang Xu

    (University of Hawai’i at Mānoa)

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.

Suggested Citation

  • Christian Kuehn & Chuang Xu, 2025. "Vlasov equations on directed hypergraph measures," Partial Differential Equations and Applications, Springer, vol. 6(1), pages 1-49, March.
  • Handle: RePEc:spr:pardea:v:6:y:2025:i:1:d:10.1007_s42985-025-00313-6
    DOI: 10.1007/s42985-025-00313-6
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s42985-025-00313-6
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s42985-025-00313-6?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:pardea:v:6:y:2025:i:1:d:10.1007_s42985-025-00313-6. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.