Related papers: Vlasov equations on digraph measures

In this paper we introduce a general framework for the study of limits of relational structures in general and graphs in particular, which is based on a combination of model theory and (functional) analysis. We show how the various…

The Vlasov-Poisson system with massless electrons (VPME) is widely used in plasma physics to model the evolution of ions in a plasma. It differs from the Vlasov-Poisson system (VP) for electrons in that the Poisson coupling has an…

A mixed graph can be seen as a type of digraph containing some edges (two opposite arcs). Here we introduce the concept of sequence mixed graphs, which is a generalization of both sequence graphs and iterated line digraphs. These structures…

The Vlasov-Poisson systems of equations (VP) describes the evolution of a distribution of collisionless particles under the effect of a collective-field potential. VP is at the basis of the study of the gravitational instability of…

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…

We consider the asymptotics of the invariant measure for the process of the empirical spatial distribution of $N$ coupled Markov chains in the limit of a large number of chains. Each chain reflects the stochastic evolution of one particle.…

We develop a general deterministic distributed method for locally rounding fractional solutions of graph problems for which the analysis can be broken down into analyzing pairs of vertices. Roughly speaking, the method can transform…

We develop an algorithm to apply the Dalgarno-Lewis (DL) perturbation theory to quantum graphs with multiple, connected edges. We use it to calculate the nonlinear optical hyperpolarizability tensors for graphs and show that it replicates…

We introduce and study the pinnacle sets of a simple graph $G$ with $n$ vertices. Given a bijective vertex labeling $\lambda\,:\,V(G)\rightarrow [n]$, the label $\lambda(v)$ of vertex $v$ is a pinnacle of $(G, \lambda)$ if…

We study an extention of total variation denoising over images to over Cartesian power graphs and its applications to estimating non-parametric network models. The power graph fused lasso (PGFL) segments a matrix by exploiting a known…

Dense subgraph discovery is a fundamental problem in graph mining with a wide range of applications \cite{gionis2015dense}. Despite a large number of applications ranging from computational neuroscience to social network analysis, that take…

Consider a finite connected graph denoted as $G=(V, E)$. This study explores a generalized Chern-Simons Higgs model, characterized by the equation: $$ \Delta u = \lambda e^u (e^u - 1)^{2p+1} + f,$$ where $\Delta$ denotes the graph…

Implicit Graph Neural Networks (GNNs) have achieved significant success in addressing graph learning problems recently. However, poorly designed implicit GNN layers may have limited adaptability to learn graph metrics, experience…

We consider the problem of layering general directed graphs under height and possibly also width constraints. Given a directed graph G = (V,A) and a maximal height, we propose a layering approach that minimizes a weighted sum of the number…

We establish Gaussian limits for general measures induced by binomial and Poisson point processes in d-dimensional space. The limiting Gaussian field has a covariance functional which depends on the density of the point process. The general…

Generalization and approximation capabilities of message passing graph neural networks (MPNNs) are often studied by defining a compact metric on a space of input graphs under which MPNNs are H\"older continuous. Such analyses are of two…

Let $G$ be an $n$-vertex graph with adjacency matrix $A$, and $W=[e,Ae,\ldots,A^{n-1}e]$ be the walk matrix of $G$, where $e$ is the all-one vector. In Wang [J. Combin. Theory, Ser. B, 122 (2017): 438-451], the author showed that any graph…

There has been growing interest in studies of general random intersection graphs. In this paper, we consider a general random intersection graph $\mathbb{G}(n,\overrightarrow{a}, \overrightarrow{K_n},P_n)$ defined on a set $\mathcal{V}_n$…

A $(\phi,\epsilon)$-expander-decomposition of a graph $G$ (with $n$ vertices and $m$ edges) is a partition of $V$ into clusters $V_1,\ldots,V_k$ with conductance $\Phi(G[V_i]) \ge \phi$, such that there are $O(\epsilon m)$ inter-cluster…

Weight systems are functions on chord diagrams satisfying so-called Vassiliev's $4$-term relations. They are closely related to finite type knot invariants introduced by Vassiliev. Certain weight systems can be derived from graph…