Generational Random Graphs – Professor Jon Crowcroft

Explore generational random graphs in this 51-minute talk by Professor Jon Crowcroft at the Alan Turing Institute. Delve into a simple model for small-world-like graphs that goes beyond single-parameter characterization, offering potential insights into heterogeneity and time-variation in networks. Learn about scalable multicast routing, traffic management, and end-to-end protocol design as applied to graph theory, networks, and social media analytics. Examine topics such as opportunistic communications, social networks, and infrastructure-free mobile systems. Discover the "build and learn" research paradigm while exploring concepts like ER Bacon Sabbath, mean paths, preferential attachment, beta models, degree distribution, and the natural fit of generational networks in various contexts including coauthorship, business relationships, and regional networks.

Intro
Generational networks
Coauthorship networks
ER Bacon Sabbath
Examples
Why Graphs
Generations
Coauthorship
Business relationships
Regional networks
Mean paths
preferential attachment
beta model
degree distribution
change to model
the gene
the natural fit