for example, we have a given graph of 3000 nodes, and we let every walk starts from node 19. Also max length of a walk is given, say 200 steps. Then how to guide the walk, so that every node on the graph is equally possible to be the end step of the walk.
I'm trying with some methods, but the result is not very bright. any ideas?
thanks in advance
/// Hi all, thanks for your replies first. Sorry for the incomplete description, I'm concerning the graph representation of social networks which usually follow "Power Law"/"Preferencial Attachment" rules, which gives a scale-free graph. yes it's connected and usually have some "hubs"(with high degree) and the diameter is not that big, say under 10. an example graph