Computing maximum likelihood thresholds using graph rigidity

DOI10.2140/astat.2023.14.287MaRDI QIDQ6578647

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

Publication date: 25 July 2024

Published in: Algebraic Statistics (Search for Journal in Brave)

zbMATH Keywords

Gaussian graphical modelcombinatorial rigiditygraph rigiditymaximum likelihood thresholdgeneric completion rank

Mathematics Subject Classification ID

Estimation in multivariate analysis (62H12) Rigidity and flexibility of structures (aspects of discrete geometry) (52C25) Statistics on algebraic and topological structures (62Rxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Geometry of maximum likelihood estimation in Gaussian graphical models
• Rigidity of multi-graphs. I: Linking rigid bodies in n-space
• Maximum likelihood threshold and generic completion rank of graphs
• A note on generic rigidity of graphs in higher dimension
• Generically globally rigid graphs have generic universally rigid frameworks
• Sufficient conditions for the global rigidity of graphs
• The maximum likelihood threshold of a graph
• Generic global rigidity
• The \(d\)-dimensional rigidity matroid of sparse graphs
• Characterizing generic global rigidity
• The Rigidity of Graphs
• Affine Rigidity and Conics at Infinity
• Frameworks with Coordinated Edge Motions
• Flexible circuits in the d‐dimensional rigidity matroid

This page was built for publication: Computing maximum likelihood thresholds using graph rigidity