Sampling from complex networks using distributed learning automata

A complex network provides a framework for modeling many real-world phenomena in the form of a network. In general, a complex network is considered as a graph of real world phenomena such as biological networks, ecological networks, technological networks, information networks and particularly social networks. Recently, major studies are reported for the characterization of social networks due to a growing trend in analysis of online social networks as dynamic complex large-scale graphs. Due to the large scale and limited access of real networks, the network model is characterized using an appropriate part of a network by sampling approaches. In this paper, a new sampling algorithm based on distributed learning automata has been proposed for sampling from complex networks. In the proposed algorithm, a set of distributed learning automata cooperate with each other in order to take appropriate samples from the given network. To investigate the performance of the proposed algorithm, several simulation experiments are conducted on well-known complex networks. Experimental results are compared with several sampling methods in terms of different measures. The experimental results demonstrate the superiority of the proposed algorithm over the others.

[1]  Mohammad Reza Meybodi,et al.  An adaptive mutation operator for artificial immune network using learning automata in dynamic environments , 2010, 2010 Second World Congress on Nature and Biologically Inspired Computing (NaBIC).

[2]  Jing Wang,et al.  Unbiased Sampling of Bipartite Graph , 2011, 2011 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery.

[3]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[4]  Christos Faloutsos,et al.  Sampling from large graphs , 2006, KDD '06.

[5]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[6]  Mohammad Reza Meybodi,et al.  Tracking Extrema in Dynamic Environments Using a Learning Automata-Based Immune Algorithm , 2010, FGIT-GDC/CA.

[7]  Donald F. Towsley,et al.  On Set Size Distribution Estimation and the Characterization of Large Networks via Sampling , 2012, IEEE Journal on Selected Areas in Communications.

[8]  Mark S Handcock,et al.  7. Respondent-Driven Sampling: An Assessment of Current Methodology , 2009, Sociological methodology.

[9]  Mark Huisman,et al.  Imputation of missing network data: Some simple procedures , 2009, J. Soc. Struct..

[10]  Jinjun Tang,et al.  Characterizing traffic time series based on complex network theory , 2013 .

[11]  Matthew J. Salganik,et al.  Assessing respondent-driven sampling , 2010, Proceedings of the National Academy of Sciences.

[12]  Javad Akbari Torkestani,et al.  A highly reliable and parallelizable data distribution scheme for data grids , 2013, Future Gener. Comput. Syst..

[13]  Hamid R. Rabiee,et al.  Characterizing Twitter with Respondent-Driven Sampling , 2011, 2011 IEEE Ninth International Conference on Dependable, Autonomic and Secure Computing.

[14]  Wolfgang A. Halang,et al.  Understanding the cascading failures in Indian power grids with complex networks theory , 2013 .

[15]  Mohammad Reza Meybodi,et al.  Finding minimum weight connected dominating set in stochastic graph based on learning automata , 2012, Inf. Sci..

[16]  Eric Gilbert,et al.  Predicting tie strength with social media , 2009, CHI.

[17]  Donald F. Towsley,et al.  Sampling directed graphs with random walks , 2012, 2012 Proceedings IEEE INFOCOM.

[18]  Rana Forsati,et al.  Effective Page Recommendation Algorithms Based on Distributed Learning Automata , 2009 .

[19]  Athina Markopoulou,et al.  On the bias of BFS (Breadth First Search) , 2010, 2010 22nd International Teletraffic Congress (lTC 22).

[20]  Kumpati S. Narendra,et al.  Learning automata - an introduction , 1989 .

[21]  Ann B. Lee,et al.  Diffusion maps and coarse-graining: a unified framework for dimensionality reduction, graph partitioning, and data set parameterization , 2006, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[22]  Nasser Yazdani,et al.  A Novel Community Detection Algorithm for Privacy Preservation in Social Networks , 2012, ISI.

[23]  Mohammad Reza Meybodi,et al.  Clustering the wireless Ad Hoc networks: A distributed learning automata approach , 2010, J. Parallel Distributed Comput..

[24]  Linyuan Lü,et al.  Coarse graining for synchronization in directed networks. , 2010, Physical review. E, Statistical, nonlinear, and soft matter physics.

[25]  Hawoong Jeong,et al.  Statistical properties of sampled networks. , 2005, Physical review. E, Statistical, nonlinear, and soft matter physics.

