Learning Bollobas-Riordan Graphs Under Partial Observability

This work examines the problem of learning the topology of a network (graph learning) from the signals produced at a subset of the network nodes (partial observability). This challenging problem was recently tackled assuming that the topology is drawn according to an Erdos-Renyi model, for which it was shown that graph learning under partial observability is achievable, exploiting in particular homogeneity across nodes and independence across edges. However, several real-world networks do not match the optimistic assumptions of homogeneity/independence, for example, high heterogeneity is often observed between very connected nodes (hubs) and scarcely connected peripheral nodes. Random graphs with preferential attachment were conceived to overcome these issues. In this work, we discover that, over first-order vector autoregressive systems with a stable Laplacian combination matrix, graph learning is achievable under partial observability, when the network topology is drawn according to a popular preferential attachment model known as the Bollobas-Riordan model.