English
Related papers

Related papers: Gromov Hyperbolic Graphs Arising From Iterations

200 papers

For each k > 0 we find an explicit function f_k such that the topology of S inside the ball B(p,r) is `bounded' by f_k(r) for every complete Riemannian surface (compact or noncompact) with K\geq -k^2, every point p on the surface, and every…

Differential Geometry · Mathematics 2010-09-21 Jesús Gonzalo Pérez , Ana Portilla , José M Rodríguez , Eva Tourís

Decomposable graphs are known for their tedious and complicated Markov update steps. Instead of modelling them directly, this work introduces a class of tree-dependent bipartite graphs that span the projective space of decomposable graphs.…

Methodology · Statistics 2017-10-11 Mohamad Elmasri

We study two actions of big mapping class groups. The first is an action by isometries on a Gromov-hyperbolic graph. The second is an action by homeomorphisms on a circle in which the vertices of the graph naturally embed. The first two…

Geometric Topology · Mathematics 2018-06-28 Juliette Bavard , Alden Walker

Finite subdivision rules in high dimensions can be difficult to visualize and require complex topological structures to be constructed explicitly. In many applications, only the history graph is needed. We characterize the history graph of…

Geometric Topology · Mathematics 2015-12-02 Brian Rushton

Scene graph representations enable structured visual understanding by modeling objects and their relationships, and have been widely used for multiview and 3D scene reasoning. Existing methods such as MSG learn scene graph embeddings in…

Computer Vision and Pattern Recognition · Computer Science 2026-04-21 Liyang Wang , Zeyu Zhang , Hao Tang

We investigate the topological and metric properties of attractors of an iterated function system (IFS) whose functions may not be contractive. We focus, in particular, on invertible IFSs of finitely many maps on a compact metric space. We…

Dynamical Systems · Mathematics 2012-06-28 Michael Barnsley , Andrew Vince

Building trees to represent or to fit distances is a critical component of phylogenetic analysis, metric embeddings, approximation algorithms, geometric graph neural nets, and the analysis of hierarchical data. Much of the previous…

Data Structures and Algorithms · Computer Science 2024-09-04 Joon-Hyeok Yim , Anna C. Gilbert

This work establishes novel optimum mixing bounds for the Glauber dynamics on the Hard-core and Ising models. These bounds are expressed in terms of the local connective constant of the underlying graph $G$. This is a notion of effective…

Discrete Mathematics · Computer Science 2025-04-29 Charilaos Efthymiou

The study of generalized iterated function systems (GIFS) was introduced by Mihail and Miculescu in 2008. We provide a new approach to study those systems as the limit of the Hutchinson-Barnsley setting for infinite iterated function…

Dynamical Systems · Mathematics 2023-01-24 Elismar R. Oliveira

We prove that for a homeomorphism f that is isotopic to the identity on a closed hyperbolic surface, the following are equivalent: * f acts hyperbolically on the fine curve graph; * f is isotopic to a pseudo-Anosov map relative to a finite…

Dynamical Systems · Mathematics 2023-12-14 Pierre-Antoine Guihéneuf , Emmanuel Militon

De Finetti's classical result of [18] identifying the law of an exchangeable family of random variables as a mixture of i.i.d. laws was extended to structure theorems for more complex notions of exchangeability by Aldous [1,2,3], Hoover…

Probability · Mathematics 2008-05-26 Tim Austin

We quantify the topological expansion properties of bounded degree simplicial complexes in terms of a family of sublinear functions, in analogy with the separation profile of Benjamini-Schramm-Tim\'ar for classical expansion of bounded…

Metric Geometry · Mathematics 2024-11-21 David Hume

Tilings of the hyperbolic plane are of significant interest among many branches of mathematics, physics and computer science. Yet, their construction remains a non-trivial task. Current approaches primarily use tree-based recursive…

Computational Physics · Physics 2025-08-08 Yanick Thurn , Manuel Schrauth , Johanna Erdmenger

Recent work has demonstrated that embeddings of tree-like graphs in hyperbolic space surpass their Euclidean counterparts in performance by a large margin. Inspired by these results and scale-free structure in the word co-occurrence graph,…

Computation and Language · Computer Science 2019-05-28 Matthias Leimeister , Benjamin J. Wilson

We show that every non-elementary group $G$ acting properly and cocompactly by isometries on a proper geodesic Gromov hyperbolic space $X$ is growth tight. In other words, the exponential growth rate of $G$ for the geometric…

Group Theory · Mathematics 2013-01-01 Stephane Sabourau

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…

Dynamical Systems · Mathematics 2009-11-13 Mario Roy , Hiroki Sumi , Mariusz Urbanski

Bestvina-Feighn-Handel show that for finitely many generic and independent hyperbolic automorphisms $\phi_1, \cdots, \phi_r$ of $F_n$, the resulting extension $F_n \rtimes F_r$ is hyperbolic. This paper generalizes the above statement to…

Group Theory · Mathematics 2026-04-22 SK Kiran Ajij

A symplectic form is called hyperbolic if its pull-back to the universal cover is a differential of a bounded one-form. The present paper is concerned with the properties and constructions of manifolds admitting hyperbolic symplectic forms.…

Symplectic Geometry · Mathematics 2007-11-27 Jarek Kedra

If $X$ is a geodesic metric space and $x_1,x_2,x_3\in X$, a {\it geodesic triangle} $T=\{x_1,x_2,x_3\}$ is the union of the three geodesics $[x_1x_2]$, $[x_2x_3]$ and $[x_3x_1]$ in $X$. The space $X$ is $\delta$-\emph{hyperbolic} $($in the…

Metric Geometry · Mathematics 2016-11-15 Walter Carballosa , Amauris de la Cruz , Alvaro Martínez-Pérez , José M. Rodríguez

We say that a metric graph is uniformly bounded if the degrees of all vertices are uniformly bounded and the lengths of edges are pinched between two positive constants; a metric space is approximable by a uniform graph if there is one…

Metric Geometry · Mathematics 2013-06-25 Dmitri Burago , Sergei Ivanov
‹ Prev 1 8 9 10 Next ›