Network structure optimization for social networks by minimizing the average path length

被引：4

作者：

Du, Wei ^{[1
]}

Li, Gang ^{[1
,2
]}

He, Xiaochen ^{[1
,3
]}

机构：

[1] Xi An Jiao Tong Univ, Sch Publ Policy & Adm, West Xianning Rd, Xian 710049, Shaanxi, Peoples R China

[2] Xi An Jiao Tong Univ, Ctr Adm & Complex Sci, West Xianning Rd, Xian 710049, Shaanxi, Peoples R China

[3] Xi An Jiao Tong Univ, Sch Econ & Finance, Yanta West Rd, Xian 710061, Shaanxi, Peoples R China

来源：

COMPUTING | 2022年 / 104卷 / 06期

基金：

中国国家自然科学基金; 中国博士后科学基金;

关键词：

Network; Structure; Optimization; Algorithm; BALANCE; ALGORITHMS; COMMUNITY;

D O I：

10.1007/s00607-022-01061-w

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

Network structure plays an important role in the natural and social sciences. Optimization of network structure in achieving specified goals has been a major research focus. In this paper, we focus on structural optimization in terms of minimizing the network's average path length (APL) by adding edges. We suggest a memetic algorithm to find the minimum-APL solution by adding edges. Experiments show that the proposed algorithm can solve this problem efficiently. Further, we find that APL will ultimately decrease linearly in the process of adding edges, which is affected by the network diameter.

引用

页码：1461 / 1480

页数：20

共 59 条

[1] Friends and neighbors on the Web [J].