Title: What makes a scalefree network interesting, or, what is preferential to preferential attachment?
Speaker: Michael Small
Australian Research Council Future Fellow and Winthrop Professor of Applied Mathematics in the School of
Mathematics and Statistics at The University of Western Australia (UWA)
Time: 2 pm, Wednesday, March 6, 2013
Venue: Room 2201, East Guanghua Tower, Handan Campus, Fudan University
Biography:
Michael Small is an Australian Research Council Future Fellow and Winthrop Professor of Applied Mathematics in the School of Mathematics and Statistics at The University of Western Australia (UWA). His research interests are complex systems, nonlinear dynamics and chaos, and nonlinear time series analysis. Prof. Small's work focusses on the application of mathematical methods to a variety of problems in the real world: social and technological networks, neurodynamics, modelling of physical systems, biomedical signal processing and financial markets are a few examples. He is interested in how the structure of a complex network affects the dynamical behaviour of its components and is developing techniques to characterise and quantify regularity and atypical features in complex networks. He is currently working on applications of complex networks and dynamical complex networks to problems in systems biology, collective animal motion and disease transmission.
Prior to joining UWA in 2012, Prof. Small was with the Department of Electronic and Information Engineering at The Hong Kong Polytechnic University. He is a Senior member of the IEEE and the Australian Mathematics Society, and on the editorial board of several international journals  including the International Journal of Bifurcations and Chaos. Prof. Small has published well over 130 journal articles and authored or coauthored four books.
Abstract:
Abstract: Scalefree networks  networks for which the degree distribution follows a power law are a mainstay of complex systems theory in the physics community. However, almost all actual realisable scalefree networks deviate significantly from the ideal. In this talk I will formulate a more precise definition of what is meant by a scalefree network and demonstrate that many of the properties usually ascribed to scalefree networks are actually not related to the powerlaw degree distribution. In doing so, I will also examine the preferential attachment mechanism (the idea that, colloquially the "richgetricher") and show that this is not the optimal growth model with which to construct a scalefree network. This work implies that the range of features which scalefree networks may exhibit is actually much broader and more interesting than previously supposed.
