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

In this paper, the first of a series of two, we continue the study of higher index theory for expanders. We prove that if a sequence of graphs is an expander and the girth of the graphs tends to infinity, then the coarse Baum-Connes…

In this paper, the second of a series of two, we continue the study of higher index theory for expanders. We prove that if a sequence of graphs has girth tending to infinity, then the maximal coarse Baum-Connes assembly map is an…

We introduce a new variant of the coarse Baum-Connes conjecture designed to tackle coarsely disconnected metric spaces called the boundary coarse Baum-Connes conjecture. We prove this conjecture for many coarsely disconnected spaces that…

We introduce a notion of fibred coarse embedding into Hilbert space for metric spaces, which is a generalization of Gromov's notion of coarse embedding into Hilbert space. It turns out that a large class of expander graphs admit such an…

In this paper, we employ quotients of Roe algebras as index containers for elliptic differential operators to study the existence problem of Riemannian metrics with positive scalar curvature on non-compact complete Riemannian manifolds. The…

We bound the volume of thick embeddings of finite graphs into the Heisenberg group, as well as the volume of coarse wirings of finite graphs into groups with polynomial growth. This work follows the work of Kolmogorov-Brazdin, Gromov-Guth…

We exhibit a finitely generated group $G$ and a sequence of finite index normal subgroups $N_n\trianglelefteq G$ such that for every finite generating subset $S\subseteq G$, the sequence of finite Cayley graphs $(G/N_n, S)$ does not…

In this article, we introduce the notion of a functor on coarse spaces being coarsely excisive- a coarse analogue of the notion of a functor on topological spaces being excisive. Further, taking cones, a coarsely excisive functor yields a…

Menger's theorem is an important building block of numerous results in the study of graph structure. We consider a variant in terms of coarse geometry. We say that a set of graphs has the weak coarse Menger property if there exist functions…

We study in this paper the maximal version of the coarse Baum-Connes assembly map for families of expanding graphs arising from residually finite groups. Unlike for the usual Roe algebra, we show that this assembly map is closely related to…

Let $X$ be a discrete metric space with bounded geometry. We show that if $X$ admits an "A-by-CE coarse fibration", then the canonical quotient map $\lambda: C^*_{\max}(X)\to C^*(X)$ from the maximal Roe algebra to the Roe algebra of $X$,…

We show that for any fixed dense graph G and bounded-degree tree T on the same number of vertices, a modest random perturbation of G will typically contain a copy of T . This combines the viewpoints of the well-studied problems of embedding…

In this paper, we introduce a notion of stable coarse algebras for metric spaces with bounded geometry, and formulate the twisted coarse Baum--Connes conjecture with respect to stable coarse algebras. We prove permanence properties of this…

We prove estimates for the optimal volume of thick embeddings of finite graphs into symmetric spaces, generalising results of Kolmogorov-Barzdin and Gromov-Guth for embeddings into Euclidean spaces. We distinguish two very different…

In this paper, we introduce a notion of twisted Roe algebra and a twisted coarse Baum-Connes conjecture with coefficients. We will study the basic properties of twisted Roe algebras, including a coarse analogue of the imprimitivity theorem…

We quantify the topological expansion properties of bounded degree simplicial complexes in terms of a family of sublinear functions, in analogy with the separation profile of Benjamini-Schramm-Tim\'ar for classical expansion of bounded…

Graph vertex embeddings based on random walks have become increasingly influential in recent years, showing good performance in several tasks as they efficiently transform a graph into a more computationally digestible format while…

Menger's theorem tells us that if $S,T$ are sets of vertices in a graph $G$, then (for $k\ge0$) either there are $k+1$ vertex-disjoint paths between $S$ and $T$, or there is a set of $k$ vertices separating $S$ and $T$. But what if we want…

Given a dense countable set in a metric space, the infinite random geometric graph is the random graph with the given vertex set and where any two points at distance less than 1 are connected, independently, with some fixed probability. It…

Expander graphs, due to their mixing properties, are useful in many algorithms and combinatorial constructions. One can produce an expander graph with high probability by taking a random graph (e.g., the union of $d$ random bijections for a…