Persistence diagram for a clique complex

[Nilsmiz]

Hi everybody,

I have seen a ton of codes to compute a persistence diagram when the input data is a point cloud. Is there a way to compute the persistence diagram for a filtration of a clique complex if the input data is a weighted graph? It cannot be done with the Ripser library right? Any code would be very much appreciated.

Thank you.

[ctralie]

You may want to check out phat for this for the time being: https://pythonhosted.org/phat/

…

On Fri, Nov 6, 2020 at 3:44 PM Nilsmiz ***@***.***> wrote: Hi everybody, I have seen a ton of codes to compute a persistence diagram when the input data is a point cloud. Is there a way to compute the persistence diagram for a filtration of a clique complex if the input data is a weighted graph? It cannot be done with the Ripser library right? Any code would be very much appreciated. Thank you. — You are receiving this because you are subscribed to this thread. Reply to this email directly, view it on GitHub <#16>, or unsubscribe <https://github.com/notifications/unsubscribe-auth/AAJWDZVLLQNGUQTCCI3RQJTSORN4JANCNFSM4TND5LEQ> .