ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1306.1158
57
3

Distributed computation of homology using harmonics

5 June 2013
H. Chintakunta
Hamid Krim
ArXiv (abs)PDFHTML
Abstract

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∣ω)O(|P|^\omega)O(∣P∣ω), where ∣P∣|P|∣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∣|P|∣P∣ is very close to the first Betti number.

View on arXiv
Comments on this paper