Rigidity of Random Subgraphs and Eigenvalues of Stiffness Matrices

DOI10.1137/20M1349849zbMATH Open1498.05242OpenAlexW4297320041MaRDI QIDQ5043640FDOQ5043640

Shin-Ichi Tanigawa, Tibor Jordán

Publication date: 6 October 2022

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/20m1349849

zbMATH Keywords

eigenvalueLaplacianrandom subgraphstiffness matrixrigid graph

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Random graphs (graph-theoretic aspects) (05C80) Eigenvalues, singular values, and eigenvectors (15A18) Random matrices (algebraic aspects) (15B52) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40) Rigidity and flexibility of structures (aspects of discrete geometry) (52C25)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Exact matrix completion via convex optimization
• Eigenvalues and expanders
• User-friendly tail bounds for sums of random matrices
• Generalized inverses. Theory and applications.
• On graphs and rigidity of plane skeletal structures
• Characterizing generic global rigidity
• A proof of the molecular conjecture
• Graph Sparsification by Effective Resistances
• The Union of Matroids and the Rigidity of Frameworks
• Second-Order Rigidity and Prestress Stability for Tensegrity Frameworks
• Rigidity of multi-graphs. I: Linking rigid bodies in n-space
• A proof of Alon’s second eigenvalue conjecture and related problems
• Old and new results on algebraic connectivity of graphs
• First-order infinitesimal mechanisms
• Sufficient conditions for the global rigidity of graphs
• The 2-dimensional rigidity of certain families of graphs
• Uniform Sampling for Matrix Approximation
• The Giant Component in a Random Subgraph of a Given Graph
• Frameworks, Tensegrities, and Symmetry
• Uniqueness of infinite rigid components in percolation models: the case of nonplanar lattices
• <scp>Almost‐Rigidity</scp> of Frameworks
• Existence and uniqueness of infinite components in generic rigidity percolation
• Uniqueness in two-dimensional rigidity percolation
• The rigidity transition in random graphs

Cited In (4)

• On the \(d\)-dimensional algebraic connectivity of graphs
• Geometric, algebraic and topological combinatorics. Abstracts from the workshop held December 10--15, 2023
• Reconstructing a point set from a random subset of its pairwise distances
• Sharp threshold for rigidity of random graphs

This page was built for publication: Rigidity of Random Subgraphs and Eigenvalues of Stiffness Matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5043640)