相关论文: Vlasov equations on digraph measures
In the Directed Disjoint Paths problem, we are given a digraph $D$ and a set of requests $\{(s_1, t_1), \ldots, (s_k, t_k)\}$, and the task is to find a collection of pairwise vertex-disjoint paths $\{P_1, \ldots, P_k\}$ such that each…
The node-averaged complexity of a distributed algorithm running on a graph $G=(V,E)$ is the average over the times at which the nodes $V$ of $G$ finish their computation and commit to their outputs. We study the node-averaged complexity for…
Stochastic partial differential equations (SPDE) on graphs were introduced by Cerrai and Freidlin [Ann. Inst. Henri Poincar\'e Probab. Stat. 53 (2017) 865-899]. This class of stochastic equations in infinite dimensions provides a minimal…
We consider a one-dimensional McKean-Vlasov SDE on a domain and the associated mean-field interacting particle system. The peculiarity of this system is the combination of the interaction, which keeps the average position prescribed, and…
Time-continuous dynamical systems defined on graphs are often used to model complex systems with many interacting components in a non-spatial context. In the reverse sense attaching meaningful dynamics to given 'interaction diagrams' is a…
Friedrichs' systems (FS) are symmetric positive linear systems of first-order partial differential equations (PDEs), which provide a unified framework for describing various elliptic, parabolic and hyperbolic semi-linear PDEs such as the…
We study the undirected divisibility graph in which the vertex set is a finite subset of consecutive natural numbers up to N.We derive analytical expressions for measures of the graph like degree, clustering, geodesic distance and…
A multi-scale meshfree particle method for macroscopic mean field approximations of generalized interacting particle models is developed and investigated. The method is working in a uniform way for large and small interaction radii. The…
The Inozemtsev limit (IL) or the scaling limit is known to be a procedure applied to the elliptic Calogero Model. It is a combination of the trigonometric limit, infinite shifts of particles coordinates and rescalings of the coupling…
We analyse a reduced 1D Vlasov--Maxwell system introduced recently in the physical literature for studying laser-plasma interaction. This system can be seen as a standard Vlasov equation in which the field is split in two terms: an…
In this article, we study an interacting particle system in the context of epidemiology where the individuals (particles) are characterized by their position and infection state. We begin with a description at the microscopic level where…
A digraph consisting of a set of vertices $V$ and a set of arcs $E$ is called an interval digraph if there exists a family of closed intervals $\{I_u,J_u\}_{u \in V}$ such that $uv$ is an arc if and only if the intersection of $I_u$ and…
We consider the problem of solving partial differential equations (PDEs) in domains with complex microparticle geometry that is impractical, or intractable, to model explicitly. Drawing inspiration from volume rendering, we propose tackling…
We consider interacting particle dynamics with Vicsek type interactions, and their macroscopic PDE limit, in the non-mean-field regime; that is, we consider the case in which each particle/agent in the system interacts only with a…
In this paper a rigorous proof of the mean field limit for a pedestrian flow model in two dimensions is given by using a probabilistic method. The model under investigation is an interacting particle system coupled to the eikonal equation…
We present a GPU parallel implementation of the numeric integration of the Vlasov equation in one spatial dimension based on a second order time-split algorithm with a local modified cubic-spline interpolation. We apply our approach to…
We explore the conditions on a pair interaction for the validity of the Vlasov equation to describe the dynamics of an interacting $N$ particle system in the large $N$ limit. Using a coarse-graining in phase space of the exact Klimontovich…
Finite digraphs $R$ and $S$ are studied with $\# {\cal H}(G,R) \leq \# {\cal H}(G,S)$ for every finite digraph $G \in \mathfrak{ D }'$, where ${\cal H}(G,H)$ is the set of order homomorphisms from $G$ to $H$ and $\mathfrak{ D }'$ is a class…
A diffusion taking value in probability measures on a graph with a vertex set $V$, $\sum_{i\in V}x_i\delta_i$, is studied. The masses on each vertices satisfy the stochastic differential equation of the form $dx_i=\sum_{j\in…
The vertex-random graphs called proximity catch digraphs (PCDs) have been introduced recently and have applications in pattern recognition and spatial pattern analysis. A PCD is a random directed graph (i.e., digraph) which is constructed…