Sharp threshold for rigidity of random graphs
From MaRDI portal
Publication:6135068
DOI10.1112/blms.12740zbMath1519.05221arXiv2202.09917MaRDI QIDQ6135068
Yuval Peled, Alan Lew, Eran Nevo, Orit E. Raz
Publication date: 23 August 2023
Published in: Bulletin of the London Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2202.09917
Random graphs (graph-theoretic aspects) (05C80) Planar graphs; geometric and topological aspects of graph theory (05C10) Rigidity and flexibility of structures (aspects of discrete geometry) (52C25)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The rigidity of graphs. II
- An algorithm for two-dimensional rigidity percolation: The pebble game
- Integral homology of random simplicial complexes
- Sudden emergence of a giant \(k\)-core in a random graph
- Sufficient conditions for the global rigidity of graphs
- Pebble game algorithms and sparse graphs
- Generic global rigidity
- On graphs and rigidity of plane skeletal structures
- The 2-dimensional rigidity of certain families of graphs
- Characterizing generic global rigidity
- On Generic Rigidity in the Plane
- Rigidity Matroids
- Conditions for Unique Graph Realizations
- The Rigidity of Graphs
- The Rigidity of Frameworks: Theory and Applications
- On rigidity, orientability, and cores of random graphs with sliders
- Paths in graphs
- Rigidity of Random Subgraphs and Eigenvalues of Stiffness Matrices
- The rigidity transition in random graphs
- A new approach to the orientation of random hypergraphs
This page was built for publication: Sharp threshold for rigidity of random graphs