morning (9.30-12.30)
Introduction to complex networks (Airoldi):
Networks are ubiquitous in science and have become a focal point for discussion in everyday life. Formal statistical models for the analysis of network data have emerged as a major topic of interest in diverse areas of study, and most of these involve a collections of measurements on pairs of objects. Probability models on graphs date back to 1959. Along with empirical studies in social psychology and sociology from the 1960s, these early works generated an active “network community” and a substantial literature in the 1970s. This effort moved into the statistical literature in the late 1970s and 1980s, and the past decade has seen a burgeoning network literature in statistical physics and computer science. The growth of the World Wide Web and the emergence of online “networking communities” such as Facebook and LinkedIn, and a host of more specialized professional network communities has intensified interest in the study of networks and network data. In this workshop, I will review a few ideas that are central to this burgeoning literature. I will emphasize formal model descriptions, and pay special attention to the interpretation of parameters and their estimation. I will conclude by describing open problems and challenges for machine learning and statistics.

RELATED PAPERS:

– https://arxiv.org/abs/0912.5410
– https://www.jmlr.org/papers/v9/airoldi08a.html
– https://proceedings.mlr.press/v22/azari12.html
– https://proceedings.neurips.cc/paper/2013/hash/b7b16ecf8ca53723593894116071700c-Abstract.html
– https://proceedings.mlr.press/v32/chan14.html

afternoon (14.30-17.30)
Machine learning and signal processing on graphs and networks (Schaub):
In this lecture we will provide a short introduction to machine learning on graphs and graph signal processing, covering both the fundamental theory as well as more pragmatic aspects and some future directions.

morning (9.30-12.30)

Design and analysis of experiments on social, healthcare and information networks (Airoldi): Designing experiments that can estimate causal effects of an intervention when the units of analysis are connected through a network is the primary interest, and a major challenge, in many modern endeavors at the nexus of science, technology and society. Examples include HIV testing and awareness campaigns on mobile phones, improving healthcare in rural populations using social interventions, promoting standard of care practices among US oncologists on dedicated social media platforms, gaining a mechanistic understanding of cellular and regulation dynamics in the cell, and evaluating the impact of tech innovations that enable multi-sided market platforms.  A salient technical feature of all these problems is that the response(s) measured on any one unit likely also depends on the intervention given to other units, a situation referred to as “interference” in the parlance of statistics and machine learning. Importantly, the causal effect of interference itself is often among the inferential targets of interest. On the other hand, classical approaches to causal inference largely rely on the assumption of “lack of interference”, and/or on designing experiments that limit the role interference as a nuisance. Classical approaches also rely on additional simplifying assumptions, including the absence of strategic behavior, that are untenable in many modern endeavors.   In the technical portion of this talk, we will formalize issues that arise in estimating causal effects when interference can be attributed to a network among the units of analysis, within the potential outcomes framework. We will introduce and discuss several strategies for experimental design in this context centered around a useful role for statistics and machine learning models. In particular, we wish for certain finite-sample properties of the estimator to hold even if the model catastrophically fails, while we would like to gain efficiency if certain aspects of the model are correct. We will then contrast design-based, model-based and model-assisted approaches to experimental design from a decision theoretic perspective.

RELATED PAPERS:
– https://www.science.org/doi/10.1126/science.adi5147
– https://academic.oup.com/biomet/article/105/4/849/5066791
– https://www.pnas.org/doi/full/10.1073/pnas.2208975119

afternoon (14.30-17.30)
No lectures

morning (9.30-12.30)

Computational social science /1 (Gonzalez-Bailon): abstract TBD

afternoon (14.30-17.30)

Short talks by students

evening (20.00)

Social dinner

morning (9.30-12.30)

Computational social science /2 (Teixeira): abstract TBD

afternoon

No lectures

morning (9.30-12.30)

Computational social science /3 (Garcia): abstract TBD

afternoon (14.30-17.30)

Complex networks in ecological systems (Suweis):
In these lecture, we will explore the pivotal role of ecological networks in shaping the coexistence and stability of ecological communities. We will begin by examining how the structure and complexity of these networks contribute to the coexistence of species and the resilience of ecosystems in the face of perturbations. Building on this foundation, we will delve into the importance of considering the inherently dynamic nature of ecological networks, highlighting how interactions among species can change over time in response to both internal and external factors. By integrating both static and dynamic perspectives, these session aim to provide a comprehensive understanding of the mechanisms that govern ecological stability and the adaptive responses of communities to shifting conditions. This approach underscores the need for embracing temporal dynamics as a fundamental aspect of ecological network analysis.