Related papers: Metrics on trees I. The tower algorithm for interv…
We show that for almost every map in a transversal one-parameter family of piecewise expanding unimodal maps the Birkhoff sum of suitable observables along the forward orbit of the turning point satisfies the law of iterated logarithm. This…
We establish basic geometric and topological properties of Thurston's Master Teapot and the Thurston set for superattracting unimodal self-maps of intervals. In particular, the Master Teapot is connected, contains the unit cylinder, and its…
We give a survey of the entropy theory of interval maps as it can be analyzed using ergodic theory, especially measures of maximum entropy and periodic points. The main tools are (i) a version of Hofbauer's Markov diagram, (ii) the…
An uncomplicated and easily handling prescription that converts the task of checking the unitarity of massive, topologically massive, models into a straightforward algebraic exercise, is developed. The algorithm is used to test the…
We consider the problem of embedding the Steiner points of a Steiner tree with given topology into the rectilinear plane. Thereby, the length of the path between a distinguished terminal and each other terminal must not exceed given length…
In this paper, building on previous work, we extend the thermodynamic formalism for random open dynamical systems generated by piecewise monotone interval maps with countably many branches. Under summable and contracting assumptions on the…
Boltzmann samplers and the recursive method are prominent algorithmic frameworks for the approximate-size and exact-size random generation of large combinatorial structures, such as maps, tilings, RNA sequences or various tree-like…
We studied topological and metric properties of the so-called interval translation maps (ITMs). For these maps, we introduced the maximal invariant measure and study its properties. Further, we study how the invariant measures depend on the…
We study the dynamics of piecewise affine surface homeomorphisms from the point of view of their entropy. Under the assumption of positive topological entropy, we establish the existence of finitely many ergodic and invariant probability…
We consider some classes of piecewise expanding maps in finite dimensional spaces having invariant probability measures which are absolutely continuous with respect to Lebesgue measure. We derive an entropy formula for such measures and,…
The Learnable Tree Filter presents a remarkable approach to model structure-preserving relations for semantic segmentation. Nevertheless, the intrinsic geometric constraint forces it to focus on the regions with close spatial distance,…
This paper presents a new anytime algorithm for the marginal MAP problem in graphical models. The algorithm is described in detail, its complexity and convergence rate are studied, and relations to previous theoretical results for the…
We provide a proof of the Alpern multi-tower theorem for Z^d actions. We reformulate the theorem as a problem of measurably tiling orbits of a Z^d action by a collection of rectangles whose corresponding sides have no non-trivial common…
We describe Taylor towers for spaces of knots arising from Goodwillie-Weiss calculus of the embedding functor and extend the configuration space integrals of Bott and Taubes from spaces of knots to the stages of the towers. We show that…
Tree-based methods are popular machine learning techniques used in various fields. In this work, we review their foundations and a general framework the importance sampled learning ensemble (ISLE) that accelerates their fitting process.…
In this paper we study functions on the interval that have the same persistent homology. By introducing an equivalence relation modeled after topological conjugacy, which we call graph-equivalence, a precise enumeration of functions with…
For a class of piecewise hyperbolic maps in two dimensions, we propose a combinatorial definition of topological entropy by counting the maximal, open, connected components of the phase space on which iterates of the map are smooth. We…
We propose an algorithm to estimate the topology of an embedded metric graph from a well-sampled finite subset of the underlying graph.
We study independent and identically distributed random iterations of continuous maps defined on a connected closed subset $S$ of the Euclidean space $\mathbb{R}^{k}$. We assume the maps are monotone (with respect to a suitable partial…
This is the announcement, and the long summary, of a series of articles on the algorithmic study of Thurston maps. We describe branched coverings of the sphere in terms of group-theoretical objects called bisets, and develop a theory of…