Rigid Components of Random Graphs

The planar rigidity problem asks, given a set of m pairwise distances among a set P of n unknown points, whether it is possible to reconstruct P, up to a finite set of possibilities (modulo rigid motions of the plane). The celebrated Maxwell-Laman Theorem from Rigidity Theory says that, generically, the rigidity problem has a combinatorial answer: the underlying combinatorial structure must contain a spanning minimally-rigid graph (Laman graph). In the case where the system is not rigid, its inclusion-wise maximal rigid substructures (rigid components) are also combinatorially characterized via the Maxwell-Laman theorem, and may be found efficiently. Physicists have used planar combinatorial rigidity has been used to study the phase transition between liquid and solid in network glasses. The approach has been to generate a graph via a stochastic process and then experimentally analyze its rigidity properties. Of particular interest is the size of the largest rigid components. In this paper, we study the emergence of rigid components in an Erdos-Renyi random graph G(n,p), using the parameterization p=c/n for a fixed constant c>0. Our first result is that for all c>0, almost surely all rigid components have size 2, 3 or Omega(n). We also show that for c>4, almost surely the largest rigid components have size at least n/10. While the G(n,p) model is simpler than those appearing in the physics literature, these results are the first of this type where the distribution is over all graphs on n vertices and the expected number of edges is O(n).

💡 Research Summary

The paper investigates the emergence of rigid components in the classical Erdős–Rényi random graph G(n, p) when the edge probability is scaled as p = c/n for a fixed constant c > 0. In planar rigidity theory, a set of distance constraints among n unknown points is rigid (i.e., determines the point configuration up to a finite set of congruences) precisely when the underlying graph contains a spanning minimally‑rigid subgraph, known as a Laman graph. When a graph is not globally rigid, its inclusion‑wise maximal rigid subgraphs—called rigid components—are also characterized by the Maxwell‑Laman conditions and can be found in polynomial time.

Physicists have long used combinatorial rigidity to model the liquid‑to‑solid transition in network glasses. Their approach typically generates a graph by a stochastic growth rule and then measures the size of the largest rigid component experimentally. However, those models are often tailored to specific physical processes and do not correspond to a uniform distribution over all n‑vertex graphs with O(n) edges.

The authors address this gap by analyzing G(n, p) with p = c/n, a model where the expected number of edges is Θ(n). Their first main theorem states that for every constant c > 0, with high probability (whp) every rigid component of G(n, p) has size either 2, 3, or Ω(n). In other words, there are no “medium‑sized” rigid components; the graph either contains only trivial rigid pieces (single edges or triangles) or a giant rigid component whose size is linear in n. The proof proceeds by first studying the 2‑core of the random graph (the maximal subgraph of minimum degree at least two). The existence of a linear‑size 2‑core is well‑known for c > 1, and the authors show that any rigid component of intermediate size would have to be contained entirely within this core. By applying the Maxwell‑Laman edge‑count condition (|E| = 2|V| − 3) together with concentration inequalities for the number of “critical edges” that turn a subgraph into a Laman graph, they demonstrate that such intermediate components are exponentially unlikely.

The second theorem sharpens the picture for larger densities: if c > 4, then whp the largest rigid component occupies at least a constant fraction (specifically n/10) of the vertices. The argument refines the previous analysis by estimating the expected number of edge additions that create new Laman subgraphs inside the 2‑core. For c > 4 this expectation grows linearly, and a martingale concentration argument shows that the actual number of such “critical edges” is tightly concentrated around its mean. Consequently, many overlapping Laman subgraphs appear, coalescing into a giant rigid component. The constant 1/10 is not optimal but suffices to demonstrate a linear‑size rigid component, establishing a clear rigidity phase transition at a constant edge density.

These results are the first rigorous proofs that a rigidity percolation phenomenon occurs in the Erdős–Rényi model with linear edge count. They confirm the physicists’ intuition that a threshold around average degree 4 separates a floppy regime from a rigid one, and they do so in a setting where the graph distribution is uniform over all n‑vertex graphs with Θ(n) edges. The paper also discusses algorithmic implications: because maximal rigid components can be extracted in polynomial time, the existence of a giant component implies that typical instances of the rigidity reconstruction problem become computationally hard only beyond the threshold, while below it the problem reduces to handling trivial components.

Finally, the authors outline several directions for future work. Extending the analysis to other random graph ensembles (e.g., random geometric graphs, hyperbolic random graphs) could bridge the gap between the abstract Erdős–Rényi setting and the spatially embedded networks used in materials science. Moreover, investigating higher‑dimensional rigidity (e.g., 3‑dimensional bar‑joint frameworks) may reveal analogous phase transitions with different critical densities. Overall, the paper provides a solid combinatorial foundation for rigidity percolation and opens a pathway for further interdisciplinary research between discrete mathematics, probability, and condensed‑matter physics.