Related papers: A simplified algorithm for the topological entropy…
New algorithms are devised for finding the maxima of multidimensional point samples, one of the very first problems studied in computational geometry. The algorithms are very simple and easily coded and modified for practical needs. The…
A useful approach to the mathematical analysis of large-scale biological networks is based upon their decompositions into monotone dynamical systems. This paper deals with two computational problems associated to finding decompositions…
The present research work proposes a new fast fixed-point averaging algorithm on the compact Stiefel manifold based on a mixed retraction/lifting pair. Numerical comparisons between fixed-point algorithms based on the proposed…
The limits of molecular dynamics (MD) simulations of macromolecules are steadily pushed forward by the relentless developments of computer architectures and algorithms. This explosion in the number and extent (in size and time) of MD…
In this paper we will modify the Milnor--Thurston map, which maps a one dimensional mapping to a piece-wise linear of the same entropy, and study its properties. This will allow us to give a simple proof of monotonicity of topological…
We define a Bowen-Series like map for every geometric presentation of a co-compact surface group and we prove that the volume entropy of the presentation is the topological entropy of this particular (circle) map. Finally we find the…
In this note we give examples of Hamiltonian diffeomorphisms which are on one hand dynamically complicated, for instance with positive topological entropy, and on the other hand minimal from the perspective of Floer theory. The minimality…
In many high-impact applications, it is important to ensure the quality of output of a machine learning algorithm as well as its reliability in comparison with the complexity of the algorithm used. In this paper, we have initiated a…
Drawing network maps automatically comprises two challenging steps, namely laying out the map and placing non-overlapping labels. In this paper we tackle the problem of labeling an already existing network map considering the application of…
This paper presents and explores a theory of \emph{multiholomorphic maps}. This group of ideas generalizes the theory of pseudoholomorphic curves in a direction suggested by consideration of the kinds of compatible geometric structures that…
We show that $\mathcal{C}^{\infty}$ local diffeomorphisms of closed surfaces whose topological entropy is larger than the logarithm of their degree admit a finite number of ergodic measures of maximal entropy. To do this, we construct…
A characterization of topological order in terms of bi-partite entanglement was proposed recently [A. Kitaev and J. Preskill, Phys. Rev. Lett. 96, 110404 (2006); M. Levin and X.-G. Wen, ibid, 110405]. It was argued that in a topological…
Among the normalized metrics on a graph, we show the existence and the uniqueness of an entropy-minimizing metric, and give explicit formulas for the minimal volume entropy and the metric realizing it.
In this paper, we derive a simple method for separating topological noise from topological features using a novel measure for comparing persistence barcodes called persistent entropy.
In this paper we present a novel methodology based on a topological entropy, the so-called persistent entropy, for addressing the comparison between discrete piecewise linear functions. The comparison is certified by the stability theorem…
The concept of "$A$-coupled-expanding" map for a transition matrix $A$ has been studied as one of the most important criteria of chaos in the past years. In this paper, the lower bound of the topological entropy for strictly…
We use the complexity function of an invariant, not necessary closed, subset of a two-sided shift space to compute the polynomial entropy of the induced dynamics on the hyperspace of continua for certain one-dimensional dynamical systems.…
A randomized algorithm for finding sparse cuts is given which is based on constructing a dual markov chain called multiscale rings process(MRP) and a new concept of entropy. It is shown how the time to absorption of the dual process…
A method of {\it topological grammars} is proposed for multidimensional data approximation. For data with complex topology we define a {\it principal cubic complex} of low dimension and given complexity that gives the best approximation for…
Topology optimization is one of the engineering tools for finding efficient design. For the material interpolation scheme, it is usual to employ the SIMP (Solid Isotropic Material with Penalization) or the homogenization based interpolation…