A threshold for relative hyperbolicity in random right-angled Coxeter groups
Jason Behrstock, Recep Altar Ciceksiz, Victor Falgas-Ravry

TL;DR
This paper identifies a critical edge probability threshold in Erdős–Rényi random graphs that determines when the associated right-angled Coxeter groups are relatively hyperbolic, and explores their divergence and random walk properties.
Contribution
It establishes the threshold at p=1/√n for relative hyperbolicity in random right-angled Coxeter groups and analyzes divergence and random walk behaviors in specific probability intervals.
Findings
p=1/√n is the threshold for relative hyperbolicity.
An interval of edge probabilities yields cubic divergence.
Random walks satisfy a central limit theorem within this interval.
Abstract
We consider the random right-angled Coxeter group whose presentation graph is an Erd{\H o}s--R\'enyi random graph on vertices with edge probability . We establish that is a threshold for relative hyperbolicity of the random group . As a key step in the proof, we determine the minimal number of pairs of generators that must commute in a right-angled Coxeter group which is not relatively hyperbolic, a result which is of independent interest. We also show that there is an interval of edge probabilities of width in which the random right-angled Coxeter group has precisely cubic divergence. This interval is between the thresholds for relative hyperbolicity (whence exponential divergence) and quadratic divergence. Moreover, a simple random walk on any Cayley graph of the random…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGeometric and Algebraic Topology · Topological and Geometric Data Analysis · Advanced Algebra and Geometry
