English
Related papers

Related papers: From rubber bands to rational maps: A research rep…

200 papers

Graph theoretical ideas are highly utilized by computer science fields especially data mining. In this field, a data structure can be designed in the form of tree. Covering is a widely used form of data representation in data mining and…

Artificial Intelligence · Computer Science 2015-03-05 Aiping Huang , William Zhu

It is known that graphs cellularly embedded into surfaces are equivalent to ribbon graphs. In this work, we generalize this statement to broader classes of graphs and surfaces. Half-edge graphs extend abstract graphs and are useful in…

Combinatorics · Mathematics 2017-09-06 Remi C. Avohou , Joseph Ben Geloun , Mahouton N. Hounkonnou

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…

Dynamical Systems · Mathematics 2016-09-06 Kelvin Pilgrim , Tan Lei

We investigate the structure of conformally rigid graphs. Graphs are conformally rigid if introducing edge weights cannot increase (decrease) the second (last) eigenvalue of the Graph Laplacian. Edge-transitive graphs and distance-regular…

Combinatorics · Mathematics 2025-06-26 João Gouveia , Stefan Steinerberger , Rekha R. Thomas

We develop a general theory of "bisets": sets with two commuting group actions. They naturally encode topological correspondences. Just as van Kampen's theorem decomposes into a graph of groups the fundamental group of a space given with a…

Group Theory · Mathematics 2015-12-31 Laurent Bartholdi , Dzmitry Dudko

In 1980's, Thurston established a combinatorial characterization for post-critically finite rational maps. This criterion was then extended by Cui, Jiang, and Sullivan to sub-hyperbolic rational maps. The goal of this paper is to present a…

Dynamical Systems · Mathematics 2008-11-25 Gaofei Zhang , Yunping Jiang

We explore a novel method to generate and characterize complex networks by means of their embedding on hyperbolic surfaces. Evolution through local elementary moves allows the exploration of the ensemble of networks which share common…

Statistical Mechanics · Physics 2007-09-19 T. Aste , T. Di Matteo , S. T. Hyde

Cutting a hyperbolic surface X along a simple closed multi-geodesic results in a hyperbolic structure on the complementary subsurface. We study the distribution of the shapes of these subsurfaces in moduli space as boundary lengths go to…

Geometric Topology · Mathematics 2022-08-10 Francisco Arana-Herrera , Aaron Calderon

Correlated structures are intimately connected to intriguing phenomena exhibited by a variety of disordered systems such as soft colloidal gels, bio-polymer networks and colloidal suspensions near a shear jamming transition. The universal…

Statistical Mechanics · Physics 2026-05-04 Jorge M. Escobar-Agudelo , Rui Aquino , Danilo B. Liarte

An interacting lattice model describing the subspace spanned by a set of strongly-correlated bands is rigorously coupled to density functional theory to enable ab initio calculations of geometric and topological material properties. The…

Strongly Correlated Electrons · Physics 2019-03-26 Ryan Requist , E. K. U. Gross

We prove that any graph of multicurves satisfying certain natural properties is either hyperbolic, relatively hyperbolic, or thick. Further, this geometric characterization is determined by the set of subsurfaces that intersect every vertex…

Geometric Topology · Mathematics 2022-09-23 Jacob Russell , Kate M. Vokes

Let (X,d) be a tree (T) of hyperbolic metric spaces satisfying the quasi-isometrically embedded condition. Let $v$ be a vertex of $T$. Let $({X_v},d_v)$ denote the hyperbolic metric space corresponding to $v$. Then $i : X_v \rightarrow X$…

Geometric Topology · Mathematics 2011-03-24 Mahan Mitra

When can a unimodular random planar graph be drawn in the Euclidean or the hyperbolic plane in a way that the distribution of the random drawing is isometry-invariant? This question was answered for one-ended unimodular graphs in…

Probability · Mathematics 2026-03-24 Ádám Timár , László Márton Tóth

Thurston maps are branched self-coverings of the sphere whose critical points have finite forward orbits. We give combinatorial and algebraic characterizations of Thurston maps that are isotopic to expanding maps as "Levy-free" maps and as…

Dynamical Systems · Mathematics 2016-10-11 Laurent Bartholdi , Dzmitry Dudko

Rationally null-homologous links in Seifert fibered spaces may be represented combinatorially via labeled diagrams. We introduce an additional condition on a labeled link diagram and prove that it is equivalent to the existence of a…

Geometric Topology · Mathematics 2011-08-11 Joan E. Licata , Joshua M. Sabloff

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.…

Dynamical Systems · Mathematics 2012-03-27 Xiaoguang Wang

We study arc graphs and curve graphs for surfaces of infinite topological type. First, we define an arc graph relative to a finite number of (isolated) punctures and prove that it is a connected, uniformly hyperbolic graph of infinite…

Geometric Topology · Mathematics 2015-11-11 Javier Aramayona , Ariadna Fossas , Hugo Parlier

Under some mild assumptions, an orientation-preserving branched covering map of marked $2$-spheres induces a pullback map between the corresponding Teichm\"uller spaces. By analyzing the associated pushforward operator acting on integrable…

Dynamical Systems · Mathematics 2022-12-01 Khashayar Filom

Given a metric (graph) bundle $X$ over $B$ where all the fibres are strongly relatively hyperbolic and nonelementary we show that, under certain conditions, $X$ is strongly hyperbolic relative to a collection of maximal cone-subbundles of…

Group Theory · Mathematics 2022-04-05 Swathi Krishna

A paradigm that was successfully applied in the study of both pure and algorithmic problems in graph theory can be colloquially summarized as stating that "any graph is close to being the disjoint union of expanders". Our goal in this paper…

Combinatorics · Mathematics 2015-02-03 Guy Moshkovitz , Asaf Shapira