A limit theorem for persistence diagrams of random filtered complexes built over marked point processes

We consider random filtered complexes built over marked point processes on Euclidean spaces. Examples of our filtered complexes include a filtration of $\check{\text{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.