Minimum spanning acycle and lifetime of persistent homology in the Linial-Meshulam process

preprint2015arXivOpen access

Abstract

This paper studies a higher dimensional generalization of Frieze's ζ(3)ζ(3)-limit theorem in the Erdös-Rényi graph process. Frieze's theorem states that the expected weight of the minimum spanning tree converges to ζ(3)ζ(3) as the number of vertices goes to infinity. In this paper, we study the dd-Linial-Meshulam process as a model for random simplicial complexes, where d=1d=1 corresponds to the Erdös-Rényi graph process. First, we define spanning acycles as a higher dimensional analogue of spanning trees, and connect its minimum weight to persistent homology. Then, our main result shows that the expected weight of the minimum spanning acycle behaves in O(nd−1)O(n^{d-1}).

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.