Distributed computation of homology using harmonics

We present a distributed algorithm to compute the first homology of a simplicial complex. Such algorithms are very useful in topological analysis of sensor networks, such as its coverage properties. We employ spanning trees to compute a basis for algebraic 1-cycles, and then use harmonics to efficiently identify the contractible and homologous cycles. The computational complexity of the algorithm is $O(|P|^\omega)$, where $|P|$ is much smaller than the number of edges, and $\omega$ is the complexity order of matrix multiplication. For geometric graphs, we show using simulations that $|P|$ is very close to the first Betti number.

[1]  Vin de Silva,et al.  HOMOLOGICAL SENSOR NETWORKS , 2005 .

[2]  Primoz Skraba,et al.  Zigzag persistent homology in matrix multiplication time , 2011, SoCG '11.

[3]  Hamid Krim,et al.  Divide and Conquer: Localizing Coverage Holes in Sensor Networks , 2010, 2010 7th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks (SECON).

[4]  R. Ho.  Algebraic Topology , 2022 .

[5]  Steven M. LaValle,et al.  Tracking hidden agents through shadow information spaces , 2008, 2008 IEEE International Conference on Robotics and Automation.

[6]  Hamid Krim,et al.  Topological Fidelity in Sensor Networks , 2011, ArXiv.

[7]  J. Dall,et al.  Random geometric graphs. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.

[8]  Claude-Pierre Jeannerod,et al.  LSP matrix decomposition revisited LSP Matrix Decomposition Revisited LSP Matrix Decomposition Revisited , 2006 .

[9]  Oscar H. Ibarra,et al.  A Generalization of the Fast LUP Matrix Decomposition Algorithm and Applications , 1982, J. Algorithms.

[10]  Erin W. Chambers,et al.  Vietoris–Rips Complexes of Planar Point Sets , 2009, Discret. Comput. Geom..

[11]  Jeff Erickson,et al.  Greedy optimal homotopy and homology generators , 2005, SODA '05.

[12]  Chao Chen,et al.  Annotating Simplices with a Homology Basis and Its Applications , 2011, SWAT.

[13]  Vishnu Navda,et al.  Efficient gathering of correlated data in sensor networks , 2008, TOSN.

[14]  Alireza Tahbaz-Salehi,et al.  Distributed coverage verification in sensor networks without location information , 2008, 2008 47th IEEE Conference on Decision and Control.

[15]  J. Stillwell.  Classical topology and combinatorial group theory , 1980 .

[16]  Yuan Yao,et al.  Statistical ranking and combinatorial Hodge theory , 2008, Math. Program..

[17]  Franck Hétroy,et al.  Constructive Mayer-Vietoris Algorithm: Computing the Homology of Unions of Simplicial Complexes , 2010 .

[18]  Gunnar E. Carlsson,et al.  Topology and data , 2009 .

[19]  Vin de Silva,et al.  Coordinate-free Coverage in Sensor Networks with Controlled Boundaries via Homology , 2006, Int. J. Robotics Res..

[20]  David Kempe,et al.  A decentralized algorithm for spectral analysis , 2008, J. Comput. Syst. Sci..

[21]  Ananthram Swami,et al.  Simplifying the homology of networks via strong collapses , 2013, 2013 IEEE International Conference on Acoustics, Speech and Signal Processing.

[22]  G. Heo,et al.  Topological Analysis of Variance and the Maxillary Complex , 2012 .

[23]  Abubakr Muhammad,et al.  Coverage and hole-detection in sensor networks via homology , 2005, IPSN 2005. Fourth International Symposium on Information Processing in Sensor Networks, 2005..

[24]  Steven M. LaValle,et al.  Probabilistic shadow information spaces , 2010, 2010 IEEE International Conference on Robotics and Automation.

[25]  A. Jadbabaie,et al.  Decentralized Computation of Homology Groups in Networks by Gossip , 2007, 2007 American Control Conference.

[26]  Jennifer Gamble,et al.  Exploring uses of persistent homology for statistical analysis of landmark-based shape data , 2010, J. Multivar. Anal..

[27]  Hamid Krim,et al.  Detection and tracking of systematic time-evolving failures in sensor networks , 2011, 2011 4th IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing (CAMSAP).

[28]  Konstantin Mischaikow,et al.  Morse Theory for Filtrations and Efficient Computation of Persistent Homology , 2013, Discret. Comput. Geom..

[29]  Wenyuan Xu,et al.  Jamming sensor networks: attack and defense strategies , 2006, IEEE Network.

[30]  Pierre A. Humblet,et al.  A Distributed Algorithm for Minimum-Weight Spanning Trees , 1983, TOPL.

[31]  Magnus Egerstedt,et al.  Control Using Higher Order Laplacians in Network Topologies , 2006 .

[32]  Pawel Dlotko,et al.  Distributed computation of coverage in sensor networks by homological methods , 2012, Applicable Algebra in Engineering, Communication and Computing.

[33]  Mathew D. Penrose,et al.  Random Geometric Graphs , 2003 .