Abstract
Scale-free networks are networks with a scale-free degree distribution, i.e., where the distribution of the number of links per node is a power-law, p(k)=ck -λ. We review results for the properties of such networks, emphasizing the structural properties of these networks. We begin with normal random scale-free networks and present their percolation properties. We also review results for directed scale-free networks and their percolation properties. Finally we present a study of the possibility of embedding scale-free networks in a lattice.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin/Heidelberg
About this chapter
Cite this chapter
Cohen, R., Rozenfeld, A.F., Schwartz, N., ben-Avraham, D., Havlin, S. (2003). Directed and Non-directed Scale-Free Networks. In: Pastor-Satorras, R., Rubi, M., Diaz-Guilera, A. (eds) Statistical Mechanics of Complex Networks. Lecture Notes in Physics, vol 625. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-44943-0_3
Download citation
DOI: https://doi.org/10.1007/978-3-540-44943-0_3
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40372-2
Online ISBN: 978-3-540-44943-0
eBook Packages: Springer Book Archive