The Friendship Paradox for Sparse Random Graphs

Explore the intriguing concept of the Friendship Paradox in sparse random graphs through this 53-minute lecture by Frank den Hollander at the International Centre for Theoretical Sciences. Delve into the structural properties of random networks and their applications in social network analysis. Learn how this paradox relates to the NETWORKS program, a 10-year initiative funded by the Dutch government to advance network science research. Gain insights into the collaborative efforts between Dutch and Indian researchers in probability theory, computer science, optimization techniques, and statistics. Discover how this lecture contributes to a broader discussion on topics such as dynamics on networks, interacting particle systems, percolation, random matrices, and their real-world applications in finance, big data analysis, and social network modeling.