In this work we consider the problem of learning an Erdös-Rényi graph over a diffusion network when: i) data from only a limited subset of nodes are available (partial observation); ii) and the ...

Let G = (V, E) be an undirected graph, where V is the vertex set and E is the edge set. A subset M of E is an induced matching of G if M is a matching of G and no two edges in M are joined by an edge.