Related papers: A Decomposition Theorem for Dynamic Flows
The deformation of a viscous liquid droplet suspended in another liquid and subject to an applied electric field is a classic multiphase flow problem best described by the Melcher-Taylor leaky dielectric model. The main assumption of the…
In Graph Theory a number of results were devoted to studying the computational complexity of the number modulo 2 of a graph's edge set decompositions of various kinds, first of all including its Hamiltonian decompositions, as well as the…
This work introduces NetDiff, an expressive graph denoising diffusion probabilistic architecture that generates wireless ad hoc network link topologies. Such networks, with directional antennas, can achieve unmatched performance when the…
In the finite element analysis with fast decoupled time integration scheme for viscoelastic fluid (the Leonov model) flow, we investigate strong nonlinear behavior in 2D creeping contraction flow. The algorithm is applicable in the whole…
Modular Decomposition focuses on repeatedly identifying a module M (a collection of vertices that shares exactly the same neighbourhood outside of M) and collapsing it into a single vertex. This notion of exactitude of neighbourhood is very…
The famous Erd\H{o}s-Gallai Theorem on the Tur\'an number of paths states that every graph with $n$ vertices and $m$ edges contains a path with at least $\frac{2m}{n}$ edges. In this note, we first establish a simple but novel extension of…
Reconstructing a network of dynamic systems from observational data is an active area of research. Many approaches guarantee a consistent reconstruction under the relatively strong assumption that the network dynamics is governed by…
Tibor Gallai conjectured that the edge set of every connected graph $G$ on $n$ vertices can be partitioned into $\lceil n/2\rceil$ paths. Let $\mathcal{G}_{k}$ be the class of all $2k$-regular graphs of girth at least $2k-2$ that admit a…
Symmetries are widespread in physical, technological, biological, and social systems and networks, including power grids. The swing equation is a classic model for the dynamics of powergrid networks. The main goal of this paper is to…
In this paper we consider generalized flow problems where there is an $m$-edge $n$-node directed graph $G = (V,E)$ and each edge $e \in E$ has a loss factor $\gamma_e >0$ governing whether the flow is increased or decreased as it crosses…
Let $M$ be a manifold equipped (locally) with a pair of complementary foliations. In Catuogno, da Silva and Ruffino (Stoch. Dyn. 2013), it is shown that, up to a stopping time $\tau$, a stochastic flow of local diffeomorphisms $\varphi_t$…
We introduce temporal flows on temporal networks, i.e., networks the links of which exist only at certain moments of time. Such networks are ephemeral in the sense that no link exists after some time. Our flow model is new and differs from…
Dynamic Mode Decomposition (DMD) is a data-driven and model-free decomposition technique. It is suitable for revealing spatio-temporal features of both numerically and experimentally acquired data. Conceptually, DMD performs a…
Graph Neural Networks (GNNs) have emerged as fundamental tools for a wide range of prediction tasks on graph-structured data. Recent studies have drawn analogies between GNN feature propagation and diffusion processes, which can be…
The congestion formation on a urban road network is one of the key issue for the development of a sustainable mobility in the future smart cities. In this work we propose a reductionist approach studying the stationary states of a simple…
A decomposition of the energy and helicity fluxes in a turbulent hydrodynamic flow is proposed. The decomposition is based on the projection of the flow to a helical basis that allows to investigate separately the role of interactions among…
In a recent paper, we showed that every sufficiently large regular digraph G on n vertices whose degree is linear in n and which is a robust outexpander has a decomposition into edge-disjoint Hamilton cycles. The main consequence of this…
An indecomposable flow $f$ on a signed graph $\Sigma$ is a nontrivial integral flow that cannot be decomposed into $f=f_1+f_2$, where $f_1,f_2$ are nontrivial integral flows having the same sign (both $\geq 0$ or both $\leq 0$) at each edge…
We show that the standard discrete update rule of transformer layers can be naturally interpreted as a forward Euler discretization of a continuous dynamical system. Our Transformer Flow Approximation Theorem demonstrates that, under…
We introduce a new approach to computing an approximately maximum s-t flow in a capacitated, undirected graph. This flow is computed by solving a sequence of electrical flow problems. Each electrical flow is given by the solution of a…