The Complementary Program has a limited number of memberships that are open to mathematicians whose interests are not closely related to the core programs; special consideration is given to mathematicians who are partners of an invited member of a core program. 

The minimum spanning tree of 100,000 uniformly random points. Colors encode graph distance from the root, which is red. Black points are those whose removal would disconnect at least 5% of the points from the rest.

This program is devoted to the study of the probabilistic and statistical properties of such networks. Central tools include graphon theory for dense graphs, local weak convergence for sparse graphs, and scaling limits for the critical behavior of graphs or stochastic processes on them. The program is aimed at pure and applied mathematicians interested in network problems.

Extremal combinatorics concerns itself with problems about how large or small a finite collection of objects can be while satisfying certain conditions. Questions of this type arise naturally across mathematics, so this area has close connections and interactions with a broad array of other fields, including number theory, group theory, model theory, probability, statistical physics, optimization, and theoretical computer science.

Recovering communities in a network.

In a growing number of applications, one needs to analyze and interpret data coming from massive networks. The statistical problems arising from such applications led to important mathematical challenges: building novel probabilistic models, understanding the possibilities and limitations for statistical detection and inference, designing efficient algorithms, and understanding the inherent limitations of fast algorithms. The workshop will bring together leading researchers in combinatorial statistics, machine learning, and random graphs in the hope of cross-fertilization of ideas.