Related papers: Average Gromov hyperbolicity and the Parisi ansatz
A labeled metric space is intuitively speaking a metric space together with a special set of points to be understood as the geometric boundary of the space. We study basic properties of a recently introduced labeled Gromov-Hausdorff…
We study (unrooted) random forests on a graph where the probability of a forest is multiplicatively weighted by a parameter $\beta>0$ per edge. This is called the arboreal gas model, and the special case when $\beta=1$ is the uniform forest…
Successive divisions of compact metric spaces appear in many different areas of mathematics such as the construction of self-similar sets, Markov partitions associated with hyperbolic dynamical systems, dyadic cubes associated with a…
We study the statistical and dynamic properties of the systems characterized by an ultrametric space of states and translationary non-invariant symmetric transition matrices of the Parisi type subjected to "locally constant" randomization.…
In this article, we study the geodesic problem in a generalized metric space, in which the distance function satisfies a relaxed triangle inequality $d(x,y)\leq \sigma (d(x,z)+d(z,y))$ for some constant $\sigma \geq 1$, rather than the…
In this paper we study the hyperbolicity in the sense of Gromov of domains in $\mathbb{R}^d$ $(d\geq3)$ with respect to the minimal metric introduced by Forstneri\v{c} and Kalaj. In particular, we prove that every bounded strongly minimally…
Treedepth, a more restrictive graph width parameter than treewidth and pathwidth, plays a major role in the theory of sparse graph classes. We show that there exists a constant $C$ such that for every positive integers $a,b$ and a graph…
In this paper, we study the asymptotic behaviour of the number of subtrees and the subtree density for a sequence of trees that converges in the Benjamini-Schramm sense. Benjamini-Schramm convergence, also called local weak convergence,…
Ultametrics are an important class of distances used in applications such as phylogenetics, clustering and classification theory. Ultrametrics are essentially distances that can be represented by an edge-weighted rooted tree so that all of…
The treewidth of a graph is an important invariant in structural and algorithmic graph theory. This paper studies the treewidth of line graphs. We show that determining the treewidth of the line graph of a graph $G$ is equivalent to…
In this paper we define the notion of $(p,\delta)$--Gromov hyperbolic space where we relax Gromov's {\it slimness} condition to allow that not all but a positive fraction of all triangles are $\delta$--slim. Furthermore, we study maximum…
In this note, we prove optimal extension results for roughly isometric relations between metric (R-)trees and injective metric spaces. This yields sharp stability estimates, in terms of the Gromov-Hausdorff (GH) distance, for certain metric…
If $X$ is a geodesic metric space and $x_{1},x_{2},x_{3} \in X$, a geodesic triangle $T=\{x_{1},x_{2},x_{3}\}$ is the union of the three geodesics $[x_{1}x_{2}]$, $[x_{2}x_{3}]$ and $[x_{3}x_{1}]$ in $X$. The space $X$ is…
By the Grid Minor Theorem of Robertson and Seymour, every graph of sufficiently large tree-width contains a large grid as a minor. Tree-width may therefore be regarded as a measure of 'grid-likeness' of a graph. The grid contains a long…
In this work, a metric is presented on the set of boundedly-compact pointed metric spaces that generates the Gromov-Hausdorff topology. A similar metric is defined for measured metric spaces that generates the Gromov-Hausdorff-Prokhorov…
In Thurston's notes, he gives two different definitions of the Gromov norm (also called simplicial volume) of a manifold and states that they are equal but does not prove it. Gromov proves it in the special case of hyperbolic manifolds as a…
Using uniformization, Cantor type sets can be regarded as boundaries of rooted trees. In this setting, we show that the trace of a first-order Sobolev space on the boundary of a regular rooted tree is exactly a Besov space with an explicit…
The eccentricity of a vertex $v$ in a graph $G$ is the maximum distance from $v$ to any other vertex. The vertices whose eccentricity are equal to the diameter (the maximum eccentricity) of $G$ are called peripheral vertices. In trees the…
We show that every connected graph can be approximated by a normal tree, up to some arbitrarily small error phrased in terms of neighbourhoods around its ends. The existence of such approximate normal trees has consequences of both…
The intricate relations between elements in natural and human-made systems sustain the complex processes that shape our world, forming multiscale networks of interactions. These networks can be represented as graphs composed of nodes…