Temporal Networks, Where Page Rank meets Lord of the Rings - Computerphile @Computerphile
Temporal Networks, Where Page Rank meets Lord of the Rings - Computerphile  @Computerphile
Uploaded March 2026 | Updated November 2026, 3 hours ago
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: github.com/richardclegg/computerphile_demos

The open source software Richard mentioned can be found at raphtory.com

Computerphile is supported by Jane Street. Learn more about them (and exciting career opportunities) at: 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 bradyharanblog.com
Temporal Networks, Where Page Rank meets Lord of the Rings - ComputerphilePost Quantum Cryptography - ComputerphileBug in Binary Search - ComputerphileCyclic Redundancy Check (CRC) - ComputerphileTrue Random Numbers - ComputerphileZip It! - Finding File Similarity Using Compression Utilities - ComputerphileWhy Information Theory is Important - ComputerphileLLMs and Newcombs Problem - ComputerphileGarbage Collection (Mark & Sweep) - ComputerphileRecreating ITS - Computerphile?PHP Problem? - ComputerphileMikeBot3000: Can We Build an AI Mike from Open Source Tools? - Computerphile
Computerphile |

Temporal Networks, Where Page Rank meets Lord of the Rings - Computerphile

SHARE TO X SHARE TO REDDIT SHARE TO FACEBOOK WALLPAPER