2000 character limit reached
A limit theorem for persistence diagrams of random filtered complexes built over marked point processes
Published 16 Mar 2021 in math.PR and math.AT | (2103.08868v1)
Abstract: We consider random filtered complexes built over marked point processes on Euclidean spaces. Examples of our filtered complexes include a filtration of $\check{\textrm{C}}$ech complexes of a family of sets with various sizes, growths, and shapes. We establish the law of large numbers for persistence diagrams as the size of the convex window observing a marked point process tends to infinity.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.