Optimization of the Critical Diameter and Average Path Length of Social Networks

Complexity 2017:1-11 (2017)

Abstract

Optimizing average path length 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.

Download options

PhilArchive



    Upload a copy of this work     Papers currently archived: 72,660

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Analytics

Added to PP
2019-06-13

Downloads
1 (#1,558,818)

6 months
1 (#388,311)

Historical graph of downloads

Sorry, there are not enough data points to plot this chart.
How can I increase my downloads?

Similar books and articles

Corporate Responsibilities in Internet-Enabled Social Networks.Stephen Chen - 2009 - Journal of Business Ethics 90 (S4):523 - 536.
What is Optimized in an Optimal Path?Fraser T. Sparks, Kally C. O'Reilly & John L. Kubie - 2013 - Behavioral and Brain Sciences 36 (5):566 - 566.
Are Self-Organizing Biochemical Networks Emergent?Christophe Malaterre - 2009 - In Maryvonne Gérin & Marie-Christine Maurel (eds.), Origins of Life: Self-Organization and/or Biological Evolution? EDP Sciences. pp. 117--123.
Does Optimization Imply Rationality?Philippe Mongin - 2000 - Synthese 124 (1):73-111.
Does Optimization Imply Rationality?Philippe Mongin - 2000 - Synthese 124 (1-2):73 - 111.

References found in this work

No references found.

Add more references

Citations of this work

No citations found.

Add more citations