Related papers: Thuston's Teapots and Graph Directed Systems
Time-evolving traffic flow forecasting are playing a vital role in intelligent transportation systems and smart cities. However, the dynamic traffic flow forecasting is a highly nonlinear problem with complex temporal-spatial dependencies.…
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…
The behavior under iteration of the critical points of polynomial maps plays an essential role in understanding its dynamics. We study the special case where the forward orbits of the critical points are finite. Thurston's theorem tells us…
An orientation-preserving branched covering map $f\colon S^2 \to S^2$ is called a critically fixed Thurston map if $f$ fixes each of its critical points. It was recently shown that there is an explicit one-to-one correspondence between…
We calculate explicit formulae for the Shannon entropies of several families of tailored random graph ensembles for which no such formulae were as yet available, in leading orders in the system size. These include bipartite graph ensembles…
As a particular problem within the field of non-autonomous discrete systems, we consider iterations of two quadratic maps $f_{c_0}=z^2+c_0$ and $f_{c_1}=z^2+c_1$, according to a prescribed binary sequence, which we call a \emph{template}.…
In this paper we present a deep learning method to predict the temporal evolution of dissipative dynamic systems. We propose using both geometric and thermodynamic inductive biases to improve accuracy and generalization of the resulting…
Entanglement is a complexity measure of digraphs that origins in fixed-point logics. Its combinatorial purpose is to measure the nested depth of cycles in digraphs. We address the problem of characterizing the structure of graphs of…
A topological computation method, called the MGSTD method, is applied to time-series data obtained from meteorological measurement. The method gives decomposition of the dynamics into invariant sets and gradient-like transitions between…
We propose a novel node embedding of directed graphs to statistical manifolds, which is based on a global minimization of pairwise relative entropy and graph geodesics in a non-linear way. Each node is encoded with a probability density…
A reliable and efficient representation of multivariate time series is crucial in various downstream machine learning tasks. In multivariate time series forecasting, each variable depends on its historical values and there are…
A model for the Mandelbrot set is due to Thurston and is stated in the language of geodesic laminations. The conjecture that the Mandelbrot set is actually homeomorphic to this model is equivalent to the celebrated MLC conjecture stating…
A stirring device consisting of a periodic motion of rods induces a mapping of the fluid domain to itself, which can be regarded as a homeomorphism of a punctured surface. Having the rods undergo a topologically-complex motion guarantees at…
For a continuous map on the unit interval or circle, we define the bifurcation set to be the collection of those interval holes whose surviving set is sensitive to arbitrarily small changes of their position. By assuming a global…
The directed graph (digraph), as a generalization of undirected graphs, exhibits superior representation capability in modeling complex topology systems and has garnered considerable attention in recent years. Despite the notable efforts…
A convenient measure of a map or flow's chaotic action is the topological entropy. In many cases, the entropy has a homological origin: it is forced by the topology of the space. For example, in simple toral maps, the topological entropy is…
Following Thurston's geometrisation picture in dimension three, we study geometric manifolds in a more general setting in arbitrary dimensions, with respect to the following problems: (i) The existence of maps of non-zero degree (domination…
This paper deals with analytic families of holomorphic iterated function systems. Using real analyticity of the pressure function (which we prove), we establish a classification theorem for analytic families of holomorphic iterated function…
We argue that discrete dynamics has natural links to the theory of analytic functions. Most important, bifurcations and chaotic dynamical properties are related to intersections of algebraic varieties. This paves the way to identification…
A numerical algorithm to compute the topological entropy of multimodal maps is proposed. This algorithm results from a closed formula containing the so-called min-max symbols, which are closely related to the kneading symbols. Furthermore,…