Optimization of the critical diameter and average path length of social networks
From MaRDI portal
Publication:2012776
DOI10.1155/2017/3203615zbMATH Open1367.91155OpenAlexW2598554365WikidataQ59142881 ScholiaQ59142881MaRDI QIDQ2012776FDOQ2012776
Authors: Haifeng Du, Xiaochen He, Wei Du, Marcus W. Feldman 
Publication date: 3 August 2017
Published in: Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2017/3203615
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
- Statistical mechanics of complex networks
- Emergence of Scaling in Random Networks
- The Structure and Function of Complex Networks
- Community structure in social and biological networks
- Collective dynamics of `small-world' networks
- Scale-free networks: a decade and beyond
- Design to Minimize Diameter on Building-Block Network
- Minimizing the diameter of a network using shortcut edges
- Minimizing Average Shortest Path Distances via Shortcut Edge Addition
- Reduction of Average Path Length in Binary Decision Diagrams by Spectral Methods
Cited In (3)
- A low complexity method for the optimization of network path length in spatially embedded networks
- Network structure optimization for social networks by minimizing the average path length
- 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)
