Timeline for Approximate homology of a large simplicial complex
Current License: CC BY-SA 4.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 17, 2020 at 19:39 | history | edited | YCor | CC BY-SA 4.0 |
edited tags, removed capital in title
|
| Nov 28, 2018 at 17:41 | vote | accept | apg | ||
| Nov 28, 2018 at 17:38 | comment | added | apg | Ok I will look at mod p homology. I'm thinking of getting the Euler characteristic of the clique complex of a sparse complex network. | |
| Nov 28, 2018 at 1:36 | answer | added | alesia | timeline score: 3 | |
| Nov 27, 2018 at 20:23 | comment | added | Dima Pasechnik | You can do mod p homology computations on data of large size. It is a kind of approximation. | |
| Nov 27, 2018 at 19:13 | comment | added | apg | Surely some numerical approximation is available which is inaccurate but quick, converging in some limit to the actual situation? | |
| Nov 27, 2018 at 17:22 | comment | added | apg | I mean to get the Betti numbers, but only “nearly”. Some error is allowed. | |
| Nov 27, 2018 at 17:20 | comment | added | Neil Hoffman | Could you clarify what you mean by 'approximate' here? | |
| Nov 27, 2018 at 15:40 | review | Close votes | |||
| Nov 28, 2018 at 10:07 | |||||
| Nov 27, 2018 at 15:13 | history | asked | apg | CC BY-SA 4.0 |