Optimization of the Critical Diameter and Average Path Length of Social Networks

Optimizing average path length (APL) by adding shortcut edges has been widely discussed in connection with social networks, but the relationship between network diameter and APL is generally ignored in the dynamic optimization of APL. In this paper, we analyze this relationship and transform the problem of optimizing APL into the problem of decreasing diameter to 2. We propose a mathematic model based on a memetic algorithm. Experimental results show that our algorithm can efficiently solve this problem as well as optimize APL.

[1]  Zhen Liu,et al.  Link prediction in complex networks: A local naïve Bayes model , 2011, ArXiv.

[2]  Maoguo Gong,et al.  Memetic algorithm for community detection in networks. , 2011, Physical review. E, Statistical, nonlinear, and soft matter physics.

[3]  Yew-Soon Ong,et al.  Memetic Computation—Past, Present & Future [Research Frontier] , 2010, IEEE Computational Intelligence Magazine.

[4]  Beom Jun Kim,et al.  Synchronization on small-world networks. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.

[5]  Albert-László Barabási,et al.  Statistical mechanics of complex networks , 2001, ArXiv.

[6]  Linyuan Lu,et al.  Link Prediction in Complex Networks: A Survey , 2010, ArXiv.

[7]  Adam Meyerson,et al.  Minimizing Average Shortest Path Distances via Shortcut Edge Addition , 2009, APPROX-RANDOM.

[8]  Osnat Keren.  Reduction of Average Path Length in Binary Decision Diagrams by Spectral Methods , 2008, IEEE Transactions on Computers.

[9]  Gade,et al.  Synchronous chaos in coupled map lattices with small-world interactions , 2000, Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics.

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

[11]  Albert-László Barabási,et al.  Scale-Free Networks: A Decade and Beyond , 2009, Science.

[12]  Guoai Xu,et al.  Average path length for Sierpinski pentagon , 2011, 1112.4943.

[13]  Sang Hoon Lee,et al.  A greedy-navigator approach to navigable city plans , 2012, ArXiv.

[14]  Morteza Zadimoghaddam,et al.  Minimizing the Diameter of a Network Using Shortcut Edges , 2010, SWAT.

[15]  D S Callaway,et al.  Network robustness and fragility: percolation on random graphs. , 2000, Physical review letters.

[16]  David Liben-Nowell,et al.  The link-prediction problem for social networks , 2007 .

[17]  Mauricio Barahona,et al.  Synchronization in small-world systems. , 2002, Physical review letters.

[18]  Katarzyna Musial,et al.  Link Prediction Methods and Their Accuracy for Different Social Networks and Network Metrics , 2015, Sci. Program..

[19]  Manos Papagelis,et al.  Refining Social Graph Connectivity via Shortcut Edge Addition , 2015, ACM Trans. Knowl. Discov. Data.

[20]  L F Lago-Fernández,et al.  Fast response and temporal coherent oscillations in small-world networks. , 1999, Physical review letters.

[21]  Yanjun Li,et al.  A temporal ant colony optimization approach to the shortest path problem in dynamic scale-free networks , 2010 .

[22]  J. Jost,et al.  Spectral properties and synchronization in coupled map lattices. , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

[23]  Makoto Imase,et al.  Design to Minimize Diameter on Building-Block Network , 1981, IEEE Transactions on Computers.

[24]  Tie-Jun Wu,et al.  Optimal symmetric networks in terms of minimizing average shortest path length and their sub-optimal growth model , 2009 .

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

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

[27]  Evaggelia Pitoura,et al.  Selecting Shortcuts for a Smaller World , 2015, SDM.

[28]  Chonghui Guo,et al.  Optimization of network structure to random failures , 2006 .

[29]  Mark E. J. Newman,et al.  The Structure and Function of Complex Networks , 2003, SIAM Rev..

[30]  An-Ping Zeng,et al.  Reconstruction of metabolic networks from genome data and analysis of their global structure for various organisms , 2003, Bioinform..

[31]  Carlos Cotta,et al.  Memetic algorithms and memetic computing optimization: A literature review , 2012, Swarm Evol. Comput..

[32]  Cai Meng,et al.  A new network structure entropy based on maximum flow , 2014 .

[33]  Neil F Johnson,et al.  Effect of congestion costs on shortest paths through complex networks. , 2005, Physical review letters.