Ababneh, Ayat, and Kahle, Matthew. Maximal persistence in random clique complexes. Retrieved from https://par.nsf.gov/biblio/10553912. Journal of Applied and Computational Topology 8.6 Web. doi:10.1007/s41468-023-00131-y.

Ababneh, Ayat, & Kahle, Matthew. Maximal persistence in random clique complexes. Journal of Applied and Computational Topology, 8 (6). Retrieved from https://par.nsf.gov/biblio/10553912. https://doi.org/10.1007/s41468-023-00131-y

Ababneh, Ayat, and Kahle, Matthew. "Maximal persistence in random clique complexes". Journal of Applied and Computational Topology 8 (6). Country unknown/Code not available: Journal of Applied and Computational Topology. https://doi.org/10.1007/s41468-023-00131-y. https://par.nsf.gov/biblio/10553912.

@article{osti_10553912,
place = {Country unknown/Code not available}, title = {Maximal persistence in random clique complexes}, url = {https://par.nsf.gov/biblio/10553912}, DOI = {10.1007/s41468-023-00131-y}, abstractNote = {We study the maximal persistence of an Erdős–Rényi random clique complex filtration on n vertices.}, journal = {Journal of Applied and Computational Topology}, volume = {8}, number = {6}, publisher = {Journal of Applied and Computational Topology}, author = {Ababneh, Ayat and Kahle, Matthew}, }