Reconstructing a graph from path traces

This paper considers the problem of inferring the structure of a network from indirect observations. Each observation (a “trace”) is the unordered set of nodes which are activated along a path through the network. Since a trace does not convey information about the order of nodes within the path, there are many feasible orders for each trace observed, and thus the problem of inferring the network from traces is, in general, ill-posed. We propose and analyze an algorithm which inserts edges by ordering each trace into a path according to which pairs of nodes in the path co-occur most frequently in the observations. When all traces involve exactly 3 nodes, we derive necessary and sufficient conditions for the reconstruction algorithm to exactly recover the graph. Finally, for a family of random graphs, we present expressions for reconstruction error probabilities (false discoveries and missed detections).

[1]  Béla Bollobás,et al.  Random Graphs: Notation , 2001 .

[2]  Tetsunao Matsuta,et al.  国際会議開催報告:2013 IEEE International Symposium on Information Theory , 2013 .

[3]  Alan M. Frieze,et al.  Random graphs , 2006, SODA '06.

[4]  Jing Yang,et al.  Passive learning of the interference graph of a wireless network , 2012, 2012 IEEE International Symposium on Information Theory Proceedings.

[5]  Dongxiao Zhu,et al.  Optimal structural inference of signaling pathways from unordered and overlapping gene sets , 2012, Bioinform..

[6]  Mark S. Granovetter.  The Strength of Weak Ties , 1973, American Journal of Sociology.

[7]  Jure Leskovec,et al.  Inferring networks of diffusion and influence , 2010, KDD.

[8]  Sally L. Wood,et al.  Understanding the topology of a telephone network via internally-sensed network tomography , 2005, Proceedings. (ICASSP '05). IEEE International Conference on Acoustics, Speech, and Signal Processing, 2005..

[9]  E. David,et al.  Networks, Crowds, and Markets: Reasoning about a Highly Connected World , 2010 .

[10]  O. Sporns,et al.  Mapping the Structural Core of Human Cerebral Cortex , 2008, PLoS biology.

[11]  Sriram Vishwanath,et al.  Learning Markov graphs up to edit distance , 2012, 2012 IEEE International Symposium on Information Theory Proceedings.

[12]  Rebecca Willett,et al.  Hypergraph-Based Anomaly Detection of High-Dimensional Co-Occurrences , 2009, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[13]  Robert D. Nowak,et al.  Network Inference From Co-Occurrences , 2006, IEEE Transactions on Information Theory.

[14]  Paul Erdös,et al.  On random graphs, I , 1959 .