Optimization of the critical diameter and average path length of social networks (Q2012776)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Optimization of the critical diameter and average path length of social networks |
scientific article; zbMATH DE number 6755966
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Optimization of the critical diameter and average path length of social networks |
scientific article; zbMATH DE number 6755966 |
Statements
Optimization of the critical diameter and average path length of social networks (English)
0 references
3 August 2017
0 references
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.
0 references
average path length (APL)
0 references
social networks
0 references
network diameter
0 references
memetic algorithm
0 references
