相关论文: Metric compactification of infinite Sierpi\'nski c…

For each infinite word over a given finite alphabet, we define an increasing sequence of rooted finite graphs, that can be thought as approximations of the famous Sierpinski carpet. These sequences naturally converge to an infinite rooted…

Generalizing works of D'Angeli and Donno, we describe, starting from an infinite sequence over $r$ letters with $r \neq 4i$ and $i \in \mathbb{N}$, a sequence of pointed finite graphs. We study the pointed Gromov-Hausdorff limit graphs…

To a subshift over a finite alphabet, one can naturally associate an infinite family of finite graphs, called its Rauzy graphs. We show that for a subshift of subexponential complexity the Rauzy graphs converge to the line $\mathbf{Z}$ in…

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…

Using the wedge sum of metric spaces, for all compact metrizable spaces, we construct a topological embedding of the compact metrizable space into the set of all metric trees in the Gromov--Hausdorff space with finite prescribed values. As…

We consider the Bernoulli bond percolation process (with parameter $p$) on infinite graphs and we give a general criterion for bounded degree graphs to exhibit a non-trivial percolation threshold based either on a single isoperimetric…

We study the question of approximating a compact geodesic metric space by metric graphs satisfying a uniform upper bound on their first Betti number. We prove that, up to a suitable multiplicative constant, Reeb graphs of distance functions…

We determine the asymptotic behaviour of extremal length along arbitrary Teichm\"uller rays. This allows us to calculate the endpoint in the Gardiner-Masur boundary of any Teichm\"uller ray. We give a proof that this compactification is the…

We prove that the edge-end space of an infinite graph is metrizable if and only if it is first-countable. This strengthens a recent result by Aurichi, Magalhaes Jr.\ and Real (2024). Our central graph-theoretic tool is the use of tree-cut…

In the paper we are dealing with metric measure spaces of diameter at most one and of total measure one. Gromov introduced the sampling compactification of the set of these spaces. He asked whether the metric measure space invariants extend…

We provide a geometric condition which determines whether or not every point on the metric boundary of a graph with the standard path metric is a Busemann point, that is it is the limit point of a geodesic ray. We apply this and a related…

We prove local convergence results for the uniformly random, labelled or unlabelled, graphs from subcritical families. As an example special case, we prove Benjamini-Schramm convergence for the uniform random unlabelled tree. We introduce a…

We give upper and lower bounds for the Hausdorff dimensions for a class of graph-directed measures when its underlying directed graph is the infinite N-ary tree. These measures are different from graph-directed self-similar measures driven…

The aim of this paper is to study ultralimits of pointed metric measure spaces (possibly unbounded and having infinite mass). We prove that ultralimits exist under mild assumptions and are consistent with the pointed measured…

The asymptotic dimension of metric spaces is an important notion in geometric group theory introduced by Gromov. The metric spaces considered in this paper are the ones whose underlying spaces are the vertex-sets of graphs and whose metrics…

Following a general program of studying limits of discrete structures, and motivated by the theory of limit objects of converge sequences of dense simple graphs, we study the limit of graph sequences such that every edge is labeled by an…

Boundary analysis is developed for a rich class of generally infinite weighted graphs with compact metric completions. These graph completions have totally disconnected boundaries. The classical notion of $\epsilon$-components and the…

Under certain continuity conditions, we estimate upper and lower box dimension of graph of a function defined on the Sierpinski gasket. We also give an upper bound for Hausdorff dimension and box dimension of graph of function having finite…

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 an infinite set of graphs which are recursively constructed from an infinite word in a finite alphabet. These graphs are inspired by the construction of the Sierpi\'nski gasket. We show that there are infinitely many non-isomorphic…