Related papers: A simplified algorithm for the topological entropy…
Topological entropy is a measure of complex dynamics. In this regard, multimodal maps play an important role when it comes to study low-dimensional chaotic dynamics or explain some features of higher dimensional complex dynamics with…
We present a method for computing the topological entropy of one-dimensional maps. As an approximation scheme, the algorithm converges rapidly and provides both upper and lower bounds.
We derive an algorithm to determine recursively the lap number (minimal number of monotone pieces) of the iterates of unimodal maps of an interval with free end-points. The algorithm is obtained by the sign analysis of the itineraries of…
In this extended abstract, we report on ongoing work towards an approximate multimodal optimization algorithm with asymptotic guarantees. Multimodal optimization is the problem of finding all local optimal solutions (modes) to a path…
Necessary and sufficient conditions for the symbolic dynamics of a Lorenz map to be fully embedded in the symbolic dynamics of a piecewise continuous interval map are given. As an application of this result, we describe a new algorithm for…
In this paper we discuss two different existing algorithms for computing topological entropy and we perform one of them in order to compute the isentropes for cubic polynomials.
We show that the topological entropy is monotonic for unimodal interval maps which are obtained from the restriction of quadratic rational maps with real coefficients. This is done by ruling out the existence of certain post-critical curves…
The main result of this paper is a proof using real analysis of the monotonicity of the topological entropy for the family of quadratic maps, sometimes called Milnor's Monotonicity Conjecture. In contrast, the existing proofs rely in one…
We propose an algorithm to estimate the topology of an embedded metric graph from a well-sampled finite subset of the underlying graph.
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…
This paper concerns the restricted 3-body problem. By applying topological methods we give a computer assisted proof of the existence of some classes of periodic orbits, the existence of symbolic dynamics and we give a rigorous lower…
We prove that the topological entropy of real unimodal maps depends as a Hoelder continuous function of the kneading parameter, and the local Hoelder exponent equals, up to a factor log 2, the value of the function at that point.
We present an analytical-numerical method providing robust upper estimates for the topological entropy or, more generally, uniform volume growth exponents of differentiable mappings. By introducing varying metrics, we simplify the analysis…
An important problem in computational topology is to calculate the homology of a space from samples. In this work, we develop a statistical approach to this problem by calculating the expected rank of an induced map on homology from a…
We study the existing algorithms that solve the multidimensional martingale optimal transport. Then we provide a new algorithm based on entropic regularization and Newton's method. Then we provide theoretical convergence rate results and we…
The dynamics of symbolic systems, such as multidimensional subshifts of finite type or cellular automata, are known to be closely related to computability theory. In particular, the appropriate tools to describe and classify topological…
The main purpose of this paper is to present a kneading theory for two-dimensional triangular maps. This is done by defining a tensor product between the polynomials and matrices corresponding to the one-dimensional basis map and fiber map.…
We consider Milnor's "tower algorithm" in the space of piecewise monotone maps, an iterative algorithm on the space of metrics which unifies, on the one hand, Thurston's iterative scheme which converges to holomorphic models, and, on the…
We will consider various definitions of topological entropy for multivalued nonautonomous dynamical systems in compact Hausdorff spaces. Some of them can deal with arbitrary multivalued maps, i.e. when no restrictions are imposed on them.…
Maximization of an expensive, unimodal function under random observations has been an important problem in hyperparameter tuning. It features expensive function evaluations (which means small budgets) and a high level of noise. We develop…