Temporal Networks, Where Page Rank meets Lord of the Rings - Computerphile
Summary
This video from Computerphile explains temporal networks and the PageRank algorithm, demonstrating how time is a crucial factor in analyzing network connections. It is valuable educational content for students and educators delving into the foundational computer science and algorithmic concepts that underpin many AI and machine learning applications, such as recommendation systems, knowledge graphs, and dynamic network analysis.
Description
When considering how things connect together in a network, time can be an extremely important factor. Dr Richard G Clegg of Queen Mary University London takes us through networks using Page rank and Lord of the Rings. nb. this film contains two fellas getting the facts of Lord of the Rings wrong on multiple occasions, we look forward to the inevitable comments. Richard's github: https://github.com/richardclegg/computerphile_demos/ The open source software Richard mentioned can be found at https://raphtory.com Computerphile is supported by Jane Street. Learn more about them (and exciting career opportunities) at: https://jane-st.co/computerphile This video was filmed and edited by Sean Riley. Computerphile is a sister project to Brady Haran's Numberphile. More at https://www.bradyharanblog.com
