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.
CITATION STYLE
Cohen, R., Rozenfeld, A. F., Schwartz, N., ben-Avraham, D., & Havlin, S. (2003). Directed and Non-directed Scale-Free Networks (pp. 23–45). https://doi.org/10.1007/978-3-540-44943-0_3
Mendeley helps you to discover research relevant for your work.