(last updated February 7, 2023)

[time zone UTC+2 – check your time lag at]

Monday, 22 May, morning (9.30-12.30)
Introduction to complex networks with reflections on the first quarter century of a field (Dodds):  I will give what can only be a partial survey of the now massive field of (real) complex networks. I will first define and outline some basic meaningful properties of complex networks. I will chart the pre-history and paths of the founding and long-influential late-1990s papers on small-world networks and scale-free networks, locating them in larger academic endeavors.
From there, I’ll touch on many topics of the structure and dynamics of real complex networks including: Conditions for networks to exist in the first place, and how complex networks are a subset of complex systems; Optimal distribution and redistribution networks; Structure detection and the universality of pyramid schemes; Random bipartite networks and groups; Generating function techniques, their beauty and their limitations; Models of biological and social contagion on networks; and Why pandemics are so unpredictable.
I will address some controversial areas in branching networks (rivers and cardiovascular) and scale-free networks. I will explain why the longstanding field of graph theory did not anticipate the field of complex networks (words versus stories, time, becoming). Throughout, I will aim to give historical backgrounds, as well as emphasize several principles. The advent of the internet and easily shared large-scale datasets has marked a new era of science, and it’s why we have a field of complex networks. As such, keep measuring and examining the world. Do not force old network models on to new networks. Where possible, work towards the basic scientific goal of explicating mechanisms driving the generation of complex network phenomena. And for many problems that might seem to be simply networks, always consider the role and power of groups.
Expansions of the above and further material can be found in over a year’s worth of slides and videos in my two-semester course on Principles of Complex Systems:

Monday, 22 May, afternoon (14.30-17.30)
Network motifs (Stegehuis):  Network motifs, or subgraphs, can be seen as the building blocks of complex networks. In this lecture, we will investigate how models for complex networks help us extract knowledge from these subgraphs. In particular, I will focus on the use of optimization problems, comparing with real-world network data and new challenges in higher-order networks.

