相关论文: Vlasov Equations on Directed Hypergraph Measures
Collective behaviors that emerge from interactions are fundamental to numerous biological systems. To learn such interacting forces from observations, we introduce a measure-valued neural network that infers measure-dependent interaction…
The Vlasov-Poisson system for ions is a kinetic equation for dilute, unmagnetised plasma. It describes the evolution of the ions in a plasma under the assumption that the electrons are thermalized. Consequently, the Poisson coupling for the…
We study a non-exchangeable multi-agent system and rigorously derive a strong form of the mean-field limit. The convergence of the connection weights and the initial data implies convergence of large-scale dynamics toward a deterministic…
We provide error bounds for the N-intertwined mean-field approximation (NIMFA) for local density-dependent Markov population processes with a well-distributed underlying network structure showing NIMFA being accurate when a typical vertex…
We show that, in the continuum limit, the dynamics of Hamiltonian systems defined on a lattice with long-range couplings is well described by the Vlasov equation. This equation can be linearized around the homogeneous state and a dispersion…
We consider a class of particle systems described by differential equations (both stochastic and deterministic), in which the interaction network is determined by the realization of an Erd\H{o}s-R\'enyi graph with parameter $p_n\in (0, 1]$,…
We consider the Maxwell-Schr\"odinger equations in the Coulomb gauge describing the interaction of extended fermions with their self-generated electromagnetic field. They heuristically emerge as mean-field equations from non-relativistic…
Dynamical Mean-Field Theory (DMFT) has established itself as a reliable and well-controlled approximation to study correlation effects in bulk solids and also two-dimensional systems. In combination with standard density-functional theory…
We present a probabilistic proof of the mean-field limit and propagation of chaos of a classical N-particle system in two dimensions with Coulomb interaction force of the form $f^N(q)=\pm\frac{q}{|q|^2}$ and $N$-dependent cut-off at…
We generalize the dynamical-mean field (DMFT) approximation by including into the DMFT equations some length scale via a momentum dependent ``external'' self-energy S(k). This external self-energy describes non-local dynamical correlations…
Hypergraphs that can depict interactions beyond pairwise edges have emerged as an appropriate representation for modeling polyadic relations in complex systems. With the recent surge of interest in researching hypergraphs, the centrality…
Interactions and relations between objects may be pairwise or higher-order in nature, and so network-valued data are ubiquitous in the real world. The "space of networks", however, has a complex structure that cannot be adequately described…
Electronic correlated systems are often well described by dynamical mean field theory (DMFT). While DMFT studies have mainly focused hitherto on one-particle properties, valuable information is also enclosed into local two-particle Green's…
Many real-world phenomena can be modelled as dynamical processes on networks, a prominent example being the spread of infectious diseases such as COVID-19. Mean-field approximations are a widely used tool to analyse such dynamical processes…
Aims. The main goal of this paper is to derive observational constraints on the halo mass fuction (HMF) by performing a tomographic analysis of the magnification bias signal on a sample of background submillimeter galaxies. The results can…
We consider a system of $N$ particles whose interactions are characterized by a (weighted) graph $G^N$. Each particle is a node of the graph with an internal state. The state changes according to Markovian dynamics that depend on the states…
The Kuramoto model with higher-order interactions has recently been shown to exhibit bistability, explosive synchronization transitions, and rich collective dynamics. Existing analytical approaches, however, typically rely on all-to-all…
The densest subgraph problem (DSG) aiming at finding an induced subgraph such that the average edge-weights of the subgraph is maximized, is a well-studied problem. However, when the input graph is a hypergraph, the existing notion of DSG…
Many real-world interactions are group-based rather than pairwise such as papers with multiple co-authors and users jointly engaging with items. Hypergraph neural networks have shown great promise at modeling higher-order relations, but…
Modern machine learning models are typically trained via multi-pass stochastic gradient descent (SGD) with small batch sizes, and understanding their dynamics in high dimensions is of great interest. However, an analytical framework for…