The (Non-Perfect) Mathematics of Trust
summary
Königsberg’s seven bridges become a clear claim: no path crosses each bridge once, proven by reducing landmasses to nodes and counting degrees. The same concrete tools reappear: de Bruijn graph for genome assembly (it yields a working human sequence), PageRank algorithm as a weighted-graph ranking that made search practical, and social-network measures that show $10 in 15 minutes can target vulnerable Facebook groups. The surprising counts—two billion users vs ~20,000 employees, seven down to five bridges—show what the math enables and where human judgment must step in.
AI-written summary · about
chapters (14)
- 0:00Start
- 0:10TECHNICAL INTEGRITY.
- 13:25Euler proved something impossible by proving what was possible.
- 14:00graph theory is all over computer science
- 14:23The Knight's Tour
- 15:44Cayley Graphs
- 16:36Google's PageRank Algorithm
- 17:29graph theory is all over the web
- 20:0811 We're all embedded in massive social networks that have massive influences on our well-being.
- 22:336 degrees of Kevin Bacon
- 25:19the sharing economy leverages our interconnectedness
- 25:56how we navigate our careers
- 29:44Trust is a (very) hard math problem.
- 30:56Whatever happened to Königsberg?
related talks
32mSynthesis, Simplification and Analysis of Biological Networks Using Higher Order Topological Connect
31mA Tale of Breadth-First Search
43mParadoxes and theorems every developer should know
32mTechnologists: how to make decisions for your organization and our society
01h 01mKeynote: Six Impossible Things
01h 17mWhen Less Is More: Designing & Decoding Complex Distributed Systems
36mKeynote: The Future of Software 
46mMeet the Social Side of Your Architecture