Timeline for Probability of first return to starting vertex in Random walk on regular finite graph
Current License: CC BY-SA 3.0
9 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Apr 13, 2017 at 12:58 | history | edited | CommunityBot |
replaced http://mathoverflow.net/ with https://mathoverflow.net/
|
|
Aug 28, 2011 at 7:05 | vote | accept | Chris | ||
Aug 26, 2011 at 8:23 | comment | added | Chris | Aaron Meyerowitz: thanks for the comment. I am interested in probability of first return at $t$. Only for $d=2$ this is only non-zero for $2t$, you are right, fixed it. The graphs I want are finite of size $k$, wrapped borders, and $d-regular$ with small $d$. Does this make it clear? | |
Aug 26, 2011 at 8:20 | history | edited | Chris | CC BY-SA 3.0 |
Changed 2t to t in general.
|
Aug 26, 2011 at 0:54 | answer | added | Did | timeline score: 1 | |
Aug 25, 2011 at 23:44 | history | edited | Gjergji Zaimi |
edited tags; edited tags
|
|
Aug 25, 2011 at 23:38 | answer | added | Brendan McKay | timeline score: 3 | |
Aug 25, 2011 at 16:59 | comment | added | Aaron Meyerowitz | You need to be more specific about which graphs you want. The first return could happen at an odd step. The graph can be regular but have different statistics for each possible starting vertex. | |
Aug 25, 2011 at 16:01 | history | asked | Chris | CC BY-SA 3.0 |