[26]  Athanasios V. Vasilakos,et al.  Albatross sampling: robust and effective hybrid vertex sampling for social graphs , 2011, HotPlanet '11.

[27]  Minas Gjoka,et al.  Walking on a graph with a magnifying glass: stratified sampling via weighted random walks , 2011, PERV.

[28]  Sen Hu,et al.  Research on spatial economic structure for different economic sectors from a perspective of a complex network , 2013 .

[29]  L. da F. Costa,et al.  Characterization of complex networks: A survey of measurements , 2005, cond-mat/0505185.

[30]  P. Cochat,et al.  Et al , 2008, Archives de pediatrie : organe officiel de la Societe francaise de pediatrie.

[31]  Minas Gjoka,et al.  Multigraph Sampling of Online Social Networks , 2010, IEEE Journal on Selected Areas in Communications.

[32]  Ove Frank,et al.  Survey sampling in networks , 2011 .

[33]  Athina Markopoulou,et al.  Towards Unbiased BFS Sampling , 2011, IEEE Journal on Selected Areas in Communications.

[34]  Michel L. Goldstein,et al.  Problems with fitting to the power-law distribution , 2004, cond-mat/0402322.

[35]  Mohammad Reza Meybodi,et al.  LACAIS: Learning Automata Based Cooperative Artificial Immune System for Function Optimization , 2010, IC3.

[36]  Mohammad Reza Meybodi,et al.  Sampling social networks using shortest paths , 2015 .

[37]  Nick Koudas,et al.  Sampling Online Social Networks , 2013, IEEE Transactions on Knowledge and Data Engineering.

[38]  Michael Garland,et al.  On the Visualization of Social and other Scale-Free Networks , 2008, IEEE Transactions on Visualization and Computer Graphics.

[39]  Shimon Even,et al.  Graph Algorithms , 1979 .

[40]  Tanya Y. Berger-Wolf,et al.  Sampling community structure , 2010, WWW '10.

[41]  Minas Gjoka,et al.  Walking in Facebook: A Case Study of Unbiased Sampling of OSNs , 2010, 2010 Proceedings IEEE INFOCOM.

[42]  Mohammad Reza Meybodi,et al.  Solving maximum clique problem in stochastic graphs using learning automata , 2012, 2012 Fourth International Conference on Computational Aspects of Social Networks (CASoN).

[43]  Colin Cooper,et al.  A Fast Algorithm to Find All High Degree Vertices in Graphs with a Power Law Degree Sequence , 2012, WAW.

[44]  Ziv Bar-Yossef,et al.  Random sampling from a search engine's index , 2006, WWW '06.

[45]  Donald F. Towsley,et al.  Estimating and sampling graphs with multidimensional random walks , 2010, IMC '10.

[46]  Mohammad Reza Meybodi,et al.  Utilizing Distributed Learning Automata to Solve Stochastic Shortest Path Problems , 2006, Int. J. Uncertain. Fuzziness Knowl. Based Syst..

[47]  M. Thathachar,et al.  Networks of Learning Automata: Techniques for Online Stochastic Optimization , 2003 .

[48]  Shou-De Lin,et al.  Semantically sampling in heterogeneous social networks , 2013, WWW '13 Companion.

[49]  Soon-Hyung Yook,et al.  Statistical properties of sampled networks by random walks. , 2007, Physical review. E, Statistical, nonlinear, and soft matter physics.

[50]  Sampling from complex networks with high community structures. , 2012, Chaos.

[51]  Sergey N. Dorogovtsev,et al.  K-core Organization of Complex Networks , 2005, Physical review letters.

[52]  Daniel Dajun Zeng,et al.  Modeling the growth of complex software function dependency networks , 2012, Inf. Syst. Frontiers.

[53]  Martin Suter,et al.  Small World , 2002 .

[54]  K. Goh,et al.  Fractality and self-similarity in scale-free networks , 2007 .

[55]  Erik M. Volz,et al.  Probability based estimation theory for respondent driven sampling , 2008 .

[56]  Xin Xu,et al.  Beyond random walk and metropolis-hastings samplers: why you should not backtrack for unbiased graph sampling , 2012, SIGMETRICS '12.

[57]  Maytham Safar,et al.  Estimation algorithm for counting periodic orbits in complex social networks , 2012, Information Systems Frontiers.