Mapping Networks Or, the costs and benefits of abstraction.

Slides:



Advertisements
Similar presentations
22C:19 Discrete Math Graphs Fall 2010 Sukumar Ghosh.
Advertisements

The 7 Bridges of Konigsberg A puzzle in need of solving.
Chapter 7 Graph Theory 7.1 Modeling with graphs and finding Euler circuits. Learning Objectives: Know how to use graphs as models and how to determine.
Lecture 21 Paths and Circuits CSCI – 1900 Mathematics for Computer Science Fall 2014 Bill Pine.
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.
AMDM UNIT 7: Networks and Graphs
BY: MIKE BASHAM, Math in Scheduling. The Bridges of Konigsberg.
Euler Circuits and Paths
The Seven Bridges Of Konigsberg.
Koenigsberg bridge problem It is the Pregel River divided Koenigsberg into four distinct sections. Seven bridges connected the four portions of Koenigsberg.
A Presentation By: Jillian Minuto Troy Norman Alan Leggett Group Advisor: Prof. G. Warrington Graph Theory.
Representing Graphs Wade Trappe. Lecture Overview Introduction Some Terminology –Paths Adjacency Matrix.
IEOR266 © Classification of MCNF problems.
Introduction to Networks HON207. Graph Theory In mathematics and computer science, graph theory is the study of graphs, mathematical structures used to.
MATH 310, FALL 2003 (Combinatorial Problem Solving) Lecture 5,Wednesday, September 10.
Graphs. Graph A “graph” is a collection of “nodes” that are connected to each other Graph Theory: This novel way of solving problems was invented by a.
Chapter 11 Graphs and Trees This handout: Terminology of Graphs Eulerian Cycles.
Graphs and Euler cycles Let Maths take you Further…
Eulerian Graphs CSE 331 Section 2 James Daly. Reminders Project 3 is out Covers graphs Due Friday.
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.
The Bridge Obsession Problem By Vamshi Krishna Vedam.
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.
Can you find a way to cross every bridge only once?
Chapter 15 Graph Theory © 2008 Pearson Addison-Wesley.
EECS 203: It’s the end of the class and I feel fine. Graphs.
1 Starter of the day 23 x 27 = x 47 = x 87 = x 55 = x 58 = ???? 54 x 56 = ???? Can you spot the trick for this group of.
© 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.
Can you connect the dots as shown without taking your pen off the page or drawing the same line twice.
Euler and Hamilton Paths. Euler Paths and Circuits The Seven bridges of Königsberg a b c d A B C D.
Chapter 2: Graphs and Networks Lesson 2: Hello Mr Euler…
Week 11 - Monday.  What did we talk about last time?  Binomial theorem and Pascal's triangle  Conditional probability  Bayes’ theorem.
Lecture 14: Graph Theory I Discrete Mathematical Structures: Theory and Applications.
Konigsburg Bridge Problem The Konigsberg Bridge problem is a famous mathematical problem studied by many students in geometry.
One day a guy approached us with a puzzle he has been pondering on for approximately seven years. He called this the ‘Walls and Lines Puzzle’.
Introduction to Graph Theory
Graphs, Paths & Circuits
Aim: What is an Euler Path and Circuit?
Topics Paths and Circuits (11.2) A B C D E F G.
Graphs Edge(arc) Vertices can be even or odd or undirected (two-way) Edges can be directed (one-way) This graph is connected. Degree(order) = 3 Odd vertex.
1.5 Graph Theory. Graph Theory The Branch of mathematics in which graphs and networks are used to solve problems.
EASTERN MEDITERRANEAN UNIVERSITY EE 529 Circuit and Systems Analysis Lecture 2 Mustafa Kemal Uyguroğlu.
Discrete Mathematical Structures: Theory and Applications
Graph Theory. A branch of math in which graphs are used to solve a problem. It is unlike a Cartesian graph that we used throughout our younger years of.
Vertex-Edge Graphs Euler Paths Euler Circuits. The Seven Bridges of Konigsberg.
Associated Matrices of Vertex Edge Graphs Euler Paths and Circuits Block Days April 30, May 1 and May
Graph theory and networks. Basic definitions  A graph consists of points called vertices (or nodes) and lines called edges (or arcs). Each edge joins.
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.
Eulerian Paths and Cycles. What is a Eulerian Path Given an graph. Find a path which uses every edge exactly once. This path is called an Eulerian Path.
The Seven Bridges of Konigsberg (circa 1735) In Konigsberg, Germany, a river ran through the city such that in its centre was an island, and after passing.
Lecture 52 Section 11.2 Wed, Apr 26, 2006
Lecture 11: 9.4 Connectivity Paths in Undirected & Directed Graphs Graph Isomorphisms Counting Paths between Vertices 9.5 Euler and Hamilton Paths Euler.
Chapter 6: Graphs 6.1 Euler Circuits
Review Euler Graph Theory: DEFINITION: A NETWORK IS A FIGURE MADE UP OF POINTS (VERTICES) CONNECTED BY NON-INTERSECTING CURVES (ARCS). DEFINITION: A VERTEX.
M Clements Formal Network Theory. Introduction Practical problem – The Seven Bridges of Königsberg Network graphs Nodes & edges Degrees Rules/ axioms.
Graph Theory Euler Paths and Euler Circuits. Euler Paths & Circuits Euler Paths and Euler Circuits (Euler is pronounced the same as Oiler) An Euler path.
STARTER: CAN YOU FIND A WAY OF CROSSING ALL THE BRIDGES EXACTLY ONCE? Here’s what this question would look like drawn as a graph.
Week 7 - Monday CS 113.
Graph theory. Graph theory Leonard Euler (“Oiler”)
Euler Paths and Circuits
Konigsberg’s Seven Bridges
Euler Paths and Circuits
This unit is all about Puzzles Games Strategy.
Introduction to Graph Theory Euler and Hamilton Paths and Circuits
Konigsberg- in days past.
Decision Maths Graphs.
Graph Theory What is a graph?.
Graphs, Paths & Circuits
CHAPTER 15 Graph Theory.
Chapter 10 Graphs and Trees
Presentation transcript:

Mapping Networks Or, the costs and benefits of abstraction

Mapping Networks What are Networks Elements of Network Mapping Schematic Maps

Networks, Defined What is a network?

Networks, Defined What is a network? An interconnected group or system a system of intersecting lines or channels; "a railroad network"; "a network of canals” Networks are important in geography and mapping

Elements of Networks Networks are a collection of: Nodes AKA: Vertices Edges AKA: Links

Early Quantitative Geography The Seven Bridges of Königsberg Famous network problem based on an actual place (An urban riddle) Let’s try and solve the riddle…

The city of Königsberg is set on the Pregel River. The city included 2 large islands and was connected to the mainland by exactly 7 large bridges Is it possible to walk a route that crosses each bridge exactly once?

The problem becomes simpler with abstraction….

So, what’s the solution? There is no solution! It is impossible. In 1736, Leonhard Euler proved it impossible Formulated solution in terms of “graph theory” Eliminated all features except land masses and the bridges (nodes, edges)

A Eulerian Path A solution did not exist Problem concerned degrees of nodes Degree of a node is the number of edges touching it Konisberg: 1 5-degree node, 3 3-degree nodes Euler proved that a “circuit” is only possible if there are exactly 0 or 2 nodes of an odd degree This type of walk is called a Eulerian Path

Harry Beck Electrical Draftsman, English, Created the most famous network map of all-time What is it?

Beck’s Original

Direct descendents

The “Tube Map” Network Map of the London Underground A Schematic Diagram More Topological than Geographic

Tube Map Emphasizes connectivity over geographic congruence How?

Octilinearity Every line on the map is drawn in one of 8 directions Multiples of 45 degrees Octilinearity Reduces geographic congruence, increases clarity

The Beck Map First drafts made between Designed in the form of the electrical circuitry diagrams of that time Style adopted worldwide Subway maps are among the most used network maps…

Dangers of the schematic style What are the dangers of the beck map?

Dangers of the schematic style What are the dangers of the beck map? Result in warped mental maps of actual geography Since distance and direction are inaccurate

Roman place-to-place maps

Peutinger’s Table

Speaking of routes……

1643 Matthew Simons in A Direction for the English Traviller pub. Thomas Jenner (distance tables by John Norden)

Santa Fe Trail Zebulon Pike Map of the "Santa Fe Trail" St. Louis: ca Manuscript map National Archives, Washington, D.C.

First map of the Arpanet

Map of the Internet

Conclusion “Graphs” are useful to simplify geographic spaces Sacrifices are made to achieve increased clarity