Generalized solution to the problem of reconstructing the graph structure based on the transfer function matr ix

Abstract

This study presents a generalized solution to the problem of restoring the structure of a graph based on the method of minimizing the transfer matrix norm, consistent with the Euclidean vector norms, with a minimum and extended set of constraints. The problem of complete reconstruction of the adjacency matrix, in the presence of pairs of vectors of exogenous and endogenous influences, expressing the intrinsic resonance properties of the network, and positive semidefinite constraints on the matrix of variables, is a generalization of the problem of reconstructing the structure of a graph from the eigenvalues of the Laplace matrix.