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 pro...
Saved in:
Main Authors: | Haifeng Du, Xiaochen He, Wei Du, Marcus W. Feldman |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
2017-01-01
|
Series: | Complexity |
Online Access: | http://dx.doi.org/10.1155/2017/3203615 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
A Genetic Simulated Annealing Algorithm to Optimize the Small-World Network Generating Process
by: Haifeng Du, et al.
Published: (2018-01-01) -
Analysis of Average Shortest-Path Length of Scale-Free Network
by: Guoyong Mao, et al.
Published: (2013-01-01) -
A Multilevel Simplification Algorithm for Computing the Average Shortest-Path Length of Scale-Free Complex Network
by: Guoyong Mao, et al.
Published: (2014-01-01) -
The Maximal Length of 2-Path in Random Critical Graphs
by: Vonjy Rasendrahasina, et al.
Published: (2018-01-01) -
Optimal Packet Length for Free-Space Optical Communications with Average SNR Feedback Channel
by: Ghassan Alnwaimi, et al.
Published: (2019-01-01)