Abstract
In this chapter we will introduce two famous network models that arose much interest in recent years: The small-world model of Duncan Watts and Steven Strogatz [615] and scale-free or power-law networks, first presented by the Faloutsos brethren [201] and filled with life by a model of Albert- László Barabási and Réka Alberts [60]. These models describe some structural aspects of most real-world networks. The most prevalent network structure of small-world networks is a local mesh-like part combined with some random edges that make the network small.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Lehmann, K.A., Kaufmann, M. (2005). 6. Random Graphs, Small-Worlds and Scale-Free Networks. In: Steinmetz, R., Wehrle, K. (eds) Peer-to-Peer Systems and Applications. Lecture Notes in Computer Science, vol 3485. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11530657_6
Download citation
DOI: https://doi.org/10.1007/11530657_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29192-3
Online ISBN: 978-3-540-32047-0
eBook Packages: Computer ScienceComputer Science (R0)