Compressive sensing over graphs

In this paper, motivated by network inference and tomography applications, we study the problem of compressive sensing for sparse signal vectors over graphs. In particular, we are interested in recovering sparse vectors representing the properties of the edges from a graph. Unlike existing compressive sensing results, the collective additive measurements we are allowed to take must follow connected paths over the underlying graph. For a sufficiently connected graph with n nodes, it is shown that, using O(k log(n)) path measurements, we are able to recover any k-sparse link vector (with no more than k nonzero elements), even though the measurements have to follow the graph path constraints. We mainly show that the computationally efficient ℓ1 minimization can provide theoretical guarantees for inferring such k-sparse vectors with O(k log(n)) path measurements from the graph.

[1]  Amin Karbasi,et al.  Graph-constrained group testing , 2010, ISIT.

[2]  Yao Zhao,et al.  Towards Unbiased End-to-End Network Diagnosis , 2006, IEEE/ACM Transactions on Networking.

[3]  Nick Feamster,et al.  Detecting BGP configuration faults with static analysis , 2005 .

[4]  Donald F. Towsley,et al.  Network tomography on general topologies , 2002, SIGMETRICS '02.

[5]  Walter Willinger,et al.  Spatio-temporal compressive sensing and internet traffic matrices , 2009, SIGCOMM '09.

[6]  Nick G. Duffield,et al.  Network Tomography of Binary Network Performance Characteristics , 2006, IEEE Transactions on Information Theory.

[7]  Emmanuel J. Candès,et al.  Decoding by linear programming , 2005, IEEE Transactions on Information Theory.

[8]  Jon M. Kleinberg,et al.  Detecting a Network Failure , 2004, Internet Math..

[9]  Michael G. Rabbat,et al.  Compressed network monitoring for ip and all-optical networks , 2007, IMC '07.

[10]  Yan Chen,et al.  Algebra-Based Scalable Overlay Network Monitoring: Algorithms, Evaluation, and Applications , 2007, IEEE/ACM Transactions on Networking.

[11]  Sergio Verdú,et al.  Fundamental limits of almost lossless analog compression , 2009, 2009 IEEE International Symposium on Information Theory.

[12]  Patrick Thiran,et al.  Using End-to-End Data to Infer Lossy Links in Sensor Networks , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[13]  Yonggang Wen,et al.  Non-Adaptive Fault Diagnosis for All-Optical Networks via Combinatorial Group Testing on Graphs , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[14]  Robert Nowak,et al.  Internet tomography , 2002, IEEE Signal Process. Mag..

[15]  Paramvir Bahl,et al.  Troubleshooting multihop wireless networks , 2005, SIGMETRICS '05.

[16]  E.J. Candes.  Compressive Sampling , 2022 .

[17]  Pablo A. Parrilo,et al.  Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization , 2007, SIAM Rev..

[18]  Marwan Krunz,et al.  SRLG Failure Localization in All-Optical Networks Using Monitoring Cycles and Paths , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

[19]  Patrick Thiran,et al.  The Boolean Solution to the Congested IP Link Location Problem: Theory and Practice , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[20]  WillingerWalter,et al.  Spatio-temporal compressive sensing and internet traffic matrices , 2009 .

[21]  Weiyu Xu,et al.  Efficient Compressive Sensing with Deterministic Guarantees Using Expander Graphs , 2007, 2007 IEEE Information Theory Workshop.

[22]  Yonggang Wen,et al.  Efficient fault-diagnosis algorithms for all-optical WDM networks with probabilistic link failures , 2005, Journal of Lightwave Technology.

[23]  Ari Trachtenberg,et al.  Identifying Codes and Covering Problems , 2008, IEEE Transactions on Information Theory.

[24]  David L. Donoho,et al.  High-Dimensional Centrally Symmetric Polytopes with Neighborliness Proportional to Dimension , 2006, Discret. Comput. Geom..

[25]  Michael Rabbat,et al.  Compressed Network Monitoring , 2007, 2007 IEEE/SP 14th Workshop on Statistical Signal Processing.

[26]  Amin Karbasi,et al.  Graph-Constrained Group Testing , 2010, IEEE Transactions on Information Theory.

[27]  Piotr Indyk,et al.  Combining geometry and combinatorics: A unified approach to sparse signal recovery , 2008, 2008 46th Annual Allerton Conference on Communication, Control, and Computing.

[28]  R. Nowak,et al.  Compressed Sensing for Networked Data , 2008, IEEE Signal Processing Magazine.