This talk will explore properties and algorithms pertaining to very large graphs. These graphs serve as models for a multitude of complex systems, showcasing traits like robustness, randomness, dynamics, and distinctiveness, while also sharing essential commonalities. Understanding these graphs’ fundamental characteristics, including low global density but high local density, degree distribution, low diameter, and clustering coefficient, is vital for analysing complex system behaviour. Complex systems research also addresses critical aspects such as partitioning populations into communities with shared behaviours and interests. The presentation will delve into the modelling of large graphs and discuss algorithms focused on community detection within them.
This video was produced by the International Centre for Mathematical Sciences, as part of the workshop UK-Vietnam mathematics joint meeting.
