А.N. Tselykh , V. S. Vasilev , L.А. Tselykh , S.А. Barkovskii
163-173
2025-10-01
Abstract ▼
The article is devoted to solving the main inverse problem of spectral graph theory – determining the main parameters of a graph based on the spectrum of its eigenvalues. The article studies cognitive causal graph models of complex systems with unknown dynamics of variables. Non-stochastic graph models with non-numeric values of nodes and links, as well as poorly defined system factors are considered. In the absence of initial data, solving the inverse problem for a directed weighted signed graph is significantly complicated. When graphs have the same topology but different weights on arcs, their spectra form a set of fuzzy collinear vectors in the solution space. The straight lines of these vectors diverge in the vector space due to their directionality to different vertices. The article proposes to use an algorithm that allows one to accurately restore the weights of a cognitive graph when the conditional principal eigenvector and the topological structure of the adjacency matrix are known. This algorithm takes into account an important feature of the adjacency matrix of the graph - the direction of the main eigenvector to the target vertex, which allows finding the correct solution from a set of fuzzy collinear vectors in the solution space. To achieve complete restoration of the graph weights with acceptable accuracy, it is proposed to combine the graph spectrum and the effective control model with the combinatorial optimization problem. Restoring the adjacency matrix weights using our approach, we compare them with the given graph. The comparison takes into account such graph parameters as the graph spectrum, similarity coefficients of the restored matrix, response and control vectors
