Computing maximum likelihood thresholds using graph rigidity

DOI10.2140/ASTAT.2023.14.287MaRDI QIDQ6578647zbMATH OpenFDO

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

Publication date 25 July 2024

Published in Algebraic Statistics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2140/ASTAT.2023.14.287

zbMATH Keywords

combinatorial rigidityGaussian graphical modelgeneric completion rankgraph rigiditymaximum likelihood threshold

Mathematics Subject Classification ID

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

Cites work

• A note on generic rigidity of graphs in higher dimension
• Affine rigidity and conics at infinity
• Characterizing generic global rigidity
• Flexible circuits in the d‐dimensional rigidity matroid
• Frameworks with Coordinated Edge Motions
• Generic global rigidity
• Generically globally rigid graphs have generic universally rigid frameworks
• Geometry of maximum likelihood estimation in Gaussian graphical models
• scientific article; zbMATH DE number 3868113 (Why is no real title available?)
• scientific article; zbMATH DE number 1134987 (Why is no real title available?)
• scientific article; zbMATH DE number 952952 (Why is no real title available?)
• Maximum likelihood threshold and generic completion rank of graphs
• Rigidity of multi-graphs. I: Linking rigid bodies in n-space
• Sufficient conditions for the global rigidity of graphs
• The d-dimensional rigidity matroid of sparse graphs
• The maximum likelihood threshold of a graph
• The Rigidity of Graphs

Cited in

(4)

• Pseudolikelihood estimators for graphical models: existence and uniqueness
• Entropic covariance models
• Maximum likelihood thresholds of generic linear concentration models
• Maximum likelihood thresholds of Gaussian graphical models and graphical lasso

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

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