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

Abstract

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.

11 pages, 4 figures. Submitted for publication

References in corpus (9)

• Reaction-diffusion processes and metapopulation models in heterogeneous networks
• First-passage times in complex scale-invariant media
• Exact solution for mean first-passage time on a pseudofractal scale-free web
• Occupation times of random walks in confined geometries: From random trap model to diffusion limited reactions
• Dynamics of Social Diversity
• Influences of degree inhomogeneity on average path length and random walks in disassortative scale-free networks
• How rare are diffusive rare events?
• Priority diffusion model in lattices and complex networks
• Random Walks on Complex Networks

Cited by in corpus (6)

• Encounter times in overlapping domains: application to epidemic spread in a population of territorial animals
• Statistics of diffusive encounters with a small target: Three complementary approaches
• Mean encounter times for multiple random walkers on networks
• Contact statistics in populations of noninteracting random walkers in two dimensions
• Mean first-encounter times of simultaneous random walkers with resetting on networks
• Random walk with priorities in communication-like networks