Probabilistic combinatorics: Properties of large networks

点击翻译按钮获取中文摘要

This project aims to analyse important real-world network properties such as robustness and reliability, investigate the performance of network algorithms such as message propagation, and solve 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. The intended outcome is improved understanding of properties of real networks, including robustness and message propagation performance. It should provide better knowledge of the evolutionary behaviour of large growing networks, relevant to a world that is influenced greatly by the Internet.