We prove that for C1-diffeomorfisms semi-hyperbolicity of an invariant set implies its hyperbolicity. Moreover, we provide some exact estimations of hyperbolicity constants by semi-hyperbolicity ones, which can be useful in strict numerical computations.

Hyperbolicity cones are convex algebraic cones arising from hyperbolic polynomials. A well-understood subclass of hyperbolicity cones is that of spectrahedral cones and it is conjectured that every hyperbolicity cone is spectrahedral. In this paper we prove a weaker version of this conjecture by showing that every smooth hyperbolicity cone is the linear projection of a spectrahedral cone, that ...

In this paper, we study Gromov hyperbolicity and related parameters, that represent how close (locally) a metric space is to a tree from a metric point of view. The study of Gromov hyperbolicity for geodesic metric spaces can be reduced to the study of graph hyperbolicity. Our main contribution in this note is a new characterization of hyperbolicity for graphs (and for complete geodesic metric ...

It is known that for every graph G there exists the smallest Helly graph H(G) into which G isometrically embeds (H(G) is called the injective hull of G) such that the hyperbolicity of H(G) is equal to the hyperbolicity of G. Motivated by this, we investigate structural properties of Helly graphs that govern their hyperbolicity and identify three isometric subgraphs of the King-grid as structura...

1. Under suitable smoothness assumptions, quasiperiodicity, and hence the absence of any kind of hyperbolicity, is non-negligible in a measure-theoretical sense [Kol] (under suitable smoothness assumptions). 2. In low regularity (C), failure of non-uniform hyperbolicity (here nonuniform hyperbolicity can be understood as positivity of the metric entropy) is a fairly robust phenomenon in the top...

Various real world phenomena can be modeled by a notion called complex network. Much effort has been devoted into understanding and manipulating this notion. Recent research hints that complex networks have an underlying hyperbolic geometry that gives them navigability, a highly desirable property observed in many complex networks. In this internship, a parameter called δ-hyperbolicity, which i...

We prove results on geodesic metric spaces which guarantee that some spaces are not hyperbolic in the Gromov sense. We use these theorems in order to study the hyperbolicity of Riemann surfaces. We obtain a criterion on the genus of a surface which implies non-hyperbolicity. We also include a characterization of the hyperbolicity of a Riemann surface S∗ obtained by deleting a closed set from on...

Through detailed analysis of scores of publicly available data sets corresponding to a wide range of large-scale networks, from communication and road networks to various forms of social networks, we explore a little-studied geometric characteristic of real-life networks, namely their hyperbolicity. In smooth geometry, hyperbolicity captures the notion of negative curvature; within the more abs...

We give exact and approximation algorithms for computing the Gromov hyperbolicity of an n-point discrete metric space. We observe that computing the Gromov hyperbolicity from a fixed base-point reduces to a (max,min) matrix product. Hence, using the (max,min) matrix product algorithm by Duan and Pettie, the fixed base-point hyperbolicity can be determined in O(n) time. It follows that the Gromo...

Hyperbolicity measures, in terms of (distance) metrics, how close a given graph is to being a tree. Due to its relevance in modeling real-world networks, hyperbolicity has seen intensive research over the last years. Unfortunately, the best known algorithms for computing the hyperbolicity number of a graph (the smaller, the more tree-like) have running time O(n), where n is the number of graph ...