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-Rényi 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 Bollobás-Riordan model.

Learning bollobás-riordan graphs under partial observability

Cirillo M.;Matta V.;
2021

Abstract

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-Rényi 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 Bollobás-Riordan model.
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: http://hdl.handle.net/11386/4782330
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 1
  • ???jsp.display-item.citation.isi??? 0
social impact