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

Many concrete problems are formulated in terms of a finite set of points in $R^n$ which, via the ambient Euclidean metric, becomes a finite metric space. To obtain information from such a space, it is often useful to associate a graph to…

We define and study a new compactification, called the height compactification of the horospheric product of two infinite trees. We will provide a complete description of this compactification. In particular, we show that this…

We consider isomorphism properties of infinite random geometric graphs defined over a variety of metrics. In previous work, it was shown that for $\mathbb{R}^n$ with the $L_{\infty}$-metric, the infinite random geometric graph is, with…

We suggest a new method of describing invariant measures on Markov compacta and path spaces of graphs, and thus of describing characters of some groups and traces of AF-algebras. The method relies on properties of filtrations associated…

We study analytic properties of graph product of finite groups with a hyperbolic defining graph. This is done by studying dynamics on the Bowditch compactification of the extension graph, or the crossing graph, of graph product. In…

We study geodesics in the Brownian map $(\mathcal{S},d,\nu)$, the random metric measure space which arises as the Gromov-Hausdorff scaling limit of uniformly random planar maps. Our results apply to all geodesics including those between…

For bi-Lipschitz homeomorphisms of a compact manifold it is known that topological entropy is always finite. For compact manifolds of dimension two or greater, we show that in the closure of the space of bi-Lipschitz homeomorphisms, with…

Let $I(G)$ be a topological index of a graph. If $I(G+e)<I(G)$ (or $I(G+e)>I(G)$, respectively) for each edge $e\not\in G$, then $I(G)$ is monotonically decreasing (or increasing, respectively) with the addition of edges. In this article,…

This survey paper deals with upper and lower bounds on the number of $k$-matchings in regular graphs on $N$ vertices. For the upper bounds we recall the upper matching conjecture which is known to hold for perfect matchings. For the lower…

A set of vertices $S$ \emph{resolves} a graph $G$ if every vertex is uniquely determined by its vector of distances to the vertices in $S$. The \emph{metric dimension} of a graph $G$ is the minimum cardinality of a resolving set. In this…

We give new examples and describe the complete lists of all measures on the set of countable homogeneous universal graphs and $K_s$-free homogeneous universal graphs (for $s\geq 3$) that are invariant with respect to the group of all…

The definition of the grafting operation for quasifuchsian groups is extended by Bromberg to all $b$-groups. Although the grafting maps are not necessarily continuous at boundary groups, in this paper, we show that the grafting maps take…

We consider changes in properties of a subgraph of an infinite graph resulting from the addition of open edges of Bernoulli percolation on the infinite graph to the subgraph. We give the triplet of an infinite graph, one of its subgraphs,…

We develop non-invertible Pesin theory for a new class of maps called cusp maps. These maps may have unbounded derivative, but nevertheless verify a property analogous to $C^{1+\epsilon}$. We do not require the critical points to verify a…

A theorem proved by Hrushovski for graphs and extended by Solecki and Vershik (independently from each other) to metric spaces leads to a stronger version of ultrahomogeneity of the infinite random graph $R$, the universal Urysohn metric…

We undertake a systematic study of the approximation properties of the topological and measurable versions of the coarse boundary groupoid associated to a sequence of finite graphs of bounded degree. On the topological side, we prove that…

A local cut point is by definition a point that disconnectes its sufficiently small neighborhood. We show that there exists an upper bound for the degree of a local cut point in a metric measure space satisfying the generalized…

In 2012 Lau and Ngai, motivated by the work of Denker and Sato, gave an example of an isotropic Markov chain on the set of finite words over a three letter alphabet, whose Martin boundary is homeomorphic to the Sierpi\'nski gasket. Here, we…

The aim of this chapter is to provide an adequate graph theoretic framework for the description of periodic bifurcations which have recently been discovered in descendant trees of finite p-groups. The graph theoretic concepts of rooted…

This report introduces and investigates a family of metrics on sets of pointed Kripke models. The metrics are generalizations of the Hamming distance applicable to countably infinite binary strings and, by extension, logical theories or…