Work

Stability of correlation matrix completion fibers on chordal graphs

Year: 2026
Type: preprint
Abstract: The edge entries of a real correlation matrix determine a fiber of positive semidefinite completions. Within chordal graphs, these fibers are continuous in entrywise Hausdorff distance exactly for block graphs. On a block graph of clique order w and maximum component diameter D, the best uniform square-root constant K(G) is at most 2w1/4D, including for singular clique data. The exponent is sharp for noncomplete block graphs with an edge, and the two graph parameters are separately sharp. Branching trees of cliques give a joint lower bound of order (√D)w1/4 and rule out a universal additive bound. For connected block graphs on n vertices with w ≥ 2, ordering the vertices within each clique gives K(G) ≤ C[D + (w1/4 − 1) log n / log w]. Thus the additive bound holds for families of polynomial size in Dw, as it does for clique chains. For two cliques we identify the exact discontinuity locus, jump height, and optimal fixed-base exponents.
Author: Xu, Zihuan
Language: English
Open Access status: green
OpenAlex ID: W7236663757
Cites:
Cited by:
Related to: 10