Related papers: Random graphs, weak coarse embeddings, and higher …
Aboulker, Adler, Kim, Sintiari, and Trotignon conjectured that every graph with bounded maximum degree and large treewidth must contain, as an induced subgraph, a large subdivided wall, or the line graph of a large subdivided wall. This…
In this paper we derive results concerning the connected components and the diameter of random graphs with an arbitrary i.i.d. degree sequence. We study these properties primarily, but not exclusively, when the tail of the degree…
One of the main questions that arise when studying random and quasi-random structures is which properties P are such that any object that satisfies P "behaves" like a truly random one. In the context of graphs, Chung, Graham, and Wilson…
This research establishes that many real-world networks exhibit bounded expansion, a strong notion of structural sparsity, and demonstrates that it can be leveraged to design efficient algorithms for network analysis. We analyze several…
The main purpose of the paper is to find some expansion properties of locally finite metric spaces which do not embed coarsely into a Hilbert space. The obtained result is used to show that infinite locally finite graphs excluding a minor…
We study large uniform random maps with one face whose genus grows linearly with the number of edges. They can be seen as a model of discrete hyperbolic geometry. In the past, several of these hyperbolic geometric features have been…
In this paper, we connect the rigidity problem and the coarse Baum-Connes conjecture for Roe algebras. In particular, we show that if $X$ and $Y$ are two uniformly locally finite metric spaces such that their Roe algebras are…
We document some versions, in real K-theory, of well-known properties of the coarse assembly map in complex K-theory. These results are well-known, but difficult to find in the literature.
Let $\left( 1\to N_m\to G_m\to Q_m\to 1 \right)_{m\in \mathbb{N}}$ be a sequence of extensions of finite groups such that their coarse disjoint unions have bounded geometry. In this paper, we show that if the coarse disjoint unions of…
Given a hereditary graph property $\mathcal{P}$, consider distributions of random orderings of vertices of graphs $G\in\mathcal{P}$ that are preserved under isomorphisms and under taking induced subgraphs. We show that for many properties…
This work will appear as a chapter in a forthcoming volume titled "Topics in Probabilistic Graph Theory". A theory of scaling limits for random graphs has been developed in recent years. This theory gives access to the large-scale geometric…
We show that the classical Baum-Connes assembly map is quantitatively an isomorphism for a class of lacunary hyperbolic groups, and we explain how to see that this class contains many examples of groups that contain graph sequences of large…
We study the probabilistic convergence between the mapper graph and the Reeb graph of a topological space $\mathbb{X}$ equipped with a continuous function $f: \mathbb{X} \rightarrow \mathbb{R}$. We first give a categorification of the…
We prove a general large sieve statement in the context of random walks on subgraphs of a given graph. This can be seen as a generalization of previously known results where one performs a random walk on a group enjoying a strong spectral…
Asymptotic properties of random regular graphs are object of extensive study in mathematics. In this note we argue, based on theory of spin glasses, that in random regular graphs the maximum cut size asymptotically equals the number of…
In this paper we consider the problem of embedding almost-spanning, bounded degree graphs in a random graph. In particular, let $\Delta\geq 5$, $\varepsilon > 0$ and let $H$ be a graph on $(1-\varepsilon)n$ vertices and with maximum degree…
Given a (not necessarily discrete) proper metric space $M$ with bounded geometry, we define a groupoid $G(M)$. We show that the coarse Baum--Connes conjecture with coefficients, which states that the assembly map with coefficients for G(M)…
For a unimodular random graph $(G,\rho)$, we consider deformations of its intrinsic path metric by a (random) weighting of its vertices. This leads to the notion of the conformal growth exponent of $(G,\rho)$, which is the best asymptotic…
The Graph Reconstruction Conjecture famously posits that any undirected graph on at least three vertices is determined up to isomorphism by its family of (unlabeled) induced subgraphs. At present, the conjecture admits partial resolutions…
We consider constrained variants of graph homomorphisms such as embeddings, monomorphisms, full homomorphisms, surjective homomorpshims, and locally constrained homomorphisms. We also introduce a new variation on this theme which derives…