Related papers: Vlasov equations on digraph measures
Let $G$ be a large (simple, unlabeled) dense graph on $n$ vertices. Suppose that we only know, or can estimate, the empirical distribution of the number of subgraphs $F$ that each vertex in $G$ participates in, for some fixed small graph…
The paper treats the validity problem of the nonrelativistic Vlasov-Poisson equation in $d\geq 2$ dimensions. It is shown that the Vlasov-Poisson dynamics can be derived as a combined mean field and point-particle limit of an N-particle…
In this article, we study the large-population limit of interacting particle systems posed on weighted random graphs. In that aim, we introduce a general framework for the construction of weighted random graphs, generalizing the concept of…
Large $N$ matrix models play an important role in modern theoretical physics, ranging from quantum chromodynamics to string theory and holography. However, they remain a difficult technical challenge because in most cases it is not known…
Let \( D \) be a strongly connected digraph. The average distance of a vertex \( v \) in \( D \) is defined as the arithmetic mean of the distances from \( v \) to all other vertices in \( D \). The remoteness \( \rho(D) \) of \( D \) is…
A Collision-Avoiding flocking particle system proposed in [8] is studied in this paper. The global wellposedness of its corresponding Vlasov-type kinetic equation is proved. As a corollary of the global stability result, the mean field…
A generalization of the celebrated Falconer distance problem asks for a graph $G=(\mathcal{V},\mathcal{E})$, with vertex set $\mathcal{V}$ and edge set $\mathcal{E}$, how large the Hausdorff dimension of a compact set $E\subset…
We derive the exchange-driven growth (EDG) equations as the mean-field limit of interacting particle systems on the complete graph. Extending previous work, we consider symmetric exchange kernels $c(k, l) = c(l, k)$ satisfying super-linear…
This tutorial provides an overview of the generalized Lyapunov method (GLM) for analyzing input-to-state stability (ISS) of partial differential equations (PDEs). We begin by revisiting the classical Lyapunov method and the standard…
The cluster state acquired by evolving the nearest-neighbor (NN) Ising model from a completely separable state is the resource for measurement-based quantum computation. Instead of an NN system, a variable-range power law interacting Ising…
Large graphs commonly appear in social networks, knowledge graphs, recommender systems, life sciences, and decision making problems. Summarizing large graphs by their high level properties is helpful in solving problems in these settings.…
Finding dense subgraphs of a large network is a fundamental problem in graph mining that has been studied extensively both for its theoretical richness and its many practical applications over the last five decades. However, most existing…
We consider in this work the convergence of a split-step Euler type scheme (SSM) for the numerical simulation of interacting particle Stochastic Differential Equation (SDE) systems and McKean-Vlasov Stochastic Differential Equations…
Clustering in directed graphs remains a fundamental challenge due to the asymmetry in edge connectivity, which limits the applicability of classical spectral methods originally designed for undirected graphs. A common workaround is to…
After recalling the definition of Grassmann algebra and elements of Grassmann--Berezin calculus, we use the expression of Pfaffians as Grassmann integrals to generalize a series of formulas relating generating functions of paths in digraphs…
Fokker-Planck equations represent a suitable description of the finite-time behavior for a large class of particle systems as the size of the population tends to infinity. Recently, the theory of graph limits has been introduced in the…
We study parameter estimation for interacting particle systems (IPSs) consisting of $N$ weakly interacting multivariate hypoelliptic SDEs. We propose a locally Gaussian approximation of the transition dynamics, carefully designed to address…
In this paper, we first establish well-posedness results for one-dimensional McKean-Vlasov stochastic differential equations (SDEs) and related particle systems with a measure-dependent drift coefficient that is discontinuous in the spatial…
We consider undirected simple finite graphs. The sets of vertices and edges of a graph $G$ are denoted by $V(G)$ and $E(G)$, respectively. For a graph $G$, we denote by $\delta(G)$ and $\eta(G)$ the least degree of a vertex of $G$ and the…
The fused lasso, also known as (anisotropic) total variation denoising, is widely used for piecewise constant signal estimation with respect to a given undirected graph. The fused lasso estimate is highly nontrivial to compute when the…