From the Intel forums the answer appears to be "no": software.intel.com/en-us/forums/topic/282588

@blz At least for my case, a collision meant the walker stayed in place for that iteration, instead of moving, if I recall correctly. I don't think there's any special optmization but be sure to benchmark your random number generator :-)

@blz Yes, you got the idea. I remember it being slow as hell for many iterations (about 10^7 back when I did it). I was in college then, so I could just submit a job to a HPC cluster instead of running it on my laptop. If you're in a research setting, you probably have access to a similar resource. I'd send you my paper but it's in Portuguese...

If you add n "random walkers" to a n random start nodes, make them move to a random neighboor each time step, count how many times each node are 'touched' by a random walker after (many) iterations, you're probably going to have something close to what you want. I did something like that to find tortuosity of a porous media back in college. Google for 'random walker'