Related papers: Flow views and infinite interval exchange transfor…
We consider suspension flows built over interval exchange transformations with the help of roof functions having an asymmetric logarithmic singularity. We prove that such flows are strongly mixing for a full measure set of interval exchange…
We classify certain sofic shifts (the irreducible Point Extension Type, or PET, sofic shifts) up to flow equivalence, using invariants of the canonical Fischer cover. There are two main ingredients: (1) An extension theorem, for extending…
We tackle the problem of estimating flow between two images with large lighting variations. Recent learning-based flow estimation frameworks have shown remarkable performance on image pairs with small displacement and constant…
In this paper we give a criterion for a special flow to be not isomorphic to its inverse which is a refine of a result in \cite{Fr-Ku-Le}. We apply this criterion to special flows $T^f$ built over ergodic interval exchange transformations…
We study two problems related to flow equivalence of shift spaces. The first problem, the classification of $S$-gap shifts up to flow equivalence, is partially solved with the establishment of a new invariant for the sofic $S$-gap shifts…
Flows in networks (or graphs) play a significant role in numerous computer vision tasks. The scalar-valued edges in these graphs often lead to a loss of information and thereby to limitations in terms of expressiveness. For example,…
A flow invariant is a quantity depending only on the UV and IR conformal fixed points and not on the flow connecting them. Typically, its value is related to the central charges a and c. In classically-conformal field theories, scale…
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…
In this paper, a G-shift of finite type (G-SFT) is a shift of finite type together with a free continuous shift-commuting action by a finite group G. We reduce the classification of G-SFTs up to equivariant flow equivalence to an algebraic…
Let Q be a component of a stratum of abelian or quadratic differentials on an oriented surface of genus $g\geq 0$ with $m\geq 0$ punctures and $3g-3+m\geq 2$. We construct a subshift of finite type $(\Omega,\sigma)$ and a Borel suspension…
Video representation is a key challenge in many computer vision applications such as video classification, video captioning, and video surveillance. In this paper, we propose a novel approach for video representation that captures…
We study the time-averaged flow in a model of particles that randomly hop on a finite directed graph. In the limit as the number of particles and the time window go to infinity but the graph remains finite, the large-deviation rate…
For a subshift $(X, \sigma_X)$ and a subadditive sequence $\mathcal{F}=\{\log f_n\}_{n=1}^{\infty}$ on $X$, we study equivalent conditions for the existence of $h\in C(X)$ such that $\lim_{n\rightarrow\infty}(1/{n})\int \log f_n d \mu=\int…
We study basic properties of flow equivalence on one-dimensional compact metric spaces with a particular emphasis on isotopy in the group of (self-) flow equivalences on such a space. In particular, we show that an orbit-preserving such map…
Dense flow visualization is a popular visualization paradigm. Traditionally, the various models and methods in this area use a continuous formulation, resting upon the solid foundation of functional analysis. In this work, we examine a…
Self-similar stable mixed moving average processes can be related to nonsingular flows through their minimal representations. Self-similar stable mixed moving averages related to dissipative flows have been studied, as well as processes…
Shifts of finite type defined from shift equivalent matrices must be flow equivalent.
We introduce a novel neural representation for maps between 3D shapes based on flow-matching models, which is computationally efficient and supports cross-representation shape matching without large-scale training or data-driven procedures.…
Shift-invariant spaces (SISs) on the real line provide a natural framework for representing, analyzing and processing signals with inherent shift-invariant structure. In this paper, we extend this framework to the finite undirected graph…
The one-way measurement model is a framework for universal quantum computation, in which algorithms are partially described by a graph G of entanglement relations on a collection of qubits. A sufficient condition for an algorithm to perform…