How to amaze your friends the link between mazes, murder and organised crime Chris Budd Chris Budd.

Slides:



Advertisements
Similar presentations
CSE 211 Discrete Mathematics
Advertisements

Peer-to-Peer and Social Networks Power law graphs Small world graphs.
Complex Networks: Complex Networks: Structures and Dynamics Changsong Zhou AGNLD, Institute für Physik Universität Potsdam.
Complex Networks Advanced Computer Networks: Part1.
Scale Free Networks.
Algorithmic and Economic Aspects of Networks Nicole Immorlica.
22C:19 Discrete Math Graphs Fall 2010 Sukumar Ghosh.
Introduction to Graph Theory Instructor: Dr. Chaudhary Department of Computer Science Millersville University Reading Assignment Chapter 1.
22C:19 Discrete Math Graphs Fall 2014 Sukumar Ghosh.
Midwestern State University Department of Computer Science Dr. Ranette Halverson CMPS 2433 – CHAPTER 4 GRAPHS 1.
Emergence of Scaling in Random Networks Albert-Laszlo Barabsi & Reka Albert.
Introduction to Graphs
Analysis and Modeling of Social Networks Foudalis Ilias.
It’s a Small World by Jamie Luo. Introduction Small World Networks and their place in Network Theory An application of a 1D small world network to model.
Section 14.1 Intro to Graph Theory. Beginnings of Graph Theory Euler’s Konigsberg Bridge Problem (18 th c.)  Can one walk through town and cross all.
Online Social Networks and Media Navigation in a small world.
School of Information University of Michigan Network resilience Lecture 20.
BY: MIKE BASHAM, Math in Scheduling. The Bridges of Konigsberg.
VL Netzwerke, WS 2007/08 Edda Klipp 1 Max Planck Institute Molecular Genetics Humboldt University Berlin Theoretical Biophysics Networks in Metabolism.
9.2 The Traveling Salesman Problem. Let us return to the question of finding a cheapest possible cycle through all the given towns: We have n towns (points)
CSE 522 – Algorithmic and Economic Aspects of the Internet Instructors: Nicole Immorlica Mohammad Mahdian.
Emergence of Scaling in Random Networks Barabasi & Albert Science, 1999 Routing map of the internet
Small-World Graphs for High Performance Networking Reem Alshahrani Kent State University.
Small Worlds Presented by Geetha Akula For the Faculty of Department of Computer Science, CALSTATE LA. On 8 th June 07.
Mining and Searching Massive Graphs (Networks)
Scale Free Networks Robin Coope April Abert-László Barabási, Linked (Perseus, Cambridge, 2002). Réka Albert and AL Barabási,Statistical Mechanics.
1 Discrete Structures & Algorithms Graphs and Trees: II EECE 320.
Peer-to-Peer and Grid Computing Exercise Session 3 (TUD Student Use Only) ‏
An Euler Circuit is a cycle of an undirected graph, that traverses every edge of the graph exactly once, and ends at the same node from which it began.
Global topological properties of biological networks.
Math 105: Problem Solving in Mathematics. Course Description This course introduces students to the true nature mathematics, what mathematicians really.
1 Algorithms for Large Data Sets Ziv Bar-Yossef Lecture 7 May 14, 2006
How is this going to make us 100K Applications of Graph Theory.
MATH 310, FALL 2003 (Combinatorial Problem Solving) Lecture 5,Wednesday, September 10.
22C:19 Discrete Math Graphs Spring 2014 Sukumar Ghosh.
Graphs and Euler cycles Let Maths take you Further…
Discrete Math Round, Round, Get Around… I Get Around Mathematics of Getting Around.
Eulerian Circuits. A Warm Up Problem Jenny & John were at a Math Circles event with three other couples. As people arrived, various handshakes took place.
Programming for Geographical Information Analysis: Advanced Skills Online mini-lecture: Introduction to Networks Dr Andy Evans.
EECS 203: It’s the end of the class and I feel fine. Graphs.
1 Excursions in Modern Mathematics Sixth Edition Peter Tannenbaum.
Class 2: Graph theory and basic terminology Learning the language Network Science: Graph Theory 2012 Prof. Albert-László Barabási Dr. Baruch Barzel, Dr.
© Nuffield Foundation 2011 Nuffield Free-Standing Mathematics Activity Chinese postman problems What route can I take to avoid going along the same street.
Structures 7 Decision Maths: Graph Theory, Networks and Algorithms.
CSE 20: Discrete Mathematics for Computer Science Prof. Shachar Lovett.
COLOR TEST COLOR TEST. Social Networks: Structure and Impact N ICOLE I MMORLICA, N ORTHWESTERN U.
Online Social Networks and Media
Week 11 - Monday.  What did we talk about last time?  Binomial theorem and Pascal's triangle  Conditional probability  Bayes’ theorem.
Professor Yashar Ganjali Department of Computer Science University of Toronto
Networks Igor Segota Statistical physics presentation.
Lecture 10: Network models CS 765: Complex Networks Slides are modified from Networks: Theory and Application by Lada Adamic.
Aim: What is an Euler Path and Circuit?
Topics Paths and Circuits (11.2) A B C D E F G.
A connected simple graph is Eulerian iff every graph vertex has even degree. The numbers of Eulerian graphs with, 2,... nodes are 1, 1, 2, 3, 7, 16, 54,
Euler Paths and Circuits. The original problem A resident of Konigsberg wrote to Leonard Euler saying that a popular pastime for couples was to try.
Excursions in Modern Mathematics, 7e: Copyright © 2010 Pearson Education, Inc. 5 The Mathematics of Getting Around 5.1Euler Circuit Problems 5.2What.
M Clements Formal Network Theory. Introduction Practical problem – The Seven Bridges of Königsberg Network graphs Nodes & edges Degrees Rules/ axioms.
Class 2: Graph Theory IST402. Can one walk across the seven bridges and never cross the same bridge twice? Network Science: Graph Theory THE BRIDGES OF.
Konisberg Bridges (One-way street) SOL: DM.2 Classwork Quiz/worksheet Homework (day 62) worksheet.
Class 2: Graph Theory IST402.
Teachers Teaching With Technology 2010 Annual Meeting - Atlanta, GA Ray Barton, Olympus High, SLC, UT.
Abstract Networks. WWW (2000) Scientific Collaboration Girvan & Newman (2002)
1 Euler and Hamilton paths Jorge A. Cobb The University of Texas at Dallas.
Grade 11 AP Mathematics Graph Theory Definition: A graph, G, is a set of vertices v(G) = {v 1, v 2, v 3, …, v n } and edges e(G) = {v i v j where 1 ≤ i,
Introduction to Graph & Network Theory Thinking About Networks: From Metabolism to the Genome to Social Conflict Summer Workshop for Teachers June 27 th.
Hiroki Sayama NECSI Summer School 2008 Week 2: Complex Systems Modeling and Networks Network Models Hiroki Sayama
Lecture 1: Complex Networks
Learning to Generate Networks
Discrete Maths 9. Graphs Objective
From the Synthetic networks slide deck (didn’t have a chance to go over them at that time) By: Ralucca Gera, NPS.
Presentation transcript:

How to amaze your friends the link between mazes, murder and organised crime Chris Budd Chris Budd

Most maths is taught as a subject which is Precise Careful Safe Logical Today we will look at combining maths and Murder Suicide Love Conquest Crime How an ancient idea has 21st Century applications!

The Minotaur Who does this remind you of?

Cretan Labyrinth

Seed for the Cretan Labyrinth: an example of a space filling curve. Alumni Investigation: which seeds lead to which types of labyrinth?

Ancient stone labyrinth Alumni Project: Build one of these in your garden

Mappa Mundi Maiden Castle Alumni Field Trip: Visit one of these

The rise of the maze Maze at Hatfield House

Hampton Court Maze Alternative Alumni Field Trip: Visit one of these and lose your family and friends

How to solve a maze and amaze your friends: I Method one.. The hand on the hedge method X Always keep turning left (or right)

X X Add more hedges

If a bird can walk on a hedge from the entrance to the centre then you can solve the maze using the hand on the hedge method Alumni Challenge: Prove this using an inductive argument

To solve a more general maze we need to learn about Networks Bridges of Konigsberg A B D C Euler and friend

Network Even Node Odd Node Edge

Euler Circuit Can we find a route through the network which passes through each edge once and only once? Theorem: 1.Always if the network only has even nodes 2. Yes, if the network has two odd nodes, starting and finishing at an odd node 3. Otherwise never Proof: Tricky, but leads to a way to crack a maze

A B C A B C D D E E F F G G H I H I J J K K L L M M N N Centre Maze Network

A B C D E F G H I J K L M N Centre More generally.. Double up each of the paths Apply the Euler circuit theory

Using a network and some peanuts you can solve any maze Start at the entrance and take any path If you come to a new node then leave a peanut and take any new path If you come to an old node (or the end of a blind alley) and you are on a new path then turn back along this path If you come to an old node and you are on an old path then take a new path (or another old path if no new path exists) Never go down a path more than twice Alumni Challenge 2: Try this and Good Luck!

Networks have many other applications Social: Friendship, Sexual partners, FACEBOOK Organisational: Management, crime Technological: World-wide-web, Internet, power grid Information: DNA, Protein-Protein, Citations, word-of- mouth, gossip, retail Ecological: Food chains, disease & infection Moreno 1934 Systematic study of networks is a key application of maths to the 21st Century!!!

Friends (social network) Bob MaryDave Alice Richard Basil Chloe Six degrees of separation??

School social network in USA

The Internet/world-wide-web Google exploits features of this to work, especially using the page-rank algorithm and eigenvalues of the adjacency matrices

Food web Scientific collaborations Sexual contacts

Different types of network developed to model various situations : this is what mathematicians do with their time …. Random: Erdos- Renyi Small-world: Watts-Strogatz (social) Barabasi-Albert: Internet, World-wide-web, Facebook

Mathematical features of a network : Nodal degree: Number of edges k attached to a node Proportion: P(k) probability a node has degree k Scaling laws and scale free networks: Random network but more often see Network resilience: How does the network connectivity eg. The average path length/node degree change as nodes/edges are removed? Understanding this is vital to the study of disease, power generation and to ….

Organised crime! How can we break up a crime network?

Method 1: Delete members at random at each time step

Method 2. Attack the member towards whom the previous victim had the highest degree of attachment. Assume that all victims are arrested, not murdered, and they inform the police of the person they most respect/trust/know.

Finally …Facebook Friends.. An amazing result!

Conclusions: Networks are a fascinating area of maths With a rich history which we can explore And great relevance to many aspects of the modern world including crime Which have the potential for almost limitless investigations, field trips and construction projects Truly they are a way to amaze your friends!

Networks lead naturally to interesting mathematical investigations of great practical relevance 1.Shortest distance l between two nodes: lowest number of nodes between them 6 degrees max of separation is claimed ?? Is this really true ?? 2.Degree of a node = number of edges that meet the node ?? What proportion p of nodes have degree k ??

p k