Timeline for Persistent homology of Markovian dynamical systems
Current License: CC BY-SA 4.0
12 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
S Apr 26 at 5:30 | history | suggested | The Amplitwist | CC BY-SA 4.0 |
fixed broken link to Wikipedia
|
Apr 26 at 5:10 | review | Suggested edits | |||
S Apr 26 at 5:30 | |||||
Apr 26 at 5:09 | comment | added | The Amplitwist |
The link to hamilton.nuigalway.ie in a previous comment seems to be broken, but a copy is saved on the Wayback Machine
|
|
May 13, 2020 at 21:09 | history | edited | YCor | CC BY-SA 4.0 |
added persistent homology tag (first ever MO question on the subject!), fixed Wikipedia link
|
Aug 4, 2013 at 20:33 | vote | accept | Steve Huntsman | ||
Aug 4, 2013 at 20:30 | vote | accept | Steve Huntsman | ||
Aug 4, 2013 at 20:32 | |||||
Aug 4, 2013 at 17:43 | answer | added | Vidit Nanda | timeline score: 5 | |
Aug 3, 2013 at 17:22 | comment | added | Steve Huntsman | @Vidit Nanda: $|\mathcal{M}|$ is the cardinality of $\mathcal{M}$. $[n] := \{1,\dots,n\}$. This is standard (if perhaps not common) usage AFAIK. | |
Aug 3, 2013 at 15:48 | comment | added | Vidit Nanda | I realize this comment comes rather late given when you asked the question, but what on earth is $[|\mathcal{M}|]$? Do you just want to build the flag complex on the graph represented by the transition matrix? | |
Jan 29, 2012 at 18:04 | comment | added | Joseph O'Rourke | Marian Mrozek seems to be an expert in this general area. E.g., see the talk slides, "Computational homology in dynamical systems." hamilton.nuigalway.ie/DeBrunCentre/SecondWorkshop/… | |
Jan 29, 2012 at 14:34 | history | edited | Steve Huntsman | CC BY-SA 3.0 |
added 127 characters in body; deleted 6 characters in body
|
Jan 29, 2012 at 14:26 | history | asked | Steve Huntsman | CC BY-SA 3.0 |