Coursera Flash Sale
40% Off Coursera Plus for 3 Months!
Grab it
Learn about succinct data structures for preferential attachment graphs in this 27-minute conference talk by Sebastian Wild from the University of Marburg and University of Liverpool. Explore memory-efficient representations of preferential attachment networks, which are fundamental models in network science that capture the "rich get richer" phenomenon where nodes with higher degrees are more likely to attract new connections. Discover techniques for compressing these graph structures while maintaining efficient query operations, addressing the challenge of managing memory when dealing with large-scale network data. Gain insights into the theoretical foundations and practical applications of succinct graph representations in the context of preferential attachment models, understanding how to balance space efficiency with computational performance in network analysis algorithms.
