Optimization of the critical diameter and average path length of social networks

DOI10.1155/2017/3203615MaRDI QIDQ2012776zbMATH OpenOpenAlexWikidataFDO

Authors Haifeng Du, Xiaochen He, Wei Du, Marcus W. Feldman

Publication date 3 August 2017

Published in Complexity (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1155/2017/3203615

zbMATH Keywords

average path length (APL)memetic algorithmnetwork diametersocial networks

Mathematics Subject Classification ID

Mathematical programming (90C99) Social networks; opinion dynamics (91D30)

Review text

Summary: 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.

Recommendations

• Network structure optimization for social networks by minimizing the average path length
• A low complexity method for the optimization of network path length in spatially embedded networks
• Converting a network into a small-world network: fast algorithms for minimizing average path length through link addition
• Minimizing the diameter of a network using shortcut edges
• Minimizing Average Shortest Path Distances via Shortcut Edge Addition

Cites work

• Collective dynamics of `small-world' networks
• Community structure in social and biological networks
• Design to Minimize Diameter on Building-Block Network
• Emergence of Scaling in Random Networks
• Minimizing Average Shortest Path Distances via Shortcut Edge Addition
• Minimizing the diameter of a network using shortcut edges
• Reduction of Average Path Length in Binary Decision Diagrams by Spectral Methods
• Scale-free networks: a decade and beyond
• Statistical mechanics of complex networks
• The Structure and Function of Complex Networks

Cited in

(4)

• Tuning the average path length of complex networks and its influence to the emergent dynamics of the majority-rule model
• Network structure optimization for social networks by minimizing the average path length
• A low complexity method for the optimization of network path length in spatially embedded networks
• Converting a network into a small-world network: fast algorithms for minimizing average path length through link addition

This page was built for publication: Optimization of the critical diameter and average path length of social networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2012776)