Maximal persistence in random clique complexes

DOI10.1007/S41468-023-00131-YWikidataQ121289468 ScholiaQ121289468MaRDI QIDQ6650232FDOQ6650232

Authors: Ayat Ababneh, Matthew Kahle 

Publication date: 6 December 2024

Published in: Journal of Applied and Computational Topology (Search for Journal in Brave)

Recommendations

• Maximally persistent cycles in random geometric complexes
• Topology of random clique complexes
• On persistent homology of random \v{C}ech complexes
• On the evolution of topology in dynamic clique complexes
• Collapsibility of random clique complexes

zbMATH Keywords

persistent homologyrandom graphs

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Persistent homology and applications, topological data analysis (55N31)

Cites Work

• Clique topology reveals intrinsic geometric structure in neural correlations
• Topology of random clique complexes
• Stability of persistence diagrams
• Ripser: efficient computation of Vietoris-Rips persistence barcodes
• Topological persistence and simplification
• Testing for high-dimensional geometry in random graphs
• Homological connectivity of random 2-complexes
• The probabilistic method
• Sharp vanishing thresholds for cohomology of random flag complexes
• Topology of random geometric complexes: a survey
• Spectral gaps of random graphs and applications
• Maximally persistent cycles in random geometric complexes
• Phase transitions for detecting latent geometry in random graphs

Cited In (1)

• Advances in random topology

This page was built for publication: Maximal persistence in random clique complexes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6650232)