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.