Entropy optimization of social networks using an evolutionary algorithm

Maytham Safar, Nosayba El-Sayed, Khaled Mahdi, David Taniar

Research output: Contribution to journalArticle

7 Citations (Scopus)

Abstract

Recent work on social networks has tackled the measurement and optimization of these networks' robustness and resilience to both failures and attacks. Different metrics have been used to quantitatively measure the robustness of a social network. In this work, we design and apply a Genetic Algorithm that maximizes the cyclic entropy of a social network model, hence optimizing its robustness to failures. Our social network model is a scale-free network created using Barabási and Albert's generative model, since it has been demonstrated recently that many large complex networks display a scale-free structure. We compare the cycles distribution of the optimally robust network generated by our algorithm to that belonging to a fully connected network. Moreover, we optimize the robustness of a scale-free network based on the links-degree entropy, and compare the outcomes to that which is based on cycles- entropy. We show that both cyclic and degree entropy optimization are equivalent and provide the same final optimal distribution. Hence, cyclic entropy optimization is justified in the search for the optimal network distribution.

Original languageEnglish
Pages (from-to)983-1003
Number of pages21
JournalJournal of Universal Computer Science
Volume16
Issue number6
Publication statusPublished - 18 Jun 2010
Externally publishedYes

Fingerprint

Entropy Optimization
Evolutionary algorithms
Social Networks
Evolutionary Algorithms
Entropy
Robustness
Complex networks
Scale-free Networks
Network Model
Cycle
Generative Models
Distribution Network
Resilience
Complex Networks
Electric power distribution
Maximise
Optimise
Attack
Genetic Algorithm
Metric

Keywords

  • Entropy
  • Evolutionary algorithm
  • Genetic algorithm
  • Social networks

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Entropy optimization of social networks using an evolutionary algorithm. / Safar, Maytham; El-Sayed, Nosayba; Mahdi, Khaled; Taniar, David.

In: Journal of Universal Computer Science, Vol. 16, No. 6, 18.06.2010, p. 983-1003.

Research output: Contribution to journalArticle

Safar, Maytham ; El-Sayed, Nosayba ; Mahdi, Khaled ; Taniar, David. / Entropy optimization of social networks using an evolutionary algorithm. In: Journal of Universal Computer Science. 2010 ; Vol. 16, No. 6. pp. 983-1003.
@article{a3385df45b2f420db08f89ad31487849,
title = "Entropy optimization of social networks using an evolutionary algorithm",
abstract = "Recent work on social networks has tackled the measurement and optimization of these networks' robustness and resilience to both failures and attacks. Different metrics have been used to quantitatively measure the robustness of a social network. In this work, we design and apply a Genetic Algorithm that maximizes the cyclic entropy of a social network model, hence optimizing its robustness to failures. Our social network model is a scale-free network created using Barab{\'a}si and Albert's generative model, since it has been demonstrated recently that many large complex networks display a scale-free structure. We compare the cycles distribution of the optimally robust network generated by our algorithm to that belonging to a fully connected network. Moreover, we optimize the robustness of a scale-free network based on the links-degree entropy, and compare the outcomes to that which is based on cycles- entropy. We show that both cyclic and degree entropy optimization are equivalent and provide the same final optimal distribution. Hence, cyclic entropy optimization is justified in the search for the optimal network distribution.",
keywords = "Entropy, Evolutionary algorithm, Genetic algorithm, Social networks",
author = "Maytham Safar and Nosayba El-Sayed and Khaled Mahdi and David Taniar",
year = "2010",
month = "6",
day = "18",
language = "English",
volume = "16",
pages = "983--1003",
journal = "Journal of Universal Computer Science",
issn = "0948-6968",
publisher = "Springer Verlag",
number = "6",

}

TY - JOUR

T1 - Entropy optimization of social networks using an evolutionary algorithm

AU - Safar, Maytham

AU - El-Sayed, Nosayba

AU - Mahdi, Khaled

AU - Taniar, David

PY - 2010/6/18

Y1 - 2010/6/18

N2 - Recent work on social networks has tackled the measurement and optimization of these networks' robustness and resilience to both failures and attacks. Different metrics have been used to quantitatively measure the robustness of a social network. In this work, we design and apply a Genetic Algorithm that maximizes the cyclic entropy of a social network model, hence optimizing its robustness to failures. Our social network model is a scale-free network created using Barabási and Albert's generative model, since it has been demonstrated recently that many large complex networks display a scale-free structure. We compare the cycles distribution of the optimally robust network generated by our algorithm to that belonging to a fully connected network. Moreover, we optimize the robustness of a scale-free network based on the links-degree entropy, and compare the outcomes to that which is based on cycles- entropy. We show that both cyclic and degree entropy optimization are equivalent and provide the same final optimal distribution. Hence, cyclic entropy optimization is justified in the search for the optimal network distribution.

AB - Recent work on social networks has tackled the measurement and optimization of these networks' robustness and resilience to both failures and attacks. Different metrics have been used to quantitatively measure the robustness of a social network. In this work, we design and apply a Genetic Algorithm that maximizes the cyclic entropy of a social network model, hence optimizing its robustness to failures. Our social network model is a scale-free network created using Barabási and Albert's generative model, since it has been demonstrated recently that many large complex networks display a scale-free structure. We compare the cycles distribution of the optimally robust network generated by our algorithm to that belonging to a fully connected network. Moreover, we optimize the robustness of a scale-free network based on the links-degree entropy, and compare the outcomes to that which is based on cycles- entropy. We show that both cyclic and degree entropy optimization are equivalent and provide the same final optimal distribution. Hence, cyclic entropy optimization is justified in the search for the optimal network distribution.

KW - Entropy

KW - Evolutionary algorithm

KW - Genetic algorithm

KW - Social networks

UR - http://www.scopus.com/inward/record.url?scp=77953529575&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=77953529575&partnerID=8YFLogxK

M3 - Article

VL - 16

SP - 983

EP - 1003

JO - Journal of Universal Computer Science

JF - Journal of Universal Computer Science

SN - 0948-6968

IS - 6

ER -