Count number of intersections of many random walks in a graph -


i want run k random walks each node of connected un-directed graph length lambda. when 2 or more walks visit 1 node @ same time, combine 1 walk , continue single random walk until lambda steps finish. want know how many walks merged @ end of lambda steps or @ least know bound it.


Comments

Popular posts from this blog

android - InAppBilling registering BroadcastReceiver in AndroidManifest -

python Tkinter Capturing keyboard events save as one single string -

sql server - Why does Linq-to-SQL add unnecessary COUNT()? -