Tuesday, 23 May, morning (9.30-12.30)
Allotaxonometry, Ousiometrics, and Telegnomics — Measurement of complex systems, essential meaning, and stories (Dodds):  
Part 1. Allotaxonometry: The science and art of comparing complex systems.
Complex systems often comprise many kinds of components (types) which vary over many orders of magnitude in some kind of `size’: Populations of cities in countries, individual and corporate wealth in economies, species abundance in ecologies, word frequency in natural language, and node degree in complex networks.
I’ll outline ‘allotaxonometry’ along with ‘rank-turbulence divergence’ (RTD), a tunable instrument for comparing any two (Zipfian) ranked lists of components, as well as a related-but-different instrument in ‘probability-turbulence divergence’ (PTD). I’ll argue that RTD enables a most general comparison, as we need only ranks of components, and the ubiquitous use of rankings makes RTD powerfully interpretable.
I will motivate and outline the analytic development of rank-turbulence divergence. I will then explain a rank-based ‘allotaxonograph’ which pairs a map-like histogram for rank-rank pairs with an ordered list of components according to divergence contribution. We then build allotaxonographs to display RTD and PTD, incorporating for the latter a way to visually accommodate zero probabilities for ‘exclusive types’ which are types that appear in only one system. Allotaxonographs show how our divergences are instruments of a general machinery of type (or lexical) calculus.
I’ll go over the performances of RTD and PTD for a series of distinct settings including: Language use on Twitter and in books, species abundance in ecology, baby name popularity, market capitalization, performance in sports, mortality causes, and job titles. I’ll also show how probability-turbulence divergence either explicitly or functionally generalizes many existing kinds of distances.
Part 2. Ousiometrics and Telegnomics: The distant and computational measurement of essential meaning, history, and stories.
We define ‘ousiometrics’ to be the study of essential meaning in whatever context that meaningful signals are communicated, and ‘telegnomics’ as the study of remotely sensed knowledge. By re-examining first types and then tokens for the English language, and through the use of automatically annotated histograms — ‘ousiograms’— we uncover that:
1. The essence of meaning conveyed by words is instead best described by a compass-like plane with major axes of powerful-weak and dangerous-safe;
2. Analysis of a disparate collection of large-scale English language corpora — literature, news, Wikipedia, talk radio, and social media — shows that natural language exhibits a systematic bias toward safe, low danger words — a reinterpretation of the Pollyanna principle’s positivity bias for written expression.
I will connect these findings to our longstanding hedonometer project which we will also briefly explore. Happiness = Safety + Power.
I will outline our prototype ‘ousiometer’, a telegnomic instrument that measures ousiometric time series for temporal corpora.
I will show that the power-danger (PD) framework appears in other disparate venues including the distribution of character types in stories, discuss ousiometrics versus information entropy, and indicate an array of possible future work.
I will also touch on several kinds of distant story measurement including: dynamics of raw fame; computational historical timeline reconstruction; collective chronopathy, how time flies and crawls; and the ascent of K-Pop.
Related online instruments, visualizations, and exploratoria:

Tuesday, 23 May, afternoon
no lectures

Wednesday, 24 May, morning (9.30-12.30)
Spreading dynamics I (Priesemann)Spreading dynamics is ubiquitous: activity spreads in neural networks, news and fake news in social networks, and just recently the spread of a novel virus has disrupted the daily lives of people around the globe. We will first introduce two basic, complementary frameworks that describe such spreading dynamics: Stochastic processes, e.g. branching processes can capture the characteristic exponential growth and can account for the high variability. For large populations, a mean-field description via compartmental models can become very useful. We then show how these approaches help us to understand the “mechanics ” of pandemic spread and mitigation. In the last part, we focus on the key feature of all these living networks, i.e. that the connections between neurons or interactions between agents are not static, but change systematically over time. In neural networks, this is essential to implement learning, for the pandemic it was key to mitigating the spread of SARS-CoV-2. We derive the principles of self-organization in these diverse networks, show under which conditions phase transitions and critical phenomena occur, and how these can help to optimize information flow.

Wednesday, 24 May, afternoon (14.30-17.30)
Spreading dynamics II (Bansal): Mathematical models of infectious disease dynamics typically focus on relationships between aggregated state variables while smoothing over individual-level variability. But approaches of network epidemiology that incorporate individual heterogeneity in transmission have made important contributions to public health. We will (a) derive some fundamental theoretical models of spreading dynamics on networks that allow for modeling heterogeneity and targeting interventions; (b) review how network modeling approaches have helped develop an understanding of the relationship between structure and function; and (c) discuss some applied case studies including the use of network approaches to identify super-spreading individuals in the transmission of pathogens such as SARS and H1N1 influenza, quantify transmission risk for pathogens such as HIV and gonorrhea, and intervention design for pathogens in livestock systems.

Wednesday, 24 May, evening (20.00)
social dinner

Thursday, 25 May, morning (9.30-12.30)
short talks by students

Thursday, 25 May, afternoon
no lectures

Friday, 26 May, morning (9.30-12.30)
Inter-industry labour flow networks (O’Clery):  There is an emerging consensus in the economic development literature that locally embedded capabilities and industrial know-how are key determinants of growth and diversification processes. In order to model these dynamics as a branching process, whereby industries grow as a function of the availability of related or relevant skills, inter-industry labour flow networks are typically employed. Existing models, however, typically deploy a local or ‘nearest neighbour’ approach to capture the size of the labour pool available to an industry in related sectors. This approach, however, ignores higher order interactions in the network, and the presence of industry clusters or groups of industries which exhibit high internal skill overlap. We argue that these clusters represent skill basins in which workers circulate and diffuse knowledge, and delineate the size of the skilled labour force available to an industry. In a first study, we combine multi-scale community detection with an econometric model to uncover the optimal scale at which labour pooling operates. In a second study, we investigate the extent to which these networks differ in community structure across countries by developing a new bi-directional method to compare the modular structure of a pair of node-aligned networks.

Friday 26 May, afternoon (14.30-17.30)
Urban complex systems (Arcaute):  In this lecture we will look at urban systems from the perspective of complexity science. Some of the characteristics that these systems present are emergent spatial patterns, such fractals among others. These can be derived from physical but also social and economic phenomena. Within this lecture, we will review some of the fundamental aspects and frameworks of urban complexity science. In particular, we will construct different types of spatial networks that will help us identify different characteristics, such as the hierarchical organisation of regions and countries, and the observed heterogeneities and inequalities in the functioning of cities. We will look at physical transport networks and their flows, and introduce relevant measures, such as accessibility. We will also construct networks representing proxies for interaction between areas or communities that will help us identify the above-mentioned spatial patterns.