Timeline for Degree of regularity of a Markov chain
Current License: CC BY-SA 4.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 1, 2021 at 10:18 | comment | added | nir shahar | This would be something well known in the literature of graphs, but i don't know how useful it is in the literature of markov chains | |
| Apr 1, 2021 at 10:16 | comment | added | nir shahar | If im not mistaken this is the diameter of the graph representing the merkov chain | |
| Apr 1, 2021 at 6:28 | comment | added | Erik M | @D.W. Yes I suppose so. I’m wondering if this notion has already been established in the literature. I’d like to read up on it if so. | |
| Apr 1, 2021 at 6:27 | comment | added | D.W.♦ | Sounds like you've just defined such a notion. Is there something you want to know about it? | |
| Apr 1, 2021 at 1:19 | comment | added | nir shahar | This would precisely capture the length of the longest path between all shortest paths in the markov chain graph | |
| Mar 31, 2021 at 18:22 | history | asked | Erik M | CC BY-SA 4.0 |