Related papers: Metric compactification of infinite Sierpi\'nski c…

We investigate topological, combinatorial, statistical, and enumeration properties of finite graphs with high Kolmogorov complexity (almost all graphs) using the novel incompressibility method. Example results are: (i) the mean and variance…

In finite graphs, finite-order tangles offer an abstract description of highly connected substructures. In infinite graphs, infinite-order tangles compactify the graphs in the same way the ends compactify connected locally finite graphs.…

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…

We investigate the relationship between one of the classical notions of boundaries for infinite graphs, \emph{graph ends}, and self-adjoint extensions of the minimal Kirchhoff Laplacian on a metric graph. We introduce the notion of…

We study sequences of oriented Riemannian manifolds with boundary and, more generally, integral current spaces and metric spaces with boundary. {\color{blue}For a metric space, we define its boundary to be the completion of the space minus…

Let $M$ be a graph manifold such that each piece of its JSJ decomposition has the $\Bbb H^2 \times \Bbb R$ geometry. Assume that the pieces are glued by isometries. Then, there exists a complete Riemannian metric on $\Bbb R \times M$ which…

Using the method of spectral decimation and a modified version of Kirchhoffs Matrix-Tree Theorem, a closed form solution to the number of spanning trees on approximating graphs to a fully symmetric self-similar structure on a finitely…

Let X be a finite 2-complex with unfree fundamental group. We prove lower bounds for the area of a metric on X, in terms of the square of the least length of a noncontractible loop in X. We thus establish a uniform systolic inequality for…

We introduce a natural definition of $L^p$-convergence of maps, $p \ge 1$, in the case where the domain is a convergent sequence of measured metric space with respect to the measured Gromov-Hausdorff topology and the target is a…

We construct a sequence of subset partition graphs satisfying the dimension reduction, adjacency, strong adjacency, and endpoint count properties whose diameter has a superlinear asymptotic lower bound. These abstractions of polytope graphs…

Similarity metrics are central in the theory of large networks and graph limits. For bounded-degree graphs, the Benjamini--Schramm metric records the distribution of rooted neighbourhoods, while the stronger colored-neighbourhood metric…

We study the asymptotic shape of random unlabelled graphs subject to certain subcriticality conditions. The graphs are sampled with probability proportional to a product of Boltzmann weights assigned to their $2$-connected components. As…

We consider infinite graphs and the associated energy forms. We show that a graph is canonically compactifiable (i.e. all functions of finite energy are bounded) if and only if the underlying set is totally bounded with respect to any…

This paper studies coarse compactifications and their boundary. We introduce two alternative descriptions to Roe's original definition of coarse compactification. One approach uses bounded functions on $X$ that can be extended to the…

The Graph Minor Theorem of Robertson and Seymour asserts that any graph property, whatsoever, is determined by an associated finite list of graphs. We view this as an impressive generalization of Kuratowski's theorem, which characterizes…

We study multifractal decompositions based on Birkhoff averages for sequences of functions belonging to certain classes of symbolically continuous functions. We do this for an expanding interval map with countably many branches, which we…

A random rooted graph is said to be sofic if it is the Benjamini-Schramm limit of a sequence of finite graphs. Given any finite graph $H$, we prove that every one-ended, unimodular random rooted graph that does not have H as a minor must be…

In this paper, we examine roots of graph polynomials where those roots can be considered as structural graph measures. More precisely, we prove analytical results for the roots of certain modified graph polynomials and also discuss…

There are different definitions of ends in non-locally-finite graphs which are all equivalent in the locally finite case. We prove the compactness of the end-topology that is based on the principle of removing finite sets of vertices and…

We compactify the classical moduli variety of compact Riemann surfaces by attaching moduli of (metrized) graphs as boundary. The compactifications do not admit the structure of varieties and patch together to form a big connected moduli…