How can we understand the underlying structure of a large-scale network? Which local constraints determine an algorithm’s running time? In recent years, ideas inspired by physics have proved fruitful in tackling such questions. Central to this approach is the notion of a phase transition: a sudden change in macroscopic behaviour (for example, matter shifting from solid to liquid at a critical temperature) in models governed by local interactions.
We aim to connect the combinatorics, algorithms, and probability communities through this lens. This will be pursued through three interactive four-day workshops focused on problem-solving and collaboration.
