This workshop brings together experts in combinatorics, probability theory, statistics, information theory, and computational topology sharing a common interest: graphs. Key forms of discrete-valued data, graphs extend to flexible and complex generalisations, such as hypergraphs and simplicial complexes. Their study requires a multidisciplinary arsenal of tools from the aforementioned disciplines. This rich area of research encompasses multiple topics, such as matrix inference, random graphs, graph limits, graphon games and topological data analysis, to mention a few. Our aim is to strengthen the graphs-related scientific community by promoting the creation of bridges between the different perspectives on the topic that each area of expertise brings.
Confirmed Speakers:
- Ginestra Bianconi, Queen Mary University of London
- Christian Borgs, University of California Berkeley
- François Caron, University of Oxford
- Sourav Chatterjee, Stanford University
- Remco van der Hofstad, TU Eindhoven
- Mihyun Kang, TU Graz
- Dmitri Krioukov, Northeastern University
- Raffaella Mulas, Vrije Universiteit Amsterdam
- Sofia Olhede, EPFL
- Peter Orbanz, UCL
- Francesca Parise, Cornell University
- János Pach, Alfréd Rényi Institute of Mathematics
- Tiago Peixoto, Central European University
- Giovanni Petri, CENTAI
- Patrick Rubin-Delanchy, University of Bristol
- Vincent Tassion, ETH Zürich
- Perla Sousi, University of Cambridge
- Balázs Szegedy, Alfréd Rényi Institute of Mathematics
More information, including confirmed speakers, the schedule and registration available at drs23.epfl.ch.
