arXiv (All)
open access
On the Rigidity of Random Graphs in high-dimensional spaces
We study the maximum dimension $d=d(n,p)$ for which an Erdős-Rényi $G(n,p)$ random graph is $d$-rigid. Our main results reveal two different regimes of rigidity in $G(n,p)$ separated at $p_c=C_*\log n/n,~C_*=2/(1-\log 2)$ -- the point where the graph's minimum degree exceeds half its average degree.
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Optimal detection of geometry in random graphs and kernel matrices at critical thresholds#1326522
- First-Order Laws for Random Geometric Graphs on the Torus#1062130
- The threshold for online balancing of i.i.d. binary vectors#1084877
- Error Estimates for Hyperbolic Scaling Limits of Linear Kinetic Models on Networks#1049770
- An edge-spectral Erdős-Stone-Simonovits theorem and its stability#1357034
Record · ID 1200741
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive