Stability of correlation matrix completion fibers on chordal graphs

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.

Authors

Institutions

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-19
DOI
https://doi.org/10.5281/zenodo.24362657
Primary Topic
Matrix Theory and Algorithms
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Stability of correlation matrix completion fibers on chordal graphs

Zihuan Xu
Zenodo (CERN European Organization for Nuclear Research)
Matrix Theory and Algorithms
preprint

Stability of correlation matrix completion fibers on chordal graphs

Zihuan Xu
preprint en

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.

Zenodo (CERN European Organization for Nuclear Research)
Capital Normal University (CN)
Matrix Theory and Algorithms
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon