4
$\begingroup$

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

  • 0
    That rather depends on your graph. Consider what happens if it's disconnected or has large diameter.2011-06-25
  • 0
    Do you have any more information to describe your graph? (As Yuval suggests, the answer depends on the graph you're thinking of. Is it connected, e.g.?, complete?... If you have a particular graph in mind, and can create an image file of it, you can click "edit" to add more info, and use the image link on the menu at the top to insert an image directly into your question. It would also be helpful to provide a little info about the methods you've tried...2011-06-26
  • 0
    Hi all, thanks for your replies first.2011-06-27

2 Answers 2