Timeline for Persistence barcodes and spectral sequences
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 20, 2016 at 20:46 | comment | added | rhl | I guess, in direct answer to the question, the differentials in the persistent setting are just essentially connecting homomorphisms, since the usual treatment is with inclusion maps. There isn't much to "speedup" here, as in order to "compute the map" you need to write down the output for each input. I suppose the only thing to do is observe when an output must be zero. Although, I don't think there is any hope for this. | |
| Mar 20, 2016 at 20:43 | comment | added | rhl | @ViditNanda ah, yes. I guess they do mention the correspondence in the paper. Nevertheless the direct application to a parallel algorithm is not, although, pretty straightforward. | |
| Mar 19, 2016 at 15:08 | comment | added | Vidit Nanda | Hi Ryan (nice to see you on here!). Just a quick comment about your first paragraph: as Mark points out, Carlsson and Zomorodian explicitly mention the connection with spectral sequences in Section 1.4 of their paper. | |
| Mar 19, 2016 at 0:41 | history | edited | rhl | CC BY-SA 3.0 |
deleted 59 characters in body
|
| Mar 16, 2016 at 22:34 | review | Late answers | |||
| Mar 16, 2016 at 23:27 | |||||
| Mar 16, 2016 at 22:18 | history | answered | rhl | CC BY-SA 3.0 |