Information-cloning of scale-free networks

Mahendra Piraveenan; Mikhail Prokopenko; Albert Y. Zomaya

doi:10.1007/978-3-540-74913-4

Information-cloning of scale-free networks

Mahendra Piraveenan, Mikhail Prokopenko^*, Albert Y. Zomaya

^*Corresponding author for this work

School of Computing

Research output: Chapter in Book/Report/Conference proceeding › Conference proceeding contribution › peer-review

15 Citations (Scopus)

Abstract

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 language	English
Title of host publication	Advances in Artificial Life
Subtitle of host publication	9th European Conference, ECAL 2007, Proceedings
Editors	Fernando Almeida E Costa
Place of Publication	Berlin; Heidelberg
Publisher	Springer, Springer Nature
Pages	925-935
Number of pages	11
Volume	4648 LNAI
ISBN (Electronic)	9783540749134
ISBN (Print)	9783540749127
DOIs	https://doi.org/10.1007/978-3-540-74913-4
Publication status	Published - 2007
Event	9th European Conference on Advance in Artificial Life, ECAL 2007 - Lisbon, Portugal Duration: 10 Sept 2007 → 14 Sept 2007

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	4648 LNAI
ISSN (Print)	03029743
ISSN (Electronic)	16113349

Other

Other	9th European Conference on Advance in Artificial Life, ECAL 2007
Country/Territory	Portugal
City	Lisbon
Period	10/09/07 → 14/09/07

Access to Document

10.1007/978-3-540-74913-4

Cite this

Piraveenan, M., Prokopenko, M., & Zomaya, A. Y. (2007). Information-cloning of scale-free networks. In F. A. E. Costa (Ed.), Advances in Artificial Life: 9th European Conference, ECAL 2007, Proceedings (Vol. 4648 LNAI, pp. 925-935). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4648 LNAI). Springer, Springer Nature. https://doi.org/10.1007/978-3-540-74913-4

Piraveenan, Mahendra ; Prokopenko, Mikhail ; Zomaya, Albert Y. / Information-cloning of scale-free networks. Advances in Artificial Life: 9th European Conference, ECAL 2007, Proceedings. editor / Fernando Almeida E Costa. Vol. 4648 LNAI Berlin; Heidelberg : Springer, Springer Nature, 2007. pp. 925-935 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{9dd5827b63e547579ba64a5fa2697996,

title = "Information-cloning of scale-free networks",

abstract = "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.",

author = "Mahendra Piraveenan and Mikhail Prokopenko and Zomaya, {Albert Y.}",

year = "2007",

doi = "10.1007/978-3-540-74913-4",

language = "English",

isbn = "9783540749127",

volume = "4648 LNAI",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer, Springer Nature",

pages = "925--935",

editor = "Costa, {Fernando Almeida E}",

booktitle = "Advances in Artificial Life",

address = "United States",

note = "9th European Conference on Advance in Artificial Life, ECAL 2007 ; Conference date: 10-09-2007 Through 14-09-2007",

}

Piraveenan, M, Prokopenko, M & Zomaya, AY 2007, Information-cloning of scale-free networks. in FAE Costa (ed.), Advances in Artificial Life: 9th European Conference, ECAL 2007, Proceedings. vol. 4648 LNAI, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4648 LNAI, Springer, Springer Nature, Berlin; Heidelberg, pp. 925-935, 9th European Conference on Advance in Artificial Life, ECAL 2007, Lisbon, Portugal, 10/09/07. https://doi.org/10.1007/978-3-540-74913-4

Information-cloning of scale-free networks. / Piraveenan, Mahendra; Prokopenko, Mikhail; Zomaya, Albert Y.
Advances in Artificial Life: 9th European Conference, ECAL 2007, Proceedings. ed. / Fernando Almeida E Costa. Vol. 4648 LNAI Berlin; Heidelberg: Springer, Springer Nature, 2007. p. 925-935 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4648 LNAI).

Research output: Chapter in Book/Report/Conference proceeding › Conference proceeding contribution › peer-review

TY - GEN

T1 - Information-cloning of scale-free networks

AU - Piraveenan, Mahendra

AU - Prokopenko, Mikhail

AU - Zomaya, Albert Y.

PY - 2007

Y1 - 2007

N2 - 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.

AB - 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.

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

U2 - 10.1007/978-3-540-74913-4

DO - 10.1007/978-3-540-74913-4

M3 - Conference proceeding contribution

AN - SCOPUS:38049082645

SN - 9783540749127

VL - 4648 LNAI

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 925

EP - 935

BT - Advances in Artificial Life

A2 - Costa, Fernando Almeida E

PB - Springer, Springer Nature

CY - Berlin; Heidelberg

T2 - 9th European Conference on Advance in Artificial Life, ECAL 2007

Y2 - 10 September 2007 through 14 September 2007

ER -

Piraveenan M, Prokopenko M, Zomaya AY. Information-cloning of scale-free networks. In Costa FAE, editor, Advances in Artificial Life: 9th European Conference, ECAL 2007, Proceedings. Vol. 4648 LNAI. Berlin; Heidelberg: Springer, Springer Nature. 2007. p. 925-935. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-540-74913-4

Information-cloning of scale-free networks

Abstract

Publication series

Other

Access to Document

Other files and links

Fingerprint

Cite this