The structure of complex networks: scale-free and small-world random graphs

发布者:季洁发布时间:2019-02-28浏览次数:210

Speaker:Remco van der Hofstad, Eindhoven University of Technology
Host:Fengnan Gao, School of Data Science, Fudan University
Time:16:00-17:00, Feb 28, 2019
Location:Zibin N102, Fudan University
Abstract:Many phenomena in the real world can be phrased in terms of networks. Examples include the World-Wide Web, social interactions and Internet, but also the interaction patterns between proteins, food webs and citation networks.


Many large-scale networks have, despite their diversity in backgrounds, surprisingly much in common. Many of these networks are small worlds, in the sense that one requires few links to hop between pairs of vertices. Also the variability of the number of connections between elements tends to be enormous, which is related to the scale-free phenomenon.

In this lecture for a broad audience, we describe a few real-world networks and some of their empirical properties. We also describe the effectiveness of abstract network modeling in terms of graphs and how real-world networks can be modeled, as well as how these models help us to give sense to the empirical findings. We continue by discussing some random graph models for real-world networks and their properties, as well as their merits and flaws as network models. We conclude by discussing the implications of some of the empirical findings on information diffusion and competition on such networks.

We assume no prior knowledge in graph theory, probability or otherwise.

Bio:Remco van der Hofstad (1971) received the Prix Henri Poincare 2003 jointly with Gordon Slade, the Rollo Davidson Prize 2007, and is a laureate of the `Innovative Research VIDI Scheme’ 2003 and `Innovative Research VICI Scheme’ 2008. He is also one of the 11 co-applicants of the Gravitation program NETWORKS. Since April 2018, he has been appointed as a member of the Royal Netherlands Academy of Arts and Sciences. His research focuses on the interplay between stochastic processes and the topology of the underlying base graphs on which these processes live. Key techniques come from statistical physics, probability theory and network theory. Van der Hofstad has made ground-breaking contributions to both percolation theory and random graph theory.