Information-cloning of scale-free networks

Authors:
Mahendra Piraveenan;Mikhail Prokopenko;Albert Y. Zomaya
Affiliations:
CSIRO Information and Communications Technology Centre, North Ryde, NSW, Australia and School of Information Technologies, The University of Sydney, NSW, Australia;CSIRO Information and Communications Technology Centre, North Ryde, NSW, Australia;School of Information Technologies, The University of Sydney, NSW, Australia
Venue:
ECAL'07 Proceedings of the 9th European conference on Advances in artificial life
Year:
2007

Citing 0
Cited 3

Assortative Mixing in Directed Biological Networks

IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Evolution of coordination in scale-free and small world networks under information diffusion constraints

Proceedings of the 2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining
Standard deviations of degree differences as indicators of mixing patterns in complex networks

Proceedings of the 2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining

Quantified Score

Hi-index	0.00

Visualization

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