View PDF HTML (experimental)

Abstract:We study generic $d$-dimensional rigidity in sparse random graphs. Our main result is that for every $d\ge 2$, the Erdős--Rényi random graph $G\sim G(n,c/n)$ undergoes a $d$-rigidity phase transition at the known, explicit, $d$-orientability threshold $c_d$: If $c<c_d$, then $G$ is asymptotically almost surely (a.a.s.) independent in the generic $d$-rigidity matroid. Moreover, in this regime $G$ has no linear-size rigidity components: it contains no induced $d$-rigid subgraphs with more than $3$ vertices, and the largest clique in its $d$-rigidity closure has size at most $o(\sqrt n)$. If $c>c_d$, then $G$ is a.a.s. not independent in the generic $d$-rigidity matroid, and we give a sharp asymptotic estimate for its rank. In addition, the $d$-rigidity closure of $G$ has a giant clique of linear size, which contains all but at most $o(n)$ vertices of the $((d+1)+d)$-core of the graph. More generally, we compute, up to a $1+o(1)$ factor, the generic $d$-rigidity rank of random graphs with a given degree distribution. For example, we show that the uniform $n$-vertex $k$-regular graph a.a.s. has rank $\min(k/2,d)n+o(n).$ Our approach is to estimate the rigidity rank of a random graph from its Galton--Watson local weak limit, using a parameter that we call {\em local flexibility}.

Submission history

From: Yuval Peled [view email]
[v1] Mon, 25 May 2026 11:12:42 UTC (49 KB)
[v2] Wed, 10 Jun 2026 09:46:53 UTC (50 KB)
[v3] Mon, 24 Aug 2026 13:52:17 UTC (50 KB)