Related papers: Flows revisited: the model category structure and …
We construct a stable infinity category with objects flow categories and morphisms flow bimodules; our construction has many flavors, related to a choice of bordism theory, and we discuss in particular framed bordism and the bordism theory…
We prove that the category of flows cannot be the underlying category of a model category whose corresponding homotopy types are the flows up to weak dihomotopy. Some hints are given to overcome this problem. In particular, a new approach…
The performance of flow matching and diffusion models can be greatly improved at inference time using reward alignment algorithms, yet efficiency remains a major limitation. While several algorithms were proposed, we demonstrate that a…
We show that the classifying space of the flow category of a \emph{tame} Morse function on a smooth, closed manifold $M$ recovers the homotopy type of $M$, thereby addressing a claim in a preprint of Cohen--Jones--Segal. The tameness…
New elementary, self-contained proofs are presented for the topological and the smooth classification theorems of linear flows on finite-dimensional normed spaces. The arguments, and the examples that accompany them, highlight the…
Normalizing Flows are a promising new class of algorithms for unsupervised learning based on maximum likelihood optimization with change of variables. They offer to learn a factorized component representation for complex nonlinear data and,…
We introduce, develop, and apply a new approach for dealing with the intuitive notion of function, called Flow Theory. Within our framework all functions are monadic and none of them has any domain. Sets, proper classes, categories,…
The behavior of complex systems is determined not only by the topological organization of their interconnections but also by the dynamical processes taking place among their constituents. A faithful modeling of the dynamics is essential…
To capture the global structure of a dynamical system we reformulate dynamics in terms of appropriately constructed topologies, which we call flow topologies; we call this process topologization. This yields a description of a semi-flow in…
Estimating the causal structure of observational data is a challenging combinatorial search problem that scales super-exponentially with graph size. Existing methods use continuous relaxations to make this problem computationally tractable…
We introduce Neural Conjugate Flows (NCF), a class of neural network architectures equipped with exact flow structure. By leveraging topological conjugation, we prove that these networks are not only naturally isomorphic to a continuous…
Flow networks have attracted a lot of research in computer science. Indeed, many questions in numerous application areas can be reduced to questions about flow networks. Many of these applications would benefit from a framework in which one…
We describe a calculus of moves for modifying a framed flow category without changing the associated stable homotopy type. We use this calculus to show that if two framed flow categories give rise to the same stable homotopy type of…
We construct a cofibrantly generated model structure on the category of flows such that any flow is fibrant and such that two cofibrant flows are homotopy equivalent for this model structure if and only if they are S-homotopy equivalent.…
Globular CW-complexes and flows are both geometric models of concurrent processes which allow to model in a precise way the notion of dihomotopy. Dihomotopy is an equivalence relation which preserves computer-scientific properties like the…
"Concurrence topology" (Ellis and Klein \emph{Homology, Homotopy, and Applications,} \textbf{16}) is a TDA method for binary data. The idea is to construct a filtration consisting of Dowker complexes then compute persistent homology.…
Structurally stable (rough) flows on surfaces have only finitely many singularities and finitely many closed orbits, all of which are hyperbolic, and they have no trajectories joining saddle points. The violation of the last property leads…
Diverse implicit structures of fluids are discovered lately, providing opportunities to study the physics of fluids applying network analysis. Although considerable works devote to identifying informative network structures of fluids, we…
Constructal Law states that a finite-size flow system that persists in time evolves its configuration so as to provide progressively easier access to the currents that flow through it. Classical Constructal theory derives hierarchical flow…
For a topological flow $(V,\phi)$ - i.e., $V$ is a linearly compact vector space and $\phi$ a continuous endomorphism of $V$ - we gain a deep understanding of the relationship between $(V,\phi)$ and the Bernoulli shift: a topological flow…