Multiple Independent random walks on same digraph

27 Views Asked by At

Consider $n$ individuals performing an independent random walk on the same digraph. For simplicity assume that the graph is strongly connected. What can we say regarding the expected number of individuals at a node?

For instance, if this were a single individual performing a random walk modeled by a discrete time Markov chain, the stationary distribution would be enough.

Do closed forms exist for multiple individuals when walks are modeled by Markov chains?

If not can a reference be provided for walks/graph classes for which they do exist?