Related papers: Connectivity for square percolation and coarse cub…
In their seminal paper introducing the theory of random graphs, Erd\H{o}s and R\'{e}nyi considered the evolution of the structure of a random subgraph of $K_n$ as the density increases from $0$ to $1$, identifying two key points in this…
A graph $G=(V,E)$ is called $d$-rigid if, for a generic embedding of its vertices in $\mathbb{R}^d$, every edge-length preserving continuous motion of the vertices preserves the distances between all pairs of non-adjacent vertices as well.…
We provide new connectivity results for {\em vertex-random graphs} or {\em random annulus graphs} which are significant generalizations of random geometric graphs. Random geometric graphs (RGG) are one of the most basic models of random…
We establish a spectral gap for stable commutator length (scl) of integral chains in right-angled Artin groups (RAAGs). We show that this gap is not uniform, i.e. there are RAAGs and integral chains with scl arbitrarily close to zero. We…
The main theme of this paper is higher virtual algebraic fibering properties of right-angled Coxeter groups (RACGs), with a special focus on those whose defining flag complex is a finite building. We prove for particular classes of finite…
Let $\Gamma$ be a graph product of finite groups, with finite underlying graph, and let $\Delta$ be the associated right-angled building. We prove that a uniform lattice $\Lambda$ in the cubical automorphism group Aut$(\Delta)$ is weakly…
Cameron, Manna and Mehatari investigated the question of which finite groups admit a power graph that is a cograph, also called power-cograph groups (Journal of Algebra 591 (2022)). They give a classification for nilpotent groups and…
A random geometric irrigation graph $\Gamma_n(r_n,\xi)$ has $n$ vertices identified by $n$ independent uniformly distributed points $X_1,\ldots,X_n$ in the unit square $[0,1]^2$. Each point $X_i$ selects $\xi_i$ neighbors at random, without…
For a Coxeter system $(W,S)$ let $a_n^{(W,S)}$ be the cardinality of the sphere of radius $n$ in the Cayley graph of $W$ with respect to the standard generating set $S$. It is shown that, if $(W,S)\preceq(W',S')$ then $a_n^{(W,S)}\leq…
A natural problem in combinatorial rigidity theory concerns the determination of the rigidity or flexibility of bar-joint frameworks in $\mathbb{R}^d$ that admit some non-trivial symmetry. When $d=2$ there is a large literature on this…
Simplicial complexes are gaining increasing scientific attention as they are generalized network structures that can represent the many-body interactions existing in complex systems raging from the brain to high-order social networks.…
We investigate certain structural properties of random interdependent networks. We start by studying a property known as $r$-robustness, which is a strong indicator of the ability of a network to tolerate structural perturbations and…
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 study Linial-Meshulam random 2-complexes, which are two-dimensional analogues of Erd\H{o}s-R\'enyi random graphs. We find the threshold for simple connectivity to be p = n^{-1/2}. This is in contrast to the threshold for vanishing of the…
This article discusses random hypergraphs with varying hyperedge sizes, admitting large hyperedges with size tending to infinity, and heavy-tailed limiting hyperedge size distributions. The main result describes a threshold for the random…
We use random matrix theory to study the spectrum of random geometric graphs, a fundamental model of spatial networks. Considering ensembles of random geometric graphs we look at short range correlations in the level spacings of the…
Global physical properties of random media change qualitatively at a percolation threshold, where isolated clusters merge to form one infinite connected component. The precise knowledge of percolation thresholds is thus of paramount…
Let (W,S) be a Coxeter system of finite rank (ie |S| is finite) and let A be the associated Coxeter (or Davis) complex. We study chains of pairwise parallel walls in A using Tits' bilinear form associated to the standard root system of…
We study the richness of the ensemble of graphical structures (i.e., unlabeled graphs) of the one-dimensional random geometric graph model defined by $n$ nodes randomly scattered in $[0,1]$ that connect if they are within the connection…
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…