MatrixCompletionwithHierarchical GraphSideInformation

First wecharacterize theinformation-theoretic sharp threshold on the minimum number of observed matrix entries required for reliable matrix completion, as a function of the quantified quality (to be detailed) of the considered hierarchical graph side information.