Maximum likelihood thresholds via graph rigidity

DOI10.1214/23-aap2039MaRDI QIDQ6591597

Daniel Irving Bernstein, Sean Dewar, Steven J. Gortler, Anthony Nixon, Sitharam, Meera, Louis Theran

Publication date: 22 August 2024

Published in: The Annals of Applied Probability (Search for Journal in Brave)

zbMATH Keywords

Gaussian graphical modelscombinatorial rigidityalgebraic statisticsnumber of observationsmaximum likelihood threshold

Mathematics Subject Classification ID

Estimation in multivariate analysis (62H12) Convex programming (90C25) Rigidity and flexibility of structures (aspects of discrete geometry) (52C25)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Geometry of maximum likelihood estimation in Gaussian graphical models
• Universal rigidity of complete bipartite graphs
• On bar frameworks, stress matrices and semidefinite programming
• Characterizing the universal rigidity of generic frameworks
• On embeddability and stresses of graphs
• Global rigidity: The effect of coning
• Rubber bands, convex embeddings and graph connectivity
• Rigidity and energy
• When is a bipartite graph a rigid framework?
• On the complexity of diagram testing
• Treewidth. Computations and approximations
• Hodge theory and the art of paper folding
• A proof of Connelly's conjecture on 3-connected circuits of the rigidity matroid.
• Über die Gliederung ebener Fachwerke.
• Maximum likelihood threshold and generic completion rank of graphs
• Sparse graphical models for exploring gene expression data
• Sudden emergence of a giant \(k\)-core in a random graph
• Generically globally rigid graphs have generic universally rigid frameworks
• Typical and generic ranks in matrix completion
• Sharp lower and upper bounds for the Gaussian rank of a graph
• The maximum likelihood threshold of a graph
• The maximum likelihood threshold of a path diagram
• Pebble game algorithms and sparse graphs
• Generic global rigidity
• On graphs and rigidity of plane skeletal structures
• The \(d\)-dimensional rigidity matroid of sparse graphs
• Uniqueness of Low-Rank Matrix Completion by Rigidity Theory
• Characterizing generic global rigidity
• Conditions for Unique Graph Realizations
• The Rigidity of Graphs
• Determinant Maximization with Linear Matrix Inequality Constraints
• The chromatic number of the plane is at least 5
• Affine Rigidity and Conics at Infinity
• Smooth points of a semialgebraic set
• Invariant Theory and Scaling Algorithms for Maximum Likelihood Estimation
• Algebraic Matroids in Action
• Generic Global Rigidity in Complex and Pseudo-Euclidean Spaces
• The Power of Convex Relaxation: Near-Optimal Matrix Completion
• The rigidity transition in random graphs
• On the dimension of a graph
• How to Draw a Graph
• The Algebraic Combinatorial Approach for Low-Rank Matrix Completion
• Convexity
• Sharp threshold for rigidity of random graphs
• Symmetries in directed Gaussian graphical models
• The Elements of Statistical Learning

Related Items (2)

Reconstructing a point set from a random subset of its pairwise distances ⋮ A bridge between invariant theory and maximum likelihood estimation

This page was built for publication: Maximum likelihood thresholds via graph rigidity