Skip to main content
11 events
when toggle format what by license comment
Feb 18, 2011 at 6:25 comment added user3881 @Suresh: my input is actually from a physical real-world system and the distribution can be even continuous. So I only have a PDF of hitting times. How many vertices are used for the graph is e.g. one problem. I am looking then for a graph that so that the random walk on this graph results in a hitting times PDF that approximates the physical system.
Feb 18, 2011 at 6:22 comment added user3881 @mhum: yes with simple random walk I mean that a neighbor is visited uniformly depending on vertex degree.
Feb 18, 2011 at 1:09 answer added Joe Fitzsimons timeline score: 6
Feb 18, 2011 at 0:22 history edited Kaveh
edited tags
Feb 17, 2011 at 21:43 comment added mhum I think neither the input nor the output of this problem is quite clear yet.
Feb 17, 2011 at 21:16 comment added Suresh Venkat I guess I'm not clear what the input is then. Is it a hitting distribution for each vertex ?
Feb 17, 2011 at 21:08 comment added Jukka Suomela @Suresh: But if you can have arbitrary transition probabilities (i.e., you do not choose a neighbour uniformly at random), isn't the problem trivial (in particular, if you can have self-loops)?
Feb 17, 2011 at 21:03 comment added Suresh Venkat @Jukka But there's a two dimensional parameter space to work with (the transitions from 1-2 and 2-1)
Feb 17, 2011 at 20:45 comment added Jukka Suomela Consider the simplest possible case: you have just two nodes. There are very many discrete probability distributions but very few graphs...
Feb 17, 2011 at 16:25 comment added mhum By "simple random", do you mean a random walk on a graph where each neighbor is visited uniformly at random?
Feb 17, 2011 at 10:13 history asked user3881 CC BY-SA 2.5