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: | , , , |
|---|---|
| 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!
|
| _version_ | 1832562718772559872 |
|---|---|
| author | Haifeng Du Xiaochen He Wei Du Marcus W. Feldman |
| author_facet | Haifeng Du Xiaochen He Wei Du Marcus W. Feldman |
| author_sort | Haifeng Du |
| collection | DOAJ |
| description | 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. |
| format | Article |
| id | doaj-art-153671f89b8744dfa2e04d17dde3d5a7 |
| institution | Kabale University |
| issn | 1076-2787 1099-0526 |
| language | English |
| publishDate | 2017-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | Complexity |
| spelling | doaj-art-153671f89b8744dfa2e04d17dde3d5a72025-02-03T01:21:55ZengWileyComplexity1076-27871099-05262017-01-01201710.1155/2017/32036153203615Optimization of the Critical Diameter and Average Path Length of Social NetworksHaifeng Du0Xiaochen He1Wei Du2Marcus W. Feldman3Center for Administration and Complexity Science, Xi’an Jiaotong University, Xi’an, Shanxi Province 710049, ChinaCenter for Administration and Complexity Science, Xi’an Jiaotong University, Xi’an, Shanxi Province 710049, ChinaCenter for Administration and Complexity Science, Xi’an Jiaotong University, Xi’an, Shanxi Province 710049, ChinaCenter for Administration and Complexity Science, Xi’an Jiaotong University, Xi’an, Shanxi Province 710049, ChinaOptimizing 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.http://dx.doi.org/10.1155/2017/3203615 |
| spellingShingle | Haifeng Du Xiaochen He Wei Du Marcus W. Feldman Optimization of the Critical Diameter and Average Path Length of Social Networks Complexity |
| title | Optimization of the Critical Diameter and Average Path Length of Social Networks |
| title_full | Optimization of the Critical Diameter and Average Path Length of Social Networks |
| title_fullStr | Optimization of the Critical Diameter and Average Path Length of Social Networks |
| title_full_unstemmed | Optimization of the Critical Diameter and Average Path Length of Social Networks |
| title_short | Optimization of the Critical Diameter and Average Path Length of Social Networks |
| title_sort | optimization of the critical diameter and average path length of social networks |
| url | http://dx.doi.org/10.1155/2017/3203615 |
| work_keys_str_mv | AT haifengdu optimizationofthecriticaldiameterandaveragepathlengthofsocialnetworks AT xiaochenhe optimizationofthecriticaldiameterandaveragepathlengthofsocialnetworks AT weidu optimizationofthecriticaldiameterandaveragepathlengthofsocialnetworks AT marcuswfeldman optimizationofthecriticaldiameterandaveragepathlengthofsocialnetworks |