Related papers: Thurston equivalence for rational maps with cluste…
In 1980s, Thurston established a topological characterization theorem for postcritically finite rational maps. In this paper, a decomposition theorem for a class of postcritically infinite branched covering termed `Herman map' is developed.…
We study the dynamics of the map $x$ to $dx$ (mod 1) on the unit circle. We characterize the invariant finite subsets of this map which are called cycles and are graded by their degrees. By looking at the combinatorial properties of the…
Following Douady-Hubbard and Bartholdi-Nekrashevych, we give an algebraic formulation of Thurston's characterization of rational functions. The techniques developed are applied to the analysis of the dynamics on the set of free homotopy…
The aims of this paper are to answer several conjectures and questions about multiplier spectrum of rational maps and to give new proofs of several rigidity theorems in complex dynamics, by combining tools from complex and non-archimedean…
We show that for any set of n distinct points in the complex plane, there exists a polynomial p of degree at most n+1 so that the corresponding Newton map, or even the relaxed Newton map, for p has the given points as a super-attracting…
We obtain an analogue of the prime number theorem for a class of branched covering maps on the $2$-sphere called expanding Thurston maps $f$, which are topological models of some rational maps without any smoothness or holomorphicity…
Using Thurston's characterization of postcritically finite rational functions as branched coverings of the sphere to itself, we give a new method of constructing new conformal dynamical systems out of old ones. Let $f(z)$ be a rational map…
We study the dynamics of Thurston maps under iteration. These are branched covering maps $f$ of 2-spheres $S^2$ with a finite set $\mathop{post}(f)$ of postcritical points. We also assume that the maps are expanding in a suitable sense.…
The generalization of Kasteleyn and Fortuin clusters formalism is introduced in XY (or more generally O(n)) models. Clusters geometrical structure may be linked to spin physical properties as correlation functions. To investigate…
We develop the theory of Thurston maps that are defined everywhere on the topological sphere $S^2$ with a possible exception of a single essential singularity. We establish an analog of the celebrated W. Thurston's characterization theorem…
This work proposes a hierarchical clustering algorithm for high-dimensional datasets using the cyclic space of reversible finite cellular automata. In cellular automaton (CA) based clustering, if two objects belong to the same cycle, they…
We introduce a fast and explainable clustering method called CLASSIX. It consists of two phases, namely a greedy aggregation phase of the sorted data into groups of nearby data points, followed by the merging of groups into clusters. The…
In this paper we study MapReduce computations from a complexity-theoretic perspective. First, we formulate a uniform version of the MRC model of Karloff et al. (2010). We then show that the class of regular languages, and moreover all of…
William Thurston (1946-2012) gave a combinatorial characterization for generic branched self-coverings of the two-sphere by associating a planar graph to them 10.48550/arXiv.1502.04760. By generalizing the notion of local balancing, the…
Topological mating is an combination that takes two same-degree polynomials and produces a new map with dynamics inherited from this initial pair. This process frequently yields a map that is Thurston-equivalent to a rational map $F$ on the…
The key result in the present paper is a direct analogue of the celebrated Thurston's Theorem for marked Thurston maps with parabolic orbifolds. Combining this result with previously developed techniques, we prove that every Thurston map…
The complexity of deciding whether a clustered graph admits a clustered planar drawing is a long-standing open problem in the graph drawing research area. Several research efforts focus on a restricted version of this problem where the…
Graphs are commonly used to represent and visualize causal relations. For a small number of variables, this approach provides a succinct and clear view of the scenario at hand. As the number of variables under study increases, the graphical…
We consider "Thurston maps": branched self-coverings of the sphere with ultimately periodic critical points, and prove that the Thurston equivalence problem between them (continuous deformation of maps along with their critical orbits) is…
Dual decomposition provides a tractable framework for designing algorithms for finding the most probable (MAP) configuration in graphical models. However, for many real-world inference problems, the typical decomposition has a large…