Connectivity for square percolation and coarse cubical rigidity in random right-angled Coxeter groups
Abstract
We consider random right-angled Coxeter groups, , whose presentation graph is taken to be an Erd\H{o}s--R\'enyi random graph, i.e., . We use techniques from probabilistic combinatorics to establish several new results about the geometry of these random groups. We resolve a conjecture of Susse and determine the connectivity threshold for square percolation on the random graph . We use this result to determine a large range of for which the random right-angled Coxeter group has a unique cubical coarse median structure. Until recent work of Fioravanti, Levcovitz and Sageev, there were no non-hyperbolic examples of groups with cubical coarse rigidity; our present results show the property is in fact typically satisfied by a random RACG for a wide range of the parameter , including .
Cite
@article{arxiv.2502.18165,
title = {Connectivity for square percolation and coarse cubical rigidity in random right-angled Coxeter groups},
author = {Jason Behrstock and R. Altar Ciceksiz and Victor Falgas-Ravry},
journal= {arXiv preprint arXiv:2502.18165},
year = {2025}
}
Comments
23 pages, 4 Figures