On rigidity, orientability and cores of random graphs with sliders
Julien Barr\'e, Marc Lelarge, Dieter Mitsche

TL;DR
This paper investigates the emergence of giant rigid clusters in random graphs with sliders, revealing how the transition type depends on the fraction of freely moving points and introducing generalized concepts of cores and orientability.
Contribution
It introduces generalized notions of orientability and cores, determines thresholds for giant rigid components in graphs with sliders, and proves a conjecture about the 3+2-core size.
Findings
Giant rigid component threshold depends on fraction q of free points.
Transition is continuous for q ≤ 1/2 and discontinuous for q > 1/2.
Proves a conjecture about the size of the 3+2-core.
Abstract
Suppose that you add rigid bars between points in the plane, and suppose that a constant fraction of the points moves freely in the whole plane; the remaining fraction is constrained to move on fixed lines called sliders. When does a giant rigid cluster emerge? Under a genericity condition, the answer only depends on the graph formed by the points (vertices) and the bars (edges). We find for the random graph the threshold value of for the appearance of a linear-sized rigid component as a function of , generalizing results of Kasiviswanathan et al. We show that this appearance of a giant component undergoes a continuous transition for and a discontinuous transition for . In our proofs, we introduce a generalized notion of orientability interpolating between 1- and 2-orientability, of cores interpolating between 2-core and…
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
TopicsStructural Analysis and Optimization · Advanced Materials and Mechanics · Quasicrystal Structures and Properties
