Coursera Flash Sale
40% Off Coursera Plus for 3 Months!
Grab it
Explore a 15-minute conference talk by Ziad Ismaili Alaoui from the University of Liverpool on "Succinct Preferential-Attachment Graphs" presented at the International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2025). Taking place on May 8, 2025, at the Fields Institute, this presentation delves into mathematical models of preferential attachment in graph theory, which are crucial for understanding network growth patterns where new nodes connect to existing nodes with probabilities proportional to their current connectivity. Learn about innovative succinct representations of these complex network structures that enable more efficient storage and analysis of large-scale graphs.
