Mathematics desk | ||
---|---|---|
< May 14 | << Apr | May | Jun >> | Current desk > |
Welcome to the Wikipedia Mathematics Reference Desk Archives |
---|
The page you are currently viewing is an archive page. While you can leave answers for any questions shown below, please ask new questions on one of the current reference desk pages. |
I initialize two entities, A and B, on distinct random nodes of a markov chain. Let f equal either, the number of steps before they meet; or the number of steps + 1/2, if they have switched spaces (if A == previous step B and B == previous step A), whichever comes first. What is the expected value of f? 67.51.100.10 ( talk) 04:12, 15 May 2015 (UTC)
Mathematics desk | ||
---|---|---|
< May 14 | << Apr | May | Jun >> | Current desk > |
Welcome to the Wikipedia Mathematics Reference Desk Archives |
---|
The page you are currently viewing is an archive page. While you can leave answers for any questions shown below, please ask new questions on one of the current reference desk pages. |
I initialize two entities, A and B, on distinct random nodes of a markov chain. Let f equal either, the number of steps before they meet; or the number of steps + 1/2, if they have switched spaces (if A == previous step B and B == previous step A), whichever comes first. What is the expected value of f? 67.51.100.10 ( talk) 04:12, 15 May 2015 (UTC)