Temporal Networks, Where Page Rank meets Lord of the Rings - Computerphile
Community Score: 50% | 1.4K views | 2mo
0 community ratings: null thumbs up, null thumbs down
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
Tags: computers, computerphile, computer, science
More from Computerphile
- Digital Signal Processing With Audio Data - Computerphile — Score: 50%
- Network Basics - Transport Layer and User Datagram Protocol Explained - Computerphile — Score: 50%
- Generating 3D Models with Diffusion - Computerphile — Score: 50%
- Implementing Passkeys in Practice - Computerphile — Score: 50%
- LLMs and Newcomb's Problem - Computerphile — Score: 50%
- Do Computer Scientists Prefer Tea or Coffee? (Microphone Sound Check Question 2025) - Computerphile — Score: 50%