Topology Discovery of Sparse Random Graphs With Few Participants

Animashree Anandkumar, Avinatan Hassidim, Jonathan Kelner

We consider the task of topology discovery of sparse random graphs using end-to-end random measurements (e.g., delay) between a subset of nodes, referred to as the participants. Th…