Random walk with priorities in communicationlike networks

Bastas, Nikolaos; Maragakis, Michalis; Argyrakis, Panos; Ben-Avraham, Daniel; Havlin, Shlomo; Carmi, Shai
We study a model for a random walk of two classes of particles (A and B). Where both species are present in the same site, the motion of A’s takes precedence over that of B’s. The model was originally proposed and analyzed in Maragakis et al., Phys. Rev. E 77, 020103 (2008); here we provide additional results. We solve analytically the diffusion coefficients of the two species in lattices for a number of protocols. In networks, we find that the probability of a B particle to be free decreases exponentially with the node degree. In scale-free networks, this leads to localization of the B’s at the hubs and arrest of their motion. To remedy this, we investigate several strategies to avoid trapping of the B’s: moving an A instead of the hindered B; allowing a trapped B to hop with a small probability; biased walk towards non-hub nodes; and limiting the capacity of nodes. We obtain analytic results for lattices and networks, and discuss the advantages and shortcomings of the possible strategies. PACS
Research areas:
Year:
2013
Type of Publication:
Article
Journal:
Physical Review E
Volume:
88
Number:
2
Pages:
022803
Month:
August
ISSN:
1539-3755
DOI:
10.1103/PhysRevE.88.022803
Hits: 2976

We use cookies to improve our website and your experience when using it. Cookies used for the essential operation of this site have already been set. To find out more about the cookies we use and how to delete them, see our privacy policy.

  I accept cookies from this site.
EU Cookie Directive Module Information