Exact encounter times for many random walkers on regular and complex networks

Details Exact encounter times for many random walkers on regular and complex networks Exact encounter times for many random walkers on regular and complex networks

2009-06-04

arxiv.org/abs/0906.0810v1

Physics

Condensed Matter

Statistical Mechanics

11 pages, 4 figures. Submitted for publication

Scientific paper

The exact mean time between encounters of a given particle in a system consisting of many particles undergoing random walks in discrete time is calculated, on both regular and complex networks. Analytical results are obtained both for independent walkers, where any number of walkers can occupy the same site, and for walkers with an exclusion interaction, when no site can contain more than one walker. These analytical results are then compared with numerical simulations, showing very good agreement.

Affiliated with

Also associated with

No associations

Rating

Exact encounter times for many random walkers on regular and complex networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Exact encounter times for many random walkers on regular and complex networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Exact encounter times for many random walkers on regular and complex networks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-493976