Modelling and simulation of large-scale complex networks

Luo, H 2006, Modelling and simulation of large-scale complex networks, Doctor of Philosophy (PhD), Mathematical and Geospatial Sciences, RMIT University.


Document type: Thesis
Collection: Theses

Attached Files
Name Description MIMEType Size
Luo.pdf Thesis application/pdf 1.55MB
Title Modelling and simulation of large-scale complex networks
Author(s) Luo, H
Year 2006
Abstract Real-world large-scale complex networks such as the Internet, social networks and biological networks have increasingly attracted the interest of researchers from many areas. Accurate modelling of the statistical regularities of these large-scale networks is critical to understand their global evolving structures and local dynamical patterns. Traditionally, the Erdos and Renyi random graph model has helped the investigation of various homogeneous networks. During the past decade, a special computational methodology has emerged to study complex networks, the outcome of which is identified by two models: the Watts and Strogatz small-world model and the Barabasi-Albert scale-free model.

At the core of the complex network modelling process is the extraction of characteristics of real-world networks. I have developed computer simulation algorithms for study of the properties of current theoretical models as well as for the measurement of two real-world complex networks, which lead to the isolation of three complex network modelling essentials.

The main contribution of the thesis is the introduction and study of a new General Two-Stage growth model (GTS Model), which aims to describe and analyze many common-featured real-world complex networks. The tools we use to create the model and later perform many measurements on it consist of computer simulations, numerical analysis and mathematical derivations.

In particular, two major cases of this GTS model have been studied.

One is named the U-P model, which employs a new functional form of the network growth rule: a linear combination of preferential attachment and uniform attachment. The degree distribution of the model is first studied by computer simulation, while the exact solution is also obtained analytically. Two other important properties of complex networks: the characteristic path length and the clustering coefficient are also extensively investigated, obtaining either analytically derived solutions or numerical results by computer simulations. Furthermore, I demonstrate that the hub-hub interaction behaves in effect as the link between a network's topology and resilience property.

The other is called the Hybrid model, which incorporates two stages of growth and studies the transition behaviour between the Erdos and Renyi random graph model and the Barabasi-Albert scale-free model. The Hybrid model is measured by extensive numerical simulations focusing on its degree distribution, characteristic path length and clustering coefficient.

Although either of the two cases serves as a new approach to modelling real-world large-scale complex networks, perhaps more importantly, the general two-stage model provides a new theoretical framework for complex network modelling, which can be extended in many ways besides the two studied in this thesis.
Degree Doctor of Philosophy (PhD)
Institution RMIT University
School, Department or Centre Mathematical and Geospatial Sciences
Keyword(s) Computer networks--Design
Versions
Version Filter Type
Access Statistics: 373 Abstract Views, 748 File Downloads  -  Detailed Statistics
Created: Thu, 17 Feb 2011, 09:07:30 EST
© 2014 RMIT Research Repository • Powered by Fez SoftwareContact us