Priority diffusion model in lattices and complex networks

Abstract

We introduce a model for diffusion of two classes of particles ($A$ and $B$) with priority: where both species are present in the same site the motion of $A$'s takes precedence over that of $B$'s. This describes realistic situations in wireless and communication networks. In regular lattices the diffusion of the two species is normal but the $B$ particles are significantly slower, due to the presence of the $A$ particles. From the fraction of sites where the $B$ particles can move freely, which we compute analytically, we derive the diffusion coefficients of the two species. In heterogeneous networks the fraction of sites where $B$ is free decreases exponentially with the degree of the sites. This, coupled with accumulation of particles in high-degree nodes leads to trapping of the low priority particles in scale-free networks.

5 pages, 3 figures

References in corpus (6)

• Statistical mechanics of complex networks
• The structure and function of complex networks
• New Model of Internet Topology Using k-shell Decomposition
• MEDUSA - New Model of Internet Topology Using k-shell Decomposition
• Critical phenomena and universal dynamics in one-dimensional driven diffusive systems with two species of particles
• Phase Transition in Two Species Zero-Range Process

Cited by in corpus (4)

• Jamming transition in traffic flow under the priority queuing protocol
• Exact encounter times for many random walkers on regular and complex networks
• Detecting Structure of Complex Network by Quantum Bosonic Dynamics
• Random walk with priorities in communication-like networks