相关论文: Rotated Odometers and Actions on Rooted Trees
Optimal transport (OT) theory provides powerful tools to compare probability measures. However, OT is limited to nonnegative measures having the same mass, and suffers serious drawbacks about its computation and statistics. This leads to…
We develop a renormalization scheme which extends the classical Rauzy-Veech induction used to study interval exchange tranformations (IETs) and allows to study generalized interval exchange transformations (GIETs) $T: [0,1) \to [0,1)$ with…
The rotor walk on a graph is a deterministic analogue of random walk. Each vertex is equipped with a rotor, which routes the walker to the neighbouring vertices in a fixed cyclic order on successive visits. We consider rotor walk on an…
We study the ergodic properties of compositions of interval exchange transformations and rotations. We show that for any interval exchange transformation T, there is a full measure set of \alpha in [0, 1) so that T composed with R_{\alpha}…
An interval translation map (ITM) is a map $T \colon I \to I$ defined as a piecewise translation on a finite partition of an interval $I$ into $r \ge 2$ subintervals. Unlike classical interval exchange transformations (IETs), the images of…
Inertial sensors play a pivotal role in indoor localization, which in turn lays the foundation for pervasive personal applications. However, low-cost inertial sensors, as commonly found in smartphones, are plagued by bias and noise, which…
This paper will show when a rooted path tree of a finite directed rooted graph has only finitely many orbits under the action of its undirected automorphism group (i.e. when it is cocompact). This will allow us to specify which trees are…
Let $\FN$ be a free group of finite rank $N \geq 2$, and let $T$ be an $\R$-tree with a very small, minimal action of $\FN$ with dense orbits. For any basis $\CA$ of $\FN$ there exists a {\em heart} $K_{\CA} \subset \bar T$ (= the metric…
We consider generalized interval exchange transformations, or briefly GIETs, that is bijections of the interval which are piecewise increasing homeomorphisms with finite branches. When all continuous branches are translations, such maps are…
In this article we study minimal equicontinuous actions on Stone spaces, which we call \emph{subodometers}, and do neither assume that the space is metrizable, nor any assumptions on the acting group. We show that the set of eigenvalues is…
The main result of this paper is that two large collections of ergodic measure preserving systems, the Odometer Based and the Circular Systems have the same global structure with respect to joinings. The classes are canonically isomorphic…
This paper generalizes Bass' work on zeta functions for uniform tree lattices. Using the theory of von Neumann algebras, machinery is developed to define the zeta function of a discrete group of automorphisms of a bounded degree tree. The…
This paper uses combinatorics and group theory to answer questions about the assembly of icosahedral viral shells. Although the geometric structure of the capsid (shell) is fairly well understood in terms of its constituent subunits, the…
A diverse variety of processes --- including recurrent disease episodes, neuron firing, and communication patterns among humans --- can be described using inter-event time (IET) distributions. Many such processes are ongoing, although event…
We produce affine interval exchange transformations (AIETs) which are topologically conjugated to (standard) interval exchange maps (IETs) via a singular conjugacy, i.e. a diffeomorphism $h$ of $[0,1]$ which is $C^0$ but not $C^1$ and such…
Let $G$ be a countable branch group of automorphisms of a spherically homogeneous rooted tree. Under some assumption on finitarity of $G$, we construct, for each sequence $\omega\in\{0,1\}^\Bbb N$, an irreducible unitary representation…
As well known the rotation distance D(S,T) between two binary trees S, T of n vertices is the minimum number of rotations of pairs of vertices to transform S into T. We introduce the new operation of chain rotation on a tree, involving two…
Learning-based inertial odometry has achieved remarkable progress in pedestrian navigation. However, extending these methods to quadruped robots remains challenging due to their distinct and highly dynamic motion patterns. Models that…
We classify the locally finite ergodic invariant measures of certain infinite interval exchange transformations (IETs). These transformations naturally arise from return maps of the straight-line flow on certain translation surfaces, and…
Out-Of-Distribution (OOD) generalization is an essential topic in machine learning. However, recent research is only focusing on the corresponding methods for neural networks. This paper introduces a novel and effective solution for OOD…