A threshold for relative hyperbolicity in random right-angled Coxeter groups (Q6889821)

The paper studies right-angled Coxeter groups \(W_\Gamma\) whose presentation graph \(\Gamma\) is an Erdős-Rényi random graph \(\mathcal G_{n,p}\). After recalling the graph-theoretic notion of thickness (which for RACG characterizes failure of relative hyperbolicity), the authors prove a sharp probabilistic threshold phenomenon around \(p\asymp 1/\sqrt n\).\N\NTheorem~1.1 shows that if \(p \le \tfrac{1}{4\sqrt{n\log n}}\) then \(W_\Gamma\) is a.a.s.\ relatively hyperbolic, while for \(p\ge c/\sqrt n\) (with explicit constants arising from the combinatorics) \(W_\Gamma\) is a.a.s.\ not relatively hyperbolic.\N\NTheorem~1.2 exhibits an interval of width \(\Omega(1/\sqrt n)\) in which the random RACG has cubic divergence and hence polynomial divergence of degree \(3\). A corollary yields a central limit theorem for the simple random walk on Cayley graphs in that regime.\N\NA key deterministic ingredient is Theorem 1.4: Any finite graph that is thick has at least \(2|V|-4\) edges and this extremal bound is used together with delicate first/second moment and branching-process arguments to control component supports in the auxiliary \(T_k\) graphs.