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.
The Authors list is in alphabetical order.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Solé, R.V., Valverde, S.: Information theory of complex networks: on evolution and architectural constraints. In: Ben-Naim, E., Frauenfelder, H., Toroczkai, Z. (eds.) Complex Networks. Lecture Notes in Physics, vol. 650, Springer, Heidelberg (2004)
Newman, M.E.: Assortative mixing in networks. Phys. Rev. Lett. 89(20), 208701 (2002)
Callaway, D.S., Hopcroft, J.E., Kleinberg, J.M., Newman, M.E., Strogatz, S.H.: Are randomly grown graphs really random? Phys Rev E 64(4 Pt 1) (2001)
Albert, T.R., Barabasi, A.-L.: Statistical mechanics of complex networks. Rev. Mod. Phys. 74, 47–97 (2002)
Albert, R., Jeong, H., Barabási, A.-L.: Error and attack tolerance of complex networks. Nature 406, 378–382 (2000)
Crucittia, P., Latora, V., Marchiori, M., Rapisarda, A.: Error and attack tolerance of complex networks. Physica A 340, 388–394 (2004)
Moreno, Y., Gómez, J.B., Pacheco, A.F.: Instability of scale-free networks under node-breaking avalanches. Europhys. Lett. 58, 630–636 (2002)
Stauffer, D., Sahimi, M.: Diffusion in scale-free networks with annealed disorder. Phys. Rev. E 72, 046128 (2005)
Prokopenko, M., Boschetti, F., Ryan, A.: An information-theoretic primer on complexity, self-organisation and emergence. Unpublished (2007)
Newman, M.E.: Mixing patterns in networks. Phys. Rev. E 67(2), 026126 (2003)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Piraveenan, M., Prokopenko, M., Zomaya, A.Y. (2007). Information-Cloning of Scale-Free Networks. In: Almeida e Costa, F., Rocha, L.M., Costa, E., Harvey, I., Coutinho, A. (eds) Advances in Artificial Life. ECAL 2007. Lecture Notes in Computer Science(), vol 4648. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74913-4_93
Download citation
DOI: https://doi.org/10.1007/978-3-540-74913-4_93
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74912-7
Online ISBN: 978-3-540-74913-4
eBook Packages: Computer ScienceComputer Science (R0)