Im stuck with the random walk. I tried to simulate the random on a graph but my graph consists of nbrVertex/2 components. So it is very sparse.
1- Does the random walk is suitable to such kind of graph?
What should i want to add to get the random walk be suitable to my graph? Does if add edges between very pairs of nodes with very small wait can help?
2- Suppose I added edges between nodes to make the graph strongly connected. On the latter, i execute the random walk, the difference between the old and the new vectors (p(t+1)-p(t)) still decreases (as it should be) till the iteration 10 and after they go to increases? DOES this means something? how can I interpret that?