Timeline for Distance on Markov-chains/graphs and discrete Ricci-flow
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 18, 2017 at 23:03 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Dec 19, 2016 at 23:45 | comment | added | Delio Mugnolo | You may want to take a look at this answer: mathoverflow.net/questions/38305/similarity-of-weighted-graphs | |
| Dec 19, 2016 at 18:50 | history | edited | Chain12 | CC BY-SA 3.0 |
Clarified Graph/Markov chain terminology
|
| Dec 19, 2016 at 18:38 | comment | added | Chain12 | @NawafBou-Rabee : The graph G is G(V,E). The set of vertices V form the domain of Markov chain. I am using the usual correspondence: The transition matrix of the markov chain is given by the adjacency matrix of the graph. | |
| Dec 19, 2016 at 16:46 | review | First posts | |||
| Dec 19, 2016 at 16:53 | |||||
| Dec 19, 2016 at 16:44 | history | asked | Chain12 | CC BY-SA 3.0 |