Afra Zomorodian
ABSTRACT
We introduce the tidy set, a minimal simplicial set that captures the topology of a simplicial complex. The tidy set is particularly effective for computing the homology of clique complexes. This family of complexes include the Vietoris-Rips complex and the weak witness complex, methods that are popular in topological data analysis. The key feature of our approach is that it skips constructing the clique complex. We give algorithms for constructing tidy sets, implement them, and present experiments. Our preliminary results show that tidy sets are orders of magnitude smaller than clique complexes, giving us a homology engine with small memory requirements.
- Barmak, J., and Minian, E. Strong homotopy types, nerves and collapses, 2009. arXiv:0907.2954v1 {math.GT}.Google Scholar
- Carlsson, G., Ishkhanov, T., de Silva, V., and Zomorodian, A. On the local behavior of spaces of natural images. International Journal of Computer Vision 76, 1 (2008), 1--12. Google ScholarDigital Library
- Cazals, F., and Karande, C. Reporting maximal cliques: new insights into an old problem. Research Report 5642, INRIA, 2005.Google Scholar
- CHomP: Computational Homology Project. http://chomp.rutgers.edu.Google Scholar
- Civan, Y., and Yal¸cin, E. Linear colorings of simplicial complexes and collapsing. Journal of Combinatorial Theory Series A 114, 7 (2007), 1315--1331. Google ScholarDigital Library
- Collins, A., Zomorodian, A., Carlsson, G., and Guibas, L. A barcode shape descriptor for curve point cloud data. Computers and Graphics 28, 6 (2004), 881--894. Google ScholarDigital Library
- Cormen, T. H., Leiserson, C. E., Rivest, R. L., and Stein, C. Introduction to Algorithms, third ed. The MIT Press, Cambridge, MA, 2009. Google ScholarDigital Library
- Curtis, E. B. Simplicial homotopy theory. Advances in Mathematics 6 (1971), 107--209.Google ScholarCross Ref
- de Silva, V., and Carlsson, G. Topological estimation using witness complexes. In Proc. IEEE/Eurographics Symposium on Point-Based Graphics (2004), pp. 157--166. Google ScholarDigital Library
- Edelsbrunner, H., and Mucke, E. P. Three-dimensional alpha shapes. ACM Transactions on Graphics 13 (1994), 43--72. Google ScholarDigital Library
- Eilenberg, S., and Zilber, J. A. Semi-simplicial complexes and singular homology. Annals of Mathematics 51, 3 (1950), 499--513.Google ScholarCross Ref
- Giesen, J., and John, M. The flow complex: A data structure for geometric modeling. In Proc. Symposium on Discrete Algorithms (2003), pp. 285--294. Google ScholarDigital Library
- Goerss, P. G., and Jardine, J. F. Simplicial homotopy theory, vol. 174 of Progress in Mathematics. Birkhauser-Verlag, Basel, Switzerland, 1999.Google Scholar
- Gromov, M. Hyperbolic groups. In Essays in Group Theory, S. Gersten, Ed. Springer-Verlag, New York, NY, 1987, pp. 75--263.Google Scholar
- Hatcher, A. Algebraic Topology. Cambridge University Press, New York, NY, 2002. http://www.math.cornell.edu/~hatcher/AT/ATpage.html.Google Scholar
- Kaczynski, T., Mischaikow, K., and Mrozek, M. Computational Homology. Springer-Verlag, New York, NY, 2004.Google ScholarCross Ref
- Kasson, P. M., Zomorodian, A., Park, S., Singhal, N., Guibas, L. J., and Pande, V. S. Persistent voids: a new structural metric for membrane fusion. Bioinformatics 23, 14 (2007), 1753--1759. Google ScholarDigital Library
- Kozlov, D. Combinatorial Algebraic Topology. Springer-Verlag, New York, NY, 2008.Google ScholarCross Ref
- Matousek, J. LC reductions yield isomorphic simplicial complexes. Contributions to Discrete Mathematics 3, 2 (2008), 37--39.Google Scholar
- May, J. P. Simplicial Objects in Algebraic Topology. D. Van Nostrand Co., Inc., Princeton, NJ, 1967.Google Scholar
- Moon, J. W., and Moser, L. On cliques in graphs. Israel Journal of Mathematics 3, 1 (1965), 23--28.Google ScholarCross Ref
- Mrozek, M., Pilarczyk, P., and Zelazna, N. Homology algorithm based on acyclic subspace. Computers and Mathematics with Applications 55, 11 (2008), 2395--2412. Google ScholarDigital Library
- Munkres, J. R. Elements of Algebraic Topology. Addison-Wesley, Reading, MA, 1984.Google Scholar
- Perry, P. Application of simplicial sets to computational topology. Senior thesis, Stanford University, 2003.Google Scholar
- Pilarczyk, P. Computer assisted method for proving existence of periodic orbits. Topological Methods in Nonlinear Analysis 13 (1999), 365--377.Google ScholarCross Ref
- Sexton, H., and Johansson, M. V. JPlex, 2009. http://comptop.stanford.edu/programs/jplex/.Google Scholar
- Siek, J., Lee, L.-Q., and Lumsdaine, A. The Boost Graph Library: user guide and reference manual. Pearson Education, Inc., Upper Saddle River, NJ, 2002. Google ScholarDigital Library
- Storjohann, A. Near optimal algorithms for computing Smith normal forms of integer matrices. In Proc. International Conference on Symbolic and Algebraic Computation (1996), pp. 267--274. Google ScholarDigital Library
- Whitehead, J. H. C. Simplicial spaces, nuclei, and m-groups. Proceedings of the London Mathematical Society s2-45, 1 (1939), 243--327.Google ScholarCross Ref
- Yellin, D. M. Algorithms for subset testing and finding maximal sets. In Proc. ACM-SIAM Symposium on Discrete Algorithms (1992), pp. 386--392. Google ScholarDigital Library
- Zomorodian, A. Computational topology. In Algorithms and Theory of Computation Handbook, M. Atallah and M. Blanton, Eds., second ed., vol. 2. Chapman & Hall/CRC Press, Boca Raton, FL, 2010, ch. 3. Google ScholarDigital Library
- Zomorodian, A. Fast construction of the Vietoris-Rips complex. Computers & Graphics (2010). (To appear). Google ScholarDigital Library
- Zomorodian, A., and Carlsson, G. Computing persistent homology. Discrete & Computational Geometry 33, 2 (2005), 249--274. Google ScholarDigital Library
- Zomorodian, A., and Carlsson, G. Localized homology. Computational Geometry: Theory & Applications 41, 3 (2008), 126--148. Google ScholarDigital Library
Index Terms
- The tidy set: a minimal simplicial set for computing homology of clique complexes
Recommendations
Testing contractibility in planar rips complexes
SCG '08: Proceedings of the twenty-fourth annual symposium on Computational geometryThe (Vietoris-)Rips complex of a discrete point-set P is an abstract simplicial complex in which a subset of P defines a simplex if and only if the diameter of that subset is at most 1. We describe an efficient algorithm to determine whether a given ...
The simplex tree: an efficient data structure for general simplicial complexes
ESA'12: Proceedings of the 20th Annual European conference on AlgorithmsThis paper introduces a new data structure, called simplex tree, to represent abstract simplicial complexes of any dimension. All faces of the simplicial complex are explicitly stored in a trie whose nodes are in bijection with the faces of the complex. ...
Algorithmic complexity of finding cross-cycles in flag complexes
SoCG '12: Proceedings of the twenty-eighth annual symposium on Computational geometryA cross-cycle in a flag simplicial complex K is an induced subcomplex that is isomorphic to the boundary of a cross-polytope and that contains a maximal face of K. A cross-cycle is an efficient way to define a non-zero class in the homology of K. For an ...
Comments