Related papers: Random graphs, weak coarse embeddings, and higher …

A seminal result of Koml\'os, S\'ark\"ozy, and Szemer\'edi states that any n-vertex graph G with minimum degree at least (1/2 + {\alpha})n contains every n-vertex tree T of bounded degree. Recently, Pham, Sah, Sawhney, and Simkin extended…

Geometry can be used to explain many properties commonly observed in real networks. It is therefore often assumed that real networks, especially those with high average local clustering, live in an underlying hidden geometric space.…

The spectral density of random graphs with topological constraints is analysed using the replica method. We consider graph ensembles featuring generalised degree-degree correlations, as well as those with a community structure. In each case…

We show that a locally finite, connected graph has a coarse embedding into a Hilbert space if and only if there exist bond percolations with arbitrarily large marginals and two-point function vanishing at infinity. We further show that the…

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…

Classes with bounded expansion, which generalise classes that exclude a topological minor, have recently been introduced by Ne\v{s}et\v{r}il and Ossona de Mendez. These classes are defined by the fact that the maximum average degree of a…

We derive a sufficient condition for a sparse graph G on n vertices to contain a copy of a tree T of maximum degree at most d on (1-\epsilon)n vertices, in terms of the expansion properties of G. As a result we show that for fixed d\geq 2…

Hindman's celebrated Finite Sums Theorem, and its high-dimensional version due to Milliken and Taylor, are extended from covers of countable sets to covers of arbitrary topological spaces with Menger's classic covering property. The methods…

In this article we study a coarse version of the K-theoretic Farrell-Jones conjecture we call coarse or bounded isomorphism conjecture. With techniques that have already been used to prove the Farrell-Jones conjecture for hyperbolic groups…

Recently there has been increased interest in fitting generative graph models to real-world networks. In particular, Bl\"asius et al. have proposed a framework for systematic evaluation of the expressivity of random graph models. We extend…

In this paper, we deal with a notion of Banach space-valued mappings defined on a set consisting of finite graphs with uniformly bounded vertex degree. These functions will be endowed with certain boundedness and additivity criteria. We…

The number of embeddings of minimally rigid graphs in $\mathbb{R}^D$ is (by definition) finite, modulo rigid transformations, for every generic choice of edge lengths. Even though various approaches have been proposed to compute it, the gap…

For any fixed integer $R \geq 2$ we characterise the typical structure of undirected graphs with vertices $1, ..., n$ and maximum degree $R$, as $n$ tends to infinity. The information is used to prove that such graphs satisfy a labelled…

The $r$-expansion of a $k$-uniform hypergraph $H$, denoted by $H^{(+r)}$, is an $r$-uniform hypergraph obtained by enlarging each $k$-edge of $H$ with a set of $r-k$ vertices of degree one. The random Tur\'an number…

We show that the local weak limit of a sequence of finite expander graphs with uniformly bounded degree is an ergodic (or extremal) unimodular random graph. In particular, the critical probability of percolation of the limiting random graph…

Consider a uniform expanders family G_n with a uniform bound on the degrees. It is shown that for any p and c>0, a random subgraph of G_n obtained by retaining each edge, randomly and independently, with probability p, will have at most one…

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…

We study random digraphs on sequences of expanders with bounded average degree {which converge locally in probability}. We prove that the threshold for the existence of a giant strongly connected component, as well as the asymptotic…

We define notions of local topological convergence and local geometric convergence for embedded graphs in $\mathbb{R}^n,$ and study their properties. The former is related to Benjamini-Schramm convergence, and the latter to weak convergence…

We prove various obstructions to the existence of regular maps (or coarse embeddings) between commonly studied spaces. For instance, there is no regular map (or coarse embedding) $\mathbb H^n\to\mathbb H^{n-1}\times Y$ for $n\geq 3$, or…