Probabilistic combinatorics: Properties of large networks

The Project aims at analysing important real-world network properties such as robustness and reliability, and investigating the performance of network algorithms such as message propagation, as well as solving fundamental problems in probabilistic combinatorics. Random graphs are indispensable for modelling and analysing the growing Internet and many social networks, due to their large size and random nature. This makes the research highly significant. The intended outcome of the Project is a fundamentally improved understanding of properties of real networks, including robustness and message propagation performance.