In the last 10 years a new interest in socalled realworld graph structures has developed. Since the structure of a network is crucial for the processes on top of it a welldefined network model is needed for simulations and other kinds of experiments. Thus, given an observable network structure, models try to explain how they could have evolved. But sometimes also the opposite question is important: given a system with specific constraints what kind of rules will lead to a network with the specified structure? This overview article discusses first different realworld networks and their structures that have been analyzed in the last decade and models that explain how these structures can emerge. This chapter concentrates on those structures and models that are very simple and can likely be included into technical networks such as P2P-networks or sensor networks. In the second part we will then discuss how difficult it is to design local network generating rules that lead to a globally satisfying network structure.
CITATION STYLE
Lerner, J., Wagner, D., & Zweig, K. A. (2009). Algorithmics of Large and Complex Networks. Algorithmics of Large and Complex Networks (Vol. 5515, pp. 81-103–103). Retrieved from http://www.springerlink.com/index/10.1007/978-3-642-02094-0
Mendeley helps you to discover research relevant for your work.