JBCM627
Veteran
This has been bothering me for a while. I still can't think of any way to prove this, nor can I find a proof on the internet.
Prove (or disprove) for an arbitrary state map that nodes in a random walk are hit upon with the same probabilities as those in a non-backtracking random walk. Assume all nodes are connected to as least 2 others. Also assume that all possible paths from a node may be visited with equal probability.
If disproven, for what state maps are the probability distributions the same?
Prove (or disprove) for an arbitrary state map that nodes in a random walk are hit upon with the same probabilities as those in a non-backtracking random walk. Assume all nodes are connected to as least 2 others. Also assume that all possible paths from a node may be visited with equal probability.
If disproven, for what state maps are the probability distributions the same?
Last edited:
