Sampling algorithms for stochastic graphs: A learning automata approach

Stochastic graph as a graph model for complex social networks.Four sampling algorithms for stochastic graphs in which edge weights are random variables.Analyze complex networks using stochastic network measures and sampling algorithms.Study the performance of the sampling algorithms on the stochastic networks. Recently, there has been growing interest in social network analysis. Graph models for social network analysis are usually assumed to be a deterministic graph with fixed weights for its edges or nodes. As activities of users in online social networks are changed with time, however, this assumption is too restrictive because of uncertainty, unpredictability and the time-varying nature of such real networks. The existing network measures and network sampling algorithms for complex social networks are designed basically for deterministic binary graphs with fixed weights. This results in loss of much of the information about the behavior of the network contained in its time-varying edge weights of network, such that is not an appropriate measure or sample for unveiling the important natural properties of the original network embedded in the varying edge weights. In this paper, we suggest that using stochastic graphs, in which weights associated with the edges are random variables, can be a suitable model for complex social network. Once the network model is chosen to be stochastic graphs, every aspect of the network such as path, clique, spanning tree, network measures and sampling algorithms should be treated stochastically. In particular, the network measures should be reformulated and new network sampling algorithms must be designed to reflect the stochastic nature of the network. In this paper, we first define some network measures for stochastic graphs, and then we propose four sampling algorithms based on learning automata for stochastic graphs. In order to study the performance of the proposed sampling algorithms, several experiments are conducted on real and synthetic stochastic graphs. The performances of these algorithms are studied in terms of Kolmogorov-Smirnov D statistics, relative error, Kendall's rank correlation coefficient and relative cost.

[1]  Alireza Rezvanian,et al.  A fast algorithm for overlapping community detection , 2016, 2016 Eighth International Conference on Information and Knowledge Technology (IKT).

[2]  Chuan Zhou,et al.  Big social network influence maximization via recursively estimating influence spread , 2016, Knowl. Based Syst..

[3]  Ciro Cattuto,et al.  What's in a crowd? Analysis of face-to-face behavioral networks , 2010, Journal of theoretical biology.

[4]  Mohammad Reza Meybodi,et al.  Solving Minimum Vertex Cover Problem Using Learning Automata , 2013, ArXiv.

[5]  Mark E. J. Newman.  A measure of betweenness centrality based on random walks , 2005, Soc. Networks.

[6]  B. Bollobás.  The evolution of random graphs , 1984 .

[7]  Xiang Lin,et al.  A cellular learning automata based algorithm for detecting community structure in complex networks , 2015, Neurocomputing.

[8]  Athanasios V. Vasilakos,et al.  Understanding user behavior in online social networks: a survey , 2013, IEEE Communications Magazine.

[9]  Masoud Asadpour,et al.  An efficient agent-based algorithm for overlapping community detection using nodes’ closeness , 2013 .

[10]  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.

[11]  M. Friedman.  A Comparison of Alternative Tests of Significance for the Problem of $m$ Rankings , 1940 .

[12]  Fei Hao,et al.  k-Cliques mining in dynamic social networks based on triadic formal concept analysis , 2016, Neurocomputing.

[13]  Mohammad Reza Meybodi,et al.  An approach for designing cognitive engines in cognitive peer-to-peer networks , 2016, J. Netw. Comput. Appl..

[14]  Yanchi Liu,et al.  Community detection in graphs through correlation , 2014, KDD.

[15]  Jiwon Hong,et al.  A community-based sampling method using DPL for online social networks , 2011, Inf. Sci..

[16]  Mohammad Reza Meybodi,et al.  Distributed Learning Automata based Algorithm for Solving Maximum Clique Problem in Stochastic Graphs , 2013 .

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

[18]  M E J Newman,et al.  Community structure in social and biological networks , 2001, Proceedings of the National Academy of Sciences of the United States of America.

[19]  Mohammad Reza Meybodi,et al.  LADE: Learning Automata Based Differential Evolution , 2015, Int. J. Artif. Intell. Tools.

[20]  H. Ishii,et al.  Confidence regional method of stochastic spanning tree problem , 1995 .

[21]  Chong Wu,et al.  Towards Cost-efficient Sampling Methods , 2014, ArXiv.

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

[23]  Mohammad Reza Meybodi,et al.  Service level agreement based adaptive Grid superscheduling , 2016, Future Gener. Comput. Syst..

[24]  P. Erdos,et al.  On the evolution of random graphs , 1984 .

[25]  Ann Q. Gates,et al.  TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING , 2005 .

[26]  Mohammad Reza Meybodi,et al.  Extended distributed learning automata , 2014, Applied Intelligence.

[27]  Mohammad Reza Meybodi,et al.  Distributed learning automata-based algorithm for community detection in complex networks , 2016 .

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

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

[30]  Javad Akbari Torkestani.  DEGREE-CONSTRAINED MINIMUM SPANNING TREE PROBLEM IN STOCHASTIC GRAPH , 2012, Cybern. Syst..

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

[32]  L. D. Dhinesh Babu,et al.  A fuzzy adaptive resonance theory inspired overlapping community detection method for online social networks , 2016, Knowl. Based Syst..

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

[34]  Mohammad Reza Meybodi,et al.  Mobility-based multicast routing algorithm for wireless mobile Ad-hoc networks: A learning automata approach , 2010, Comput. Commun..

[35]  Maoguo Gong,et al.  A memetic algorithm for computing and transforming structural balance in signed networks , 2015, Knowl. Based Syst..

[36]  Tore Opsahl,et al.  Clustering in weighted networks , 2009, Soc. Networks.

[37]  Mohammad Reza Meybodi,et al.  Sampling algorithms for weighted networks , 2016, Social Network Analysis and Mining.

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

[39]  Mohammad Reza Meybodi,et al.  A new learning automata‐based sampling algorithm for social networks , 2017, Int. J. Commun. Syst..

[40]  Christos Faloutsos,et al.  Graph evolution: Densification and shrinking diameters , 2006, TKDD.

[41]  Mohammad Reza Meybodi,et al.  Link prediction based on temporal similarity metrics using continuous action set learning automata , 2016 .

[42]  Stephen P. Borgatti,et al.  Centrality and network flow , 2005, Soc. Networks.

[43]  Marko Bajec,et al.  Sampling promotes community structure in social and information networks , 2015, ArXiv.

[44]  Mohammad Reza Meybodi,et al.  Social network sampling using spanning trees , 2016 .

[45]  Mohammad Reza Meybodi,et al.  Finding Maximum Clique in Stochastic Graphs Using Distributed Learning Automata , 2015, Int. J. Uncertain. Fuzziness Knowl. Based Syst..

[46]  P ? ? ? ? ? ? ? % ? ? ? ? , 1991 .

[47]  A. Agresti.  Analysis of Ordinal Categorical Data , 1985 .

[48]  Mohammad Reza Meybodi,et al.  A learning automata-based heuristic algorithm for solving the minimum spanning tree problem in stochastic graphs , 2012, The Journal of Supercomputing.

[49]  Ramana Rao Kompella,et al.  Network Sampling: From Static to Streaming Graphs , 2012, TKDD.

[50]  Mohammad Reza Meybodi,et al.  A Michigan memetic algorithm for solving the community detection problem in complex network , 2016, Neurocomputing.

[51]  L. Freeman.  Centrality in social networks conceptual clarification , 1978 .

[52]  Mohammad Reza Meybodi,et al.  A two-phase sampling algorithm for social networks , 2015, 2015 2nd International Conference on Knowledge-Based Engineering and Innovation (KBEI).

[53]  Krishna P. Gummadi,et al.  On the evolution of user interaction in Facebook , 2009, WOSN '09.

[54]  Mohammad Reza Meybodi,et al.  Cellular learning automata based algorithm for solving minimum vertex cover problem , 2014, 2014 22nd Iranian Conference on Electrical Engineering (ICEE).

[55]  Mohammad Reza Meybodi,et al.  Stochastic graph as a model for social networks , 2016, Comput. Hum. Behav..

[56]  Wei-Po Lee,et al.  Enhancing collaborative recommendation performance by combining user preference and trust-distrust propagation in social networks , 2016, Knowl. Based Syst..

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

[58]  Mohammad Reza Meybodi,et al.  Sampling from complex networks using distributed learning automata , 2014 .

[59]  Mohammad Reza Meybodi,et al.  Finding Minimum Vertex Covering in Stochastic Graphs: A Learning Automata Approach , 2015, Cybern. Syst..

[60]  Yue Liu,et al.  Aggregate Characterization of User Behavior in Twitter and Analysis of the Retweet Graph , 2014, ACM Trans. Internet Techn..

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

[62]  Francisco Herrera,et al.  A study on the use of non-parametric tests for analyzing the evolutionary algorithms’ behaviour: a case study on the CEC’2005 Special Session on Real Parameter Optimization , 2009, J. Heuristics.

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

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

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