Related papers: A Decomposition Theorem for Dynamic Flows
In this paper we show that the chain recurrent set of a flow of automorphisms on a connected Lie group coincides with the central subgroup of the flow, if the group is decomposable. Moreover, in the decomposable case, the flow satisfies the…
There has been much research on network flows over time due to their important role in real world applications. This has led to many results, but the more challenging continuous time model still lacks some of the key concepts and techniques…
A graph $G$ contains another graph $H$ as an immersion if $H$ can be obtained from a subgraph of $G$ by splitting off edges and removing isolated vertices. There is an obvious necessary degree condition for the immersion containment: if $G$…
To develop a dislocation-based statistical continuum theory of crystal plasticity is a major challenge of materials science.During the last two decades such a theory has been developed for the time evolution of a system of parallel edge…
We present a new flow framework for separation logic reasoning about programs that manipulate general graphs. The framework overcomes problems in earlier developments: it is based on standard fixed point theory, guarantees least flows,…
The question of whether there is a logic that captures polynomial time is one of the main open problems in descriptive complexity theory and database theory. In 2010 Grohe showed that fixed point logic with counting captures polynomial time…
In this paper, we investigate the embeddings for topological flows. We prove an embedding theorem for discrete topological system. Our results apply to suspension flows via constant function, and for this case we show an embedding theorem…
How can we understand gradient-based training over non-convex landscapes? The edge of stability phenomenon, introduced in Cohen et al. (2021), indicates that the answer is not so simple: namely, gradient descent (GD) with large step sizes…
Stable flows generalize the well-known concept of stable matchings to markets in which transactions may involve several agents, forwarding flow from one to another. An instance of the problem consists of a capacitated directed network, in…
Eigenvectors of the Laplacian of a cycle graph exhibit the sinusoidal characteristics of the standard DFT basis, and signals defined on such graphs are amenable to linear shift invariant (LSI) operations. In this paper we propose to reduce…
The problem of decomposing networks into modules (or clusters) has gained much attention in recent years, as it can account for a coarse-grained description of complex systems, often revealing functional subunits of these systems. A variety…
We present practical linear and almost linear-time algorithms to compute a chain decomposition of a directed acyclic graph (DAG), $G=(V,E)$. The number of vertex-disjoint chains computed is very close to the minimum. The time complexity of…
This paper presents the foundation for a decomposition theory for Boolean networks, a type of discrete dynamical system that has found a wide range of applications in the life sciences, engineering, and physics. Given a Boolean network…
Graph-limit theory focuses on the convergence of sequences of graphs when the number of nodes becomes arbitrarily large. This framework defines a continuous version of graphs allowing for the study of dynamical systems on very large graphs,…
Despite the unsettled mechanism of electricity generation from the continuous flow of liquids on a surface, the charge-discharge theory has been widely accepted for alternating current (AC) generation from a moving droplet. It has been…
A network $\mathcal{N}$ is formed by a (multi)digraph $D$ together with a \emph{capacity function} $u : A(D) \to R_+$, and it is denoted by $\mathcal{N} = (D,u)$. A flow on $\mathcal{N}$ is a function $x: A(D) \to R_+$ such that $x(a) \leq…
We generalise a fundamental graph-theoretical fact, stating that every element of the cycle space of a graph is a sum of edge-disjoint cycles, to arbitrary continua. To achieve this we replace graph cycles by topological circles, and…
Arclength continuation and branch switching are enormously successful algorithms for the computation of bifurcation diagrams. Nevertheless, their combination suffers from three significant disadvantages. The first is that they attempt to…
We study the continuous-time structure of the difference-of-convex algorithm (DCA) for smooth DC decompositions with a strongly convex component. In dual coordinates, classical DCA is exactly the full-step explicit Euler discretization of a…
Modal decompositions such as proper orthogonal decomposition (POD), dynamic mode decomposition (DMD) and their variants are regularly used to educe physical mechanisms of nonlinear flow phenomena that cannot be easily understood through…