Information-cloning of scale-free networks

Mahendra Piraveenan, Mikhail Prokopenko*, Albert Y. Zomaya

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference proceeding contributionpeer-review

14 Citations (Scopus)


In this paper, we introduce a method, Assortative Preferential Attachment, to grow a scale-free network with a given assortativeness value. Utilizing this method, we investigate information-cloning -recovery of scale-free networks in terms of their information transfer -and identify a number of recovery features: a full-recovery threshold, a phase transition for both assortative and disassortative networks, and a bell-shaped complexity curve for non-assortative networks. These features are interpreted with respect to two opposing tendencies dominating network recovery: an increasing amount of choice in adding assortative/disassortative connections, and an increasing divergence between the joint remaining-degree distributions of existing and required networks.

Original languageEnglish
Title of host publicationAdvances in Artificial Life
Subtitle of host publication9th European Conference, ECAL 2007, Proceedings
EditorsFernando Almeida E Costa
Place of PublicationBerlin; Heidelberg
PublisherSpringer, Springer Nature
Number of pages11
Volume4648 LNAI
ISBN (Electronic)9783540749134
ISBN (Print)9783540749127
Publication statusPublished - 2007
Event9th European Conference on Advance in Artificial Life, ECAL 2007 - Lisbon, Portugal
Duration: 10 Sep 200714 Sep 2007

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4648 LNAI
ISSN (Print)03029743
ISSN (Electronic)16113349


Other9th European Conference on Advance in Artificial Life, ECAL 2007


Dive into the research topics of 'Information-cloning of scale-free networks'. Together they form a unique fingerprint.

Cite this