Abstract
This paper studies a higher dimensional generalization of Frieze's -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 as the number of vertices goes to infinity. In this paper, we study the -Linial-Meshulam process as a model for random simplicial complexes, where 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 .
Connections
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 review
No reviews yet.
Discussion 0
Add a comment
No comments yet.