Temporal Networks, Where Page Rank meets Lord of the Rings - Computerphile
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/compu... 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

Is it Possible to Block Childrens' Access to Social Media? - Computerphile

Network Layers Model (Networking Basics) - Computerphile

If Prime Numbers Become Increasingly Rare, Then Why Do They Keep Showing Up In Pairs?

This is not the AI we were promised | The Royal Society

Inside Dyson’s Overengineered £1000 Hand Dryer

The Stein Paradox - Numberphile

TCP b : Additive Increase Multiplicative Decrease & 'Slow Start' - Computerphile

Co-Creator of Haskell: Why Learn Functional Programming, Useless vs Useful Languages | Simon Jones

The hidden logic behind #, @, & and §

What is Bootstrapping Anyway? - Computerphile

DeepSeek is a Game Changer for AI - Computerphile

Neil Turok on how theoretical physics went wrong and why universities don’t encourage originality

Reinventing Entropy | Compression is Intelligence Part 1

How The Imitation Game Got Alan Turing Wrong...

I Gave ChatGPT a Body

China's 1.4nm Breakthrough Terrifies America and Taiwan

Procedural Generation in Games - Computerphile

Astonishing discovery by computer scientist: how to squeeze space into time

Teenager Disproves 4 Decades Old Belief in Computing

