Return probabilities and hitting times of random walks on sparse Erdös-Rényi graphs.
We consider random walks on random graphs, focusing on return probabilities and hitting times for sparse Erdös-Rényi graphs. Using the tree approach, which is expected to be exact in the large graph limit, we show how to solve for the distribution of these quantities and we find that these distributions exhibit a form of self-similarity.
Martin
O C
OC
Université Paris-Sud, CNRS, LPTMS, UMR 8626, Orsay F-91405, France.
Sulc
P
P
D000465:Algorithms; D003198:Computer Simulation; D003627:Data Interpretation, Statistical; D015233:Models, Statistical