Maximum likelihood threshold and generic completion rank of graphs

DOI10.1007/s00454-018-9990-3zbMath1405.14132arXiv1703.07849OpenAlexW2731821520MaRDI QIDQ1716000

Grigoriy Blekherman, Rainer Sinn

Publication date: 29 January 2019

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1703.07849

zbMATH Keywords

stressesmaximum likelihood estimationrigiditygraphical modelsgeneric ranksymmetric matrix completion

Mathematics Subject Classification ID

Real algebraic sets (14P05) Rigidity and flexibility of structures (aspects of discrete geometry) (52C25) Topology of real algebraic varieties (14P25) Graphical methods in statistics (62A09)

Related Items

The algebraic matroid of the finite unit norm tight frame (funtf) variety ⋮ Typical ranks in symmetric matrix completion ⋮ Typical and generic ranks in matrix completion

Uses Software

• HdBCS

Cites Work

• Geometry of maximum likelihood estimation in Gaussian graphical models
• Positive definite completions of partial Hermitian matrices
• On embeddability and stresses of graphs
• Positive semidefinite matrices with a given sparsity pattern
• Structural conditions for cycle completable graphs
• When is a bipartite graph a rigid framework?
• On the sparsity order of a graph and its deficiency in chordality
• The Schur complement and its applications
• Extremal bipartite matrices
• Sparse graphical models for exploring gene expression data
• Sharp lower and upper bounds for the Gaussian rank of a graph
• Completion of tree metrics and rank 2 matrices
• The maximum likelihood threshold of a graph
• The Gram Dimension of a Graph
• Small schemes and varieties of minimal degree
• Gram spectrahedra
• Joins and Intersections
• Do Sums of Squares Dream of Free Resolutions?
• Positive Gorenstein ideals
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item