Related papers: Metric compactification of infinite Sierpi\'nski c…
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…
In this paper we further study links between concentration of measure in topological transformation groups, existence of fixed points, and Ramsey-type theorems for metric spaces. We prove that whenever the group $\Iso(\U)$ of isometries of…
We show that canonical Carnot-Caratheodory spherical and horospherical metrics, which are defined on the boundary at infinity of every rank one symmetric space of non-compact type, are visual, i.e., they are bilipschitz equivalent with…
Quantum ergodicity asserts that almost all infinite sequences of eigenstates of a quantized ergodic system are equidistributed in the phase space. On the other hand, there are might exist exceptional sequences which converge to different…
We study isometric $G$-spaces and the question of when their maximal equivariant compactification is the Gromov compactification (meaning that it coincides with the compactification generated by the distance functions to points). Answering…
We establish limit theorems that describe the asymptotic local and global geometric behaviour of random enriched trees considered up to symmetry. We apply these general results to random unlabelled weighted rooted graphs and uniform random…
We introduce fibrewise compactifications in both the setting of locally compact Hausdorff spaces and continuous maps, and the parallel setting of $C^*$-algebras and nondegenerate multiplier-valued $*$-homomorphisms. In both situations, we…
In two seminal papers Kontsevich used a construction called_graph homology_ as a bridge between certain infinite dimensional Lie algebras and various topological objects, including moduli spaces of curves, the group of outer automorphisms…
Motivated by limits of critical inhomogeneous random graphs, we construct a family of sequences of measured metric spaces that we call continuous multiplicative graphs, that are expected to be the universal limit of graphs related to the…
We generalize ultraproducts and local-global limits of graphs to hypergraphs and other structures. We show that the local statistics of an ultraproduct of a sequence of hypergraphs are the ultralimits of the local statistics of the…
We describe all finite-dimensional pointed Hopf algebras whose infinitesimal braiding is a fixed Yetter-Drinfeld module decomposed as the sum of two simple objects: a point and the one of transpositions of the symmetric group in three…
Using the thermodynamics formalism, we introduce a notion of intersection for projective Anosov representations, show analyticity results for the intersection and the entropy, and rigidity results for the intersection. We use the…
Define f(n,p) to be the maximum number of edges in a graph on n vertices with p perfect matchings. Dudek and Schmitt proved there exist constants n_p and c_p so that for even n >= n_p, f(n,p) = (n^2)/4+c_p. A graph is p-extremal if it has p…
This article obtains purely metric counterparts of cornerstone results in the theory of embedding graphs into normed spaces. Our first main result is a metric analogue of Matou\v{s}ek's extrapolation relating the Poincar\'e constants…
One can describe isomorphism of two compact hyperbolic Riemann surfaces of the same genus by a measure-theoretic property: a chosen isomorphism of their fundamental groups corresponds to a homeomorphism on the boundary of the Poincar\'e…
We use Wagner's algorithm to estimate the number of periodic points of certain selfmaps on compact surfaces with boundary. When counting according to homotopy classes, we can use the asymptotic density to measure the size of sets of…
We derive simplified sphere-packing and Gilbert--Varshamov bounds for codes in the sum-rank metric, which can be computed more efficiently than previous ones. They give rise to asymptotic bounds that cover the asymptotic setting that has…
This paper studies infinite graphs produced from a natural unfolding operation applied to finite graphs. Graphs produced via such operations are of finite degree and automatic over the unary alphabet (that is, they can be described by…
Given a measure on the Thurston boundary of Teichmueller space, one can pick a geodesic ray joining some basepoint to a randomly chosen point on the boundary. Different choices of measures may yield typical geodesics with different…
Karo\'nski, {\L}uczak and Thomason conjectured in 2004 that for every finite graph without isolated edge, the edges can be assigned weights from $\{1,2,3\}$ in such a way that the endvertices of each edge have different sums of incident…