Betweenness centrality updation and community detection in streaming graphs using incremental algorithm

Centrality measures have perpetually been helpful to find the foremost central or most powerful node within the network. There are numerous strategies to compute centrality of a node however in social networks betweenness centrality is the most widely used approach to bifurcate communities within the network, to find out the susceptibility within the complex networks and to generate the scale free networks whose degree distribution follows the power law. In this paper, we've computed betweenness centrality by identifying communities lying within the network. Our algorithm efficiently updates the centrality of the nodes whenever any edge or vertex addition or deletion takes place within the dynamic network by modifying solely a subset of vertices. For the vertex addition, Incremental Algorithm has been used in which Streaming graphs has also been considered. Brandes approach is the most widely used approach for finding out the betweenness centrality however it's still expensive for growing networks since it takes O(mn+n2logn) amount of time and O(n+m) space however our approach efficiently updates the centrality of the nodes by taking O(|S|n+|S|nlogn) amount of time where |S| is the subset of the vertices,m is the number of edges, n is the number of vertices and |S|≤n holds true.

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

[2]  F. Radicchi,et al.  Benchmark graphs for testing community detection algorithms. , 2008, Physical review. E, Statistical, nonlinear, and soft matter physics.

[3]  Rajiv Misra,et al.  Approximating geographic routing using coverage tree heuristics for wireless network , 2015, Wirel. Networks.

[4]  Sunghee Choi,et al.  Efficient algorithms for updating betweenness centrality in fully dynamic graphs , 2016, Inf. Sci..

[5]  Ulrik Brandes,et al.  On variants of shortest-path betweenness centrality and their generic computation , 2008, Soc. Networks.

[6]  Matteo Pontecorvi,et al.  Betweenness Centrality - Incremental and Faster , 2013, MFCS.

[7]  Jon M. Kleinberg,et al.  The small-world phenomenon: an algorithmic perspective , 2000, STOC '00.

[8]  U. Brandes.  A faster algorithm for betweenness centrality , 2001 .

[9]  David A. Bader,et al.  Faster Betweenness Centrality Based on Data Structure Experimentation , 2013, ICCS.

[10]  Evgenios M. Kornaropoulos,et al.  Fast approximation of betweenness centrality through sampling , 2014, WSDM.

[11]  ChungChin-Wan,et al.  Efficient algorithms for updating betweenness centrality in fully dynamic graphs , 2016 .

[12]  Kathleen M. Carley,et al.  An incremental algorithm for updating betweenness centrality and k-betweenness centrality and its performance on realistic dynamic social network data , 2014, Social Network Analysis and Mining.

[13]  Debasis Das,et al.  Caching algorithm for fast handoff using AP graph with multiple vehicles for VANETs , 2015, Int. J. Commun. Networks Distributed Syst..

[14]  Mostafa Haghir Chehreghani,et al.  An efficient algorithm for approximate betweenness centrality computation , 2013, Comput. J..

[15]  Rishi Ranjan Singh,et al.  A Faster Algorithm to Update Betweenness Centrality after Node Alteration , 2013, WAW.

[16]  Andrea Lancichinetti,et al.  Detecting the overlapping and hierarchical community structure in complex networks , 2008, 0802.1218.

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

[18]  Leonard M. Freeman,et al.  A set of measures of centrality based upon betweenness , 1977 .

[19]  David A. Bader,et al.  A Fast Algorithm for Streaming Betweenness Centrality , 2012, 2012 International Conference on Privacy, Security, Risk and Trust and 2012 International Confernece on Social Computing.

[20]  Iwao Sasase,et al.  Two-stage SPIT detection scheme with betweenness centrality and social trust , 2015, 2015 21st Asia-Pacific Conference on Communications (APCC).

[21]  Ashutosh Gupta,et al.  Improvised Apriori Algorithm using frequent pattern tree for real time applications in data mining , 2014, ArXiv.

[22]  Andrea Lancichinetti,et al.  Benchmarks for testing community detection algorithms on directed and weighted graphs with overlapping communities. , 2009, Physical review. E, Statistical, nonlinear, and soft matter physics.

[23]  Ying Fan,et al.  Identifying and Characterizing Key Nodes among Communities Based on Electrical-Circuit Networks , 2014, PloS one.

[24]  Albert-László Barabási,et al.  Linked: The New Science of Networks , 2002 .