Load balanced diffusive capture process on homophilic scale-free networks
Diffusive capture processes are known to be an effective method for information search on complex networks. The biased N lions–lamb model provides quick search time by attracting random walkers to high degree nodes, where most capture events take place. The price of the efficiency is extreme traffic concentration on top hubs. We propose traffic load balancing provided by type specific biased random walks. For that we introduce a multi-type scale-free graph generation model, which embeds homophily structure into the network by utilizing type dependent random walks. We show analytically and with simulations that by augmenting the biased random walk method with a simple type homophily rule, we can alleviate the traffic concentration on high degree nodes by spreading the load proportionally between hubs with different types of our generated multi-type scale-free topologies.
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Volume (Year): 392 (2013)
Issue (Month): 3 ()
|Contact details of provider:|| Web page: http://www.journals.elsevier.com/physica-a-statistical-mechpplications/|
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Gregory, Steve, 2012. "Ordered community structure in networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 391(8), pages 2752-2763.
- Lee, Sungmin & Yook, Soon-Hyung & Kim, Yup, 2007. "Diffusive capture processes for information search," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 385(2), pages 743-749.
- Saramäki, Jari & Kaski, Kimmo, 2004. "Scale-free networks generated by random walkers," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 341(C), pages 80-86.
- Firat, Aykut & Chatterjee, Sangit & Yilmaz, Mustafa, 2007. "Genetic clustering of social networks using random walks," Computational Statistics & Data Analysis, Elsevier, vol. 51(12), pages 6285-6294, August.
- Lynne Hamill & Nigel Gilbert, 2009. "Social Circles: A Simple Structure for Agent-Based Social Network Models," Journal of Artificial Societies and Social Simulation, Journal of Artificial Societies and Social Simulation, vol. 12(2), pages 1-3.
- Josep M. Pujol & Andreas Flache & Jordi Delgado & Ramon Sangüesa, 2005. "How Can Social Networks Ever Become Complex? Modelling the Emergence of Complex Networks from Local Social Exchanges," Journal of Artificial Societies and Social Simulation, Journal of Artificial Societies and Social Simulation, vol. 8(4), pages 1-12.
When requesting a correction, please mention this item's handle: RePEc:eee:phsmap:v:392:y:2013:i:3:p:510-519. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Dana Niculescu)
If references are entirely missing, you can add them using this form.