L11: Algebraic Path Problems with applications to Internet Routing Lecture 9
|
|
- Ethelbert Waters
- 5 years ago
- Views:
Transcription
1 L11: Algebraic Path Problems with applications to Internet Routing Lecture 9 Timothy G. Griffin timothy.griffin@cl.cam.ac.uk Computer Laboratory University of Cambridge, UK Michaelmas Term, 2017 tgg22 (cl.cam.ac.uk) L11: Algebraic Path Problems with applications to Internet T.G.Griffin Routingc 2017 Lecture 91 / 34 Widest shortest-paths Metric of the form pd, bq, where d is distance pmin, `q and b is capacity pmax, minq. Metrics are compared lexicographically, with distance considered first. Such things are found in the vast literature on Quality-of-Service (QoS) metrics for Internet routing. wsp sp ˆ bw tgg22 (cl.cam.ac.uk) L11: Algebraic Path Problems with applications to Internet T.G.Griffin Routingc 2017 Lecture 92 / 34
2 Widest shortest-paths 4 (1,100) (1,100) 0 (1,10) 1 (2,90) 2 (1,5) (1,100) 3 tgg22 (cl.cam.ac.uk) L11: Algebraic Path Problems with applications to Internet T.G.Griffin Routingc 2017 Lecture 93 / 34 Weights are globally optimal (we have a semiring) Widest shortest-path weights computed by Dijkstra and Bellman-Ford R » 0 p0, Jq p1, 10q p3, 10q p2, 5q p2, 10q 1 p1, 10q p0, Jq p2, 100q p1, 5q p1, 100q 2 p3, 10q p2, 100q p0, Jq p1, 100q p1, 100q 3 p2, 5q p1, 5q p1, 100q p0, Jq p2, 100q 4 p2, 10q p1, 100q p1, 100q p2, 100q p0, Jq fi ffi ffi ffi ffi fl tgg22 (cl.cam.ac.uk) L11: Algebraic Path Problems with applications to Internet T.G.Griffin Routingc 2017 Lecture 94 / 34
3 But what about the paths themselves? Four optimal paths of weight p3, 10q. P optimal p0, 2q tp0, 1, 2q, p0, 1, 4, 2qu P optimal p2, 0q tp2, 1, 0q, p2, 4, 1, 0qu There are standard ways to extend Bellman-Ford and Dijkstra to compute paths (or the associated next hops). Do these extended algorithms find all optimal paths? tgg22 (cl.cam.ac.uk) L11: Algebraic Path Problems with applications to Internet T.G.Griffin Routingc 2017 Lecture 95 / 34 Surprise! Four optimal paths of weight p3, 10q P optimal p0, 2q tp0, 1, 2q, p0, 1, 4, 2qu P optimal p2, 0q tp2, 1, 0q, p2, 4, 1, 0qu Paths computed by (extended) Dijkstra P Dijkstra p0, 2q tp0, 1, 2q, p0, 1, 4, 2qu P Dijkstra p2, 0q tp2, 4, 1, 0qu Notice that 0 s paths cannot both be implemented with next-hop forwarding since P Dijkstra p1, 2q tp1, 4, 2qu. Paths computed by (extended) distributed Bellman-Ford P Bellman p0, 2q tp0, 1, 4, 2qu P Bellman p2, 0q tp2, 1, 0q, p2, 4, 1, 0qu tgg22 (cl.cam.ac.uk) L11: Algebraic Path Problems with applications to Internet T.G.Griffin Routingc 2017 Lecture 96 / 34
4 Optimal paths from 0 to 2. Computed by Dijkstra but not by Bellman-Ford 4 (1,100) (1,100) 0 (1,10) 1 (2,90) 2 (1,5) (1,100) tgg22 (cl.cam.ac.uk) L11: Algebraic Path Problems with applications to Internet T.G.Griffin Routingc 2017 Lecture 97 / 34 3 Optimal paths from 2 to 1. Computed by Bellman-Ford but not by Dijkstra 4 (1,100) (1,100) 0 (1,10) 1 (2,90) 2 (1,5) (1,100) tgg22 (cl.cam.ac.uk) L11: Algebraic Path Problems with applications to Internet T.G.Griffin Routingc 2017 Lecture 98 / 34 3
5 Observations For distributed Bellman-Ford For Dijkstra s algorithm next-hop-pathspaq computed-pathspaq Ď optimal-pathspaq next-hop-pathspaq Ď computed-pathspaq Ď optimal-pathspaq tgg22 (cl.cam.ac.uk) L11: Algebraic Path Problems with applications to Internet T.G.Griffin Routingc 2017 Lecture 99 / 34 How can we understand this (algebaically)? The Algorithm to Algebra (A2A) method original metric ` complex algorithm Ñ modified metric ` matrix equations (generic algorithm) We can capture path computation with this algebra sp ˆ bw ˆ pathspeq But this algebra is not distributive! LCpsp ˆ bwq LKppathspEqq tgg22 (cl.cam.ac.uk) L11: Algebraic Path Problems with applications to Internet T.G.Griffin Routing c 2017 Lecture 910 / 34
6 Towards a non-classical theory of algebraic path finding We need theory that can accept algebras that violate distributivity. Global optimality A pi, jq à wppq, ppppi, jq Left local optimality (distributed Bellman-Ford) L pa b Lq I. Right local optimality (Dijkstra s Algorithm) R pr b Aq I. Embrace the fact that all three notions can be distinct. tgg22 (cl.cam.ac.uk) L11: Algebraic Path Problems with applications to Internet T.G.Griffin Routing c 2017 Lecture 911 / 34 Left-Local Optimality Say that L is a left locally-optimal solution when L pa b Lq I. That is, for i j we have Lpi, jq à qpv Api, qq b Lpq, jq Lpi, jq is the best possible value given the values Lpq, jq, for all out-neighbors q of source i. Rows Lpi, _q represents out-trees from i (think Bellman-Ford). Columns Lp_, iq represents in-trees to i. Works well with hop-by-hop forwarding from i. tgg22 (cl.cam.ac.uk) L11: Algebraic Path Problems with applications to Internet T.G.Griffin Routing c 2017 Lecture 912 / 34
7 Right-Local Optimality Say that R is a right locally-optimal solution when R pr b Aq I. That is, for i j we have Rpi, jq à qpv Rpi, qq b Apq, jq Rpi, jq is the best possible value given the values Rpq, jq, for all in-neighbors q of destination j. Rows Lpi, _q represents out-trees from i (think Dijkstra). Columns Lp_, iq represents in-trees to i. tgg22 (cl.cam.ac.uk) L11: Algebraic Path Problems with applications to Internet T.G.Griffin Routing c 2017 Lecture 913 / 34 With and Without Distributivity With distributivity For (bounded) semirings, the three optimality problems are essentially the same locally optimal solutions are globally optimal solutions. Without distributivity A L R It may be that A, L, and R exists but are all distinct. Back and Forth L pa b Lq I ðñ L T pl T b T A T q I where b T is matrix multiplication defined with a b T b b b a tgg22 (cl.cam.ac.uk) L11: Algebraic Path Problems with applications to Internet T.G.Griffin Routing c 2017 Lecture 914 / 34
8 Dijkstra s Algorithm Classical Dijkstra Given adjacency matrix A over a selective semiring and source vertex i P V, Dijkstra s algorithm will compute A pi, _q such that A pi, jq à w A ppq. Non-Classical Dijkstra ppppi,jq If we drop assumptions of distributivity, then given adjacency matrix A and source vertex i P V, Dijkstra s algorithm will compute Rpi, _q such P V : Rpi, jq Ipi, jq à qpv Rpi, qq b Apq, jq. Routing in Equilibrium, João Luís Sobrinho and Timothy G. Griffin, MTNS tgg22 (cl.cam.ac.uk) L11: Algebraic Path Problems with applications to Internet T.G.Griffin Routing c 2017 Lecture 915 / 34 Dijkstra s algorithm Input : adjacency matrix A and source vertex i P V, Output : the i-th row of R, Rpi, _q. begin S Ð tiu Rpi, iq Ð 1 for each q P V tiu : Rpi, qq Ð Api, qq while S V begin find q P V S such that Rpi, qq is ď L -minimal S Ð S Y tqu for each j P V S Rpi, jq Ð Rpi, jq prpi, qq b Apq, jqq end end tgg22 (cl.cam.ac.uk) L11: Algebraic Path Problems with applications to Internet T.G.Griffin Routing c 2017 Lecture 916 / 34
9 Classical proofs of Dijkstra s algorithm (for global optimality) assume Semiring Axioms ASp q : a pb cq pa bq c CMp q : a b b a IDp q : 0 a a ASpbq : a b pb b cq pa b bq b c IDLpbq : 1 b a a IDRpbq : a b 1 a ANLpbq : 0 b a 0 ANRpbq : a b 0 0 LD : a b pb cq pa b bq pa b cq RD : pa bq b c pa b cq pb b cq tgg22 (cl.cam.ac.uk) L11: Algebraic Path Problems with applications to Internet T.G.Griffin Routing c 2017 Lecture 917 / 34 Classical proofs of Dijkstra s algorithm assume Additional axioms SLp q : a b P ta, bu ANp q : 1 a 1 Note that we can derive right absorption, RA : a pa b bq a and this gives (right) b : a ď a b b. a pa b bq pa b 1q pa b bq a b p1 bq a b 1 a tgg22 (cl.cam.ac.uk) L11: Algebraic Path Problems with applications to Internet T.G.Griffin Routing c 2017 Lecture 918 / 34
10 What will we assume? Very little! Semiring /////////// Axioms ASp q : a pb cq pa bq c CMp q : a b b a IDp q : 0 a a ASpbq //////// : a////////////// b pb b cq // pa ////////////// b bq b c IDLpbq : 1 b a a IDRpbq ///////// : a////// b 1 // a/ ANLpbq ////////// : 0////// b a // 0/ ANRpbq ////////// : a////// b 0 // 0/ LD /// : a////////////// b pb cq // pa ///////////////////// b bq pa b cq RD //// : pa ////////////// bq b c // pa ///////////////////// b cq pb b cq tgg22 (cl.cam.ac.uk) L11: Algebraic Path Problems with applications to Internet T.G.Griffin Routing c 2017 Lecture 919 / 34 What will we assume? Additional axioms SLp q : a b P ta, bu ANLp q : 1 a 1 RA : a pa b bq a Note that we can no longer derive RA, so we must assume it. Again, RA says that a ď a b b. We don t use SL explicitly in the proofs, but it is implicit in the algorithm s definition of q k. We do not use ASp q and CMp q explicitly, but these assumptions are implicit in the use of the big- notation. tgg22 (cl.cam.ac.uk) L11: Algebraic Path Problems with applications to Internet T.G.Griffin Routing c 2017 Lecture 920 / 34
11 Under these weaker assumptions... Theorem (Sobrinho/Griffin) Given adjacency matrix A and source vertex i P V, Dijkstra s algorithm will compute Rpi, _q such P V : Rpi, jq Ipi, jq à qpv Rpi, qq b Apq, jq. That is, it computes one row of the solution for the right equation R RA I. tgg22 (cl.cam.ac.uk) L11: Algebraic Path Problems with applications to Internet T.G.Griffin Routing c 2017 Lecture 921 / 34 Dijkstra s algorithm, annotated version Subscripts make proofs by induction easier... begin S 1 Ð tiu R 1 pi, iq Ð 1 for each q P V S 1 : R 1 pi, qq Ð Api, qq for each k 2, 3,..., V begin find q k P V S k 1 such that R k 1 pi, q k q is ď L -minimal S k Ð S k 1 Y tq k u for each j P V S k R k pi, jq Ð R k 1 pi, jq pr k 1 pi, q k q b Apq k, jqq end end tgg22 (cl.cam.ac.uk) L11: Algebraic Path Problems with applications to Internet T.G.Griffin Routing c 2017 Lecture 922 / 34
12 Main Claim, : 1 ď k ď V P S k : R k pi, jq Ipi, jq à qps k R k pi, qq bapq, jq We will use Observation 1 (no backtracking) : 1 ď k ă V P S k`1 : R k`1 pi, jq R k pi, jq Observation 2 (Dijkstra is greedy : 1 ď k ď V P S k P V S k : R k pi, qq ď R k pi, wq Observation 3 (Accurate : 1 ď k ď V P V S k : R k pi, wq à R k pi, qqbapq, wq qps k tgg22 (cl.cam.ac.uk) L11: Algebraic Path Problems with applications to Internet T.G.Griffin Routing c 2017 Lecture 923 / 34 Observation : 1 ď k ă V P S k`1 : R k`1 pi, jq R k pi, jq Proof: This is easy to see by inspection of the algorithm. Once a node is put into S its weight never changes again. tgg22 (cl.cam.ac.uk) L11: Algebraic Path Problems with applications to Internet T.G.Griffin Routing c 2017 Lecture 924 / 34
13 The algorithm is greedy Observation : 1 ď k ď V P S k P V S k : R k pi, qq ď R k pi, wq By induction. Base : Since S 1 tiu and R 1 pi, iq 1, we need to show that 1 ď Api, wq 1 1 Api, wq. This follows from ANLp q. Induction: P S k P V S k : R k pi, qq ď R k pi, wq and P S k`1 P V S k`1 : R k`1 pi, qq ď R k`1 pi, wq. Since S k`1 S k Y tq k`1 u, this means showing p1q P S k P V S k`1 : R k`1 pi, qq ď R k`1 pi, P V S k`1 : R k`1 pi, q k`1 q ď R k`1 pi, wq tgg22 (cl.cam.ac.uk) L11: Algebraic Path Problems with applications to Internet T.G.Griffin Routing c 2017 Lecture 925 / 34 By Observation 1, showing p1q is the same P S k P V S k`1 : R k pi, qq ď R k`1 pi, wq which expands to (by definition of R k`1 pi, P S k P V S k`1 : R k pi, qq ď R k pi, wq pr k pi, q k`1 qbapq k`1, wqq But R k pi, qq ď R k pi, wq by the induction hypothesis, and R k pi, qq ď pr k pi, q k`1 q b Apq k`1, wqq by the induction hypothesis and RA. Since a ď L b ^ a ď L c ùñ a ď L pb cq, we are done. tgg22 (cl.cam.ac.uk) L11: Algebraic Path Problems with applications to Internet T.G.Griffin Routing c 2017 Lecture 926 / 34
14 By Observation 1, showing p2q is the same as showing which expands P V S k`1 : R k pi, q k`1 q ď R k`1 pi, P V S k`1 : R k pi, q k`1 q ď R k pi, wq pr k pi, q k`1 q b Apq k`1, wqq But R k pi, q k`1 q ď R k pi, wq since q k`1 was chosen to be minimal, and R k pi, q k`1 q ď pr k pi, q k`1 q b Apq k`1, wqq by RA. Since a ď L b ^ a ď L c ùñ a ď L pb cq, we are done. tgg22 (cl.cam.ac.uk) L11: Algebraic Path Problems with applications to Internet T.G.Griffin Routing c 2017 Lecture 927 / 34 Observation 3 Observation : 1 ď k ď V P V S k : R k pi, wq à qps k R k pi, qqbapq, wq Proof: By induction: Base : easy, since à qps 1 R 1 pi, qq b Apq, wq 1 b Api, wq Api, wq R 1 pi, wq Induction step. P V S k : R k pi, wq à qps k R k pi, qq b Apq, wq and P V S k`1 : R k`1 pi, wq à R k`1 pi, qq b Apq, wq qps k`1 tgg22 (cl.cam.ac.uk) L11: Algebraic Path Problems with applications to Internet T.G.Griffin Routing c 2017 Lecture 928 / 34
15 By Observation 1, and a bit of rewriting, this means we must P V S k`1 : R k`1 pi, wq R k pi, q k`1 qbapq k`1, wq à qps k R k pi, qqbapq Using the induction hypothesis, this P V S k`1 : R k`1 pi, wq R k pi, q k`1 q b Apq k`1, wq R k pi, wq But this is exactly how R k`1 pi, wq is computed in the algorithm. tgg22 (cl.cam.ac.uk) L11: Algebraic Path Problems with applications to Internet T.G.Griffin Routing c 2017 Lecture 929 / 34 Proof of Main Claim Main : 1 ď k ď V P S k : R k pi, jq Ipi, jq à qps k R k pi, qq bapq, jq Proof : By induction on k. Base case: S 1 tiu and the claim is easy. Induction: Assume P S k : R k pi, jq Ipi, jq à qps k R k pi, qq b Apq, jq We must show P S k`1 : R k`1 pi, jq Ipi, jq à R k`1 pi, qq b Apq, jq qps k`1 tgg22 (cl.cam.ac.uk) L11: Algebraic Path Problems with applications to Internet T.G.Griffin Routing c 2017 Lecture 930 / 34
16 Since S k`1 S k Y tq k`1 u, this means we must show p1q P S k : R k`1 pi, jq Ipi, jq À qps k`1 R k`1 pi, qq b Apq, jq R k`1 pi, q k`1 q Ipi, q k`1 q À qps k`1 R k`1 pi, qq b Apq, q k`1 q By use Observation 1, showing p1q is the same as P S k : R k pi, jq Ipi, jq à R k pi, qq b Apq, jq, qps k`1 which is equivalent P S k : R k pi, jq Ipi, jq pr k pi, q k`1 qbapq k`1, jqq à R k pi, qqbapq, jq qps k By the induction hypothesis, this is equivalent P S k : R k pi, jq R k pi, jq pr k pi, q k`1 q b Apq k`1, jqq, tgg22 (cl.cam.ac.uk) L11: Algebraic Path Problems with applications to Internet T.G.Griffin Routing c 2017 Lecture 931 / 34 Put another P S k : R k pi, jq ď R k pi, q k`1 q b Apq k`1, jq By observation 2 we know R k pi, jq ď R k pi, q k`1 q, and so R k pi, jq ď R k pi, q k`1 q ď R k pi, q k`1 q b Apq k`1, jq by RA. tgg22 (cl.cam.ac.uk) L11: Algebraic Path Problems with applications to Internet T.G.Griffin Routing c 2017 Lecture 932 / 34
17 To show p2q, we use Observation 1 and Ipi, q k`1 q 0 to obtain R k pi, q k`1 q à R k pi, qq b Apq, q k`1 q qps k`1 which, since Apq k`1, q k`1 q 0, is the same as R k pi, q k`1 q à R k pi, qq b Apq, q k`1 q qps k This then follows directly from Observation 3. tgg22 (cl.cam.ac.uk) L11: Algebraic Path Problems with applications to Internet T.G.Griffin Routing c 2017 Lecture 933 / 34 Finding Left Local Solutions? L pa b Lq I ðñ L T pl T b T A T q I where R T pa T b T R T q I ðñ R pr b Aq I a b T b b b a Replace RA with LA, LA b : a ď b b a tgg22 (cl.cam.ac.uk) L11: Algebraic Path Problems with applications to Internet T.G.Griffin Routing c 2017 Lecture 934 / 34
What Have We Learned from Reverse-Engineering the Internet s Inter-domain Routing Protocol?
What Have We Learned from Reverse-Engineering the Internet s Inter-domain Routing Protocol? Timothy G. Griffin Computer Laboratory University of Cambridge, UK timothy.griffin@cl.cam.ac.uk Advanced Networks
More informationL11: Algebraic Path Problems with applications to Internet Routing Lecture 15. Path Weight with functions on arcs?
L11: Algebraic Path Problems with applications to Internet Routing Lecture 15 Timothy G. Griffin timothy.griffin@cl.cam.ac.uk Computer Laboratory University of Cambridge, UK Michaelmas Term, 2016 tgg22
More informationL11: Algebraic Path Problems with applications to Internet Routing Lectures 7 and 8
L: Algebraic Path Problems with applications to Internet Routing Lectures 7 and 8 Timothy G. Grifn timothy.grifn@cl.cam.ac.uk Computer Laboratory University of Cambridge, UK Michaelmas Term, 27 tgg22 (cl.cam.ac.uk)
More informationL11: Algebraic Path Problems with applications to Internet T.G.Griffin Routingc 2015 Lectures 1, 2 / 2, 64and
L11: Algebraic Path Problems with applications to Internet Routing Lectures 1, 2, and 3 Timothy G. Grin timothy.grin@cl.cam.ac.uk Computer Laboratory University of Cambridge, UK Michaelmas Term, 2016 L11:
More informationBuilding Algebraic Structures with Combinators
Building Algebraic Structures with Combinators Vilius Naudžiūnas Timothy G. Griffin Vilius.Naudziunas@cl.cam.ac.uk timothy.griffin@cl.cam.ac.uk Computer Laboratory University of Cambridge, UK Model-Based
More informationCS 4407 Algorithms Lecture: Shortest Path Algorithms
CS 440 Algorithms Lecture: Shortest Path Algorithms Prof. Gregory Provan Department of Computer Science University College Cork 1 Outline Shortest Path Problem General Lemmas and Theorems. Algorithms Bellman-Ford
More informationExtensive Form Abstract Economies and Generalized Perfect Recall
Extensive Form Abstract Economies and Generalized Perfect Recall Nicholas Butler Princeton University July 30, 2015 Nicholas Butler (Princeton) EFAE and Generalized Perfect Recall July 30, 2015 1 / 1 Motivation
More informationPRINCIPLES OF ANALYSIS - LECTURE NOTES
PRINCIPLES OF ANALYSIS - LECTURE NOTES PETER A. PERRY 1. Constructions of Z, Q, R Beginning with the natural numbers N t1, 2, 3,...u we can use set theory to construct, successively, Z, Q, and R. We ll
More informationDesign and Analysis of Algorithms
Design and Analysis of Algorithms CSE 5311 Lecture 21 Single-Source Shortest Paths Junzhou Huang, Ph.D. Department of Computer Science and Engineering CSE5311 Design and Analysis of Algorithms 1 Single-Source
More informationIntroduction to computability Tutorial 7
Introduction to computability Tutorial 7 Context free languages and Turing machines November 6 th 2014 Context-free languages 1. Show that the following languages are not context-free: a) L ta i b j a
More informationCS 173 Lecture 7: Arithmetic (II)
CS 173 Lecture 7: Arithmetic (II) José Meseguer University of Illinois at Urbana-Champaign 1 The Fundamental Theorem of Arithmetic (Part II) Fundamental Theorem of Arithmetic (Part II). Every natural number
More informationNOTES WEEK 15 DAY 1 SCOT ADAMS
NOTES WEEK 15 DAY 1 SCOT ADAMS We fix some notation for the entire class today: Let n P N, W : R n, : 2 P N pw q, W : LpW, W q, I : id W P W, z : 0 W 0 n. Note that W LpR n, R n q. Recall, for all T P
More informationExistence of weak adiabatic limit in almost all models of perturbative QFT
Existence of weak adiabatic limit in almost all models of perturbative QFT Paweł Duch Jagiellonian University, Cracow, Poland LQP 40 Foundations and Constructive Aspects of Quantum Field Theory, 23.06.2017
More informationAnalysis of Algorithms. Outline. Single Source Shortest Path. Andres Mendez-Vazquez. November 9, Notes. Notes
Analysis of Algorithms Single Source Shortest Path Andres Mendez-Vazquez November 9, 01 1 / 108 Outline 1 Introduction Introduction and Similar Problems General Results Optimal Substructure Properties
More informationAlgorithms: Lecture 12. Chalmers University of Technology
Algorithms: Lecture 1 Chalmers University of Technology Today s Topics Shortest Paths Network Flow Algorithms Shortest Path in a Graph Shortest Path Problem Shortest path network. Directed graph G = (V,
More informationADVANCE TOPICS IN ANALYSIS - REAL. 8 September September 2011
ADVANCE TOPICS IN ANALYSIS - REAL NOTES COMPILED BY KATO LA Introductions 8 September 011 15 September 011 Nested Interval Theorem: If A 1 ra 1, b 1 s, A ra, b s,, A n ra n, b n s, and A 1 Ě A Ě Ě A n
More informationSobolev-Type Extremal Polynomials
Soolev-Type Extremal Polyomials (case of the sigular measures) Ael Díaz-Gozález Joi with Héctor Pijeira-Carera ULL 2016 Soolev-Type Extremal Polyomials adiazgo@math.uc3m.es 1 / 18 Moic extremal polyomials
More informationAsynchronous Convergence of Policy-Rich Distributed Bellman-Ford Routing Protocols
Asynchronous Convergence of Policy-Rich Distributed Bellman-Ford Routing Protocols SIGCOMM 2018 Matthew Daggitt 1 Alexander Gurney 2 Timothy Grin 1 21st of August 2018 1 University of Cambridge 2 Comcast
More informationMATH 387 ASSIGNMENT 2
MATH 387 ASSIGMET 2 SAMPLE SOLUTIOS BY IBRAHIM AL BALUSHI Problem 4 A matrix A ra ik s P R nˆn is called symmetric if a ik a ki for all i, k, and is called positive definite if x T Ax ě 0 for all x P R
More informationDraft. Lecture 14 Eigenvalue Problems. MATH 562 Numerical Analysis II. Songting Luo. Department of Mathematics Iowa State University
Lecture 14 Eigenvalue Problems Songting Luo Department of Mathematics Iowa State University MATH 562 Numerical Analysis II Songting Luo ( Department of Mathematics Iowa State University[0.5in] MATH562
More informationCMPS 6610 Fall 2018 Shortest Paths Carola Wenk
CMPS 6610 Fall 018 Shortest Paths Carola Wenk Slides courtesy of Charles Leiserson with changes and additions by Carola Wenk Paths in graphs Consider a digraph G = (V, E) with an edge-weight function w
More informationPublic-Key Encryption
Public-Key Encryption 601.642/442: Modern Cryptography Fall 2017 601.642/442: Modern Cryptography Public-Key Encryption Fall 2017 1 / 14 The Setting Alice and Bob don t share any secret Alice wants to
More informationLecture 24 Properties of deals
Lecture 24 Properties of deals Aside: Representation theory of finite groups Let G be a finite group, and let R C, R, or Q (any commutative ring). Aside: Representation theory of finite groups Let G be
More informationMTH 505: Number Theory Spring 2017
MTH 505: Number Theory Spring 2017 Homework 1 Drew Armstrong 1.1. From pn, σ, 0q to pn, `,, 0, 1q. Recall Peano s four axioms for the natural numbers: (P1) There exists a special element called 0 P N.
More informationAlgorithm Design and Analysis
Algorithm Design and Analysis LECTURE 8 Greedy Algorithms V Huffman Codes Adam Smith Review Questions Let G be a connected undirected graph with distinct edge weights. Answer true or false: Let e be the
More informationSingle Source Shortest Paths
CMPS 00 Fall 017 Single Source Shortest Paths Carola Wenk Slides courtesy of Charles Leiserson with changes and additions by Carola Wenk Paths in graphs Consider a digraph G = (V, E) with an edge-weight
More informationCOS597D: Information Theory in Computer Science October 19, Lecture 10
COS597D: Information Theory in Computer Science October 9, 20 Lecture 0 Lecturer: Mark Braverman Scribe: Andrej Risteski Kolmogorov Complexity In the previous lectures, we became acquainted with the concept
More information4.1.3 Addition of a link between an existing node and the reference node (Case 3):
4.1.3 Addition of a link between an existing node and the reference node (Case 3): When an element is connected between an existing node and the reference, it creates a loop and thus, the addition of this
More information12.3 Dot Products, 12.4 Cross Products
12.3 Dot Products, 12.4 Cross Products How do we multiply vectors? How to multiply vectors is not at all obvious, and in fact, there are two different ways to make sense of vector multiplication, each
More informationDraft. Lecture 12 Gaussian Elimination and LU Factorization. MATH 562 Numerical Analysis II. Songting Luo
Lecture 12 Gaussian Elimination and LU Factorization Songting Luo Department of Mathematics Iowa State University MATH 562 Numerical Analysis II ongting Luo ( Department of Mathematics Iowa State University[0.5in]
More informationCMPSCI 611: Advanced Algorithms
CMPSCI 611: Advanced Algorithms Lecture 12: Network Flow Part II Andrew McGregor Last Compiled: December 14, 2017 1/26 Definitions Input: Directed Graph G = (V, E) Capacities C(u, v) > 0 for (u, v) E and
More informationAlgorithm Design and Analysis
Algorithm Design and Analysis LECTURE 7 Greedy Graph Algorithms Shortest paths Minimum Spanning Tree Sofya Raskhodnikova 9/14/016 S. Raskhodnikova; based on slides by E. Demaine, C. Leiserson, A. Smith,
More informationComputer Science is Largely about Abstractions
Metarouting Timothy G. Griffin João Luís Sobrinho Computer Laboratory Instituto detelecomunicações University of Cambridge Instituto Superior Técnico Cambridge, UK Lisbon, Portugal SIGCOMM ugust 23, 2005
More informationDonaldson Thomas invariants for A-type square product quivers
Donaldson Thomas invariants for A-type square product quivers Justin Allman (Joint work with Richárd Rimányi 2 ) US Naval Academy 2 UNC Chapel Hill 4th Conference on Geometric Methods in Representation
More informationCSE101: Design and Analysis of Algorithms. Ragesh Jaiswal, CSE, UCSD
Greedy s Greedy s Shortest path Claim 2: Let S be a subset of vertices containing s such that we know the shortest path length l(s, u) from s to any vertex in u S. Let e = (u, v) be an edge such that 1
More informationReexamining Sequential Rationality in Games with Imperfect Recall
Reexamining Sequential Rationality in Games with Imperfect Recall Nicholas Butler Princeton University October 7, 2015 Nicholas Butler ( Princeton University) Sequential Rationality 1 / 1 Motivation Imperfect
More informationOn principal eigenpair of temporal-joined adjacency matrix for spreading phenomenon Abstract. Keywords: 1 Introduction
1,3 1,2 1 2 3 r A ptq pxq p0q 0 pxq 1 x P N S i r A ptq r A ÝÑH ptq i i ÝÑH t ptq i N t1 ÝÑ ź H ptq θ1 t 1 0 i `t1 ri ` A r ÝÑ H p0q ra ptq t ra ptq i,j 1 i j t A r ptq i,j 0 I r ś N ˆ N mś ĂA l A Ą m...
More informationProbability Generating Functions
Probability Generating Functions Andreas Klappenecker Texas A&M University 2018 by Andreas Klappenecker. All rights reserved. 1 / 27 Probability Generating Functions Definition Let X be a discrete random
More informationarxiv: v2 [math.co] 11 Oct 2016
ON SUBSEQUENCES OF QUIDDITY CYCLES AND NICHOLS ALGEBRAS arxiv:1610.043v [math.co] 11 Oct 016 M. CUNTZ Abstract. We provide a tool to obtain local descriptions of quiddity cycles. As an application, we
More informationSFWR ENG 3S03: Software Testing
(Slide 1 of 64) Dr. Ridha Khedri Department of Computing and Software, McMaster University Canada L8S 4L7, Hamilton, Ontario and Acknowledgments: Material based on [FP97, Chapter 2] and [Zus97, Chapter
More informationDiscrete Optimization 2010 Lecture 2 Matroids & Shortest Paths
Matroids Shortest Paths Discrete Optimization 2010 Lecture 2 Matroids & Shortest Paths Marc Uetz University of Twente m.uetz@utwente.nl Lecture 2: sheet 1 / 25 Marc Uetz Discrete Optimization Matroids
More informationNOTES WEEK 02 DAY 1. THEOREM 0.3. Let A, B and C be sets. Then
NOTES WEEK 02 DAY 1 SCOT ADAMS LEMMA 0.1. @propositions P, Q, R, rp or pq&rqs rp p or Qq&pP or Rqs. THEOREM 0.2. Let A and B be sets. Then (i) A X B B X A, and (ii) A Y B B Y A THEOREM 0.3. Let A, B and
More informationSingle Source Shortest Paths
CMPS 00 Fall 015 Single Source Shortest Paths Carola Wenk Slides courtesy of Charles Leiserson with changes and additions by Carola Wenk 1 Paths in graphs Consider a digraph G = (V, E) with an edge-weight
More informationThe Riemann Roch theorem for metric graphs
The Riemann Roch theorem for metric graphs R. van Dobben de Bruyn 1 Preface These are the notes of a talk I gave at the graduate student algebraic geometry seminar at Columbia University. I present a short
More informationTime Reversibility and Burke s Theorem
Queuing Analysis: Time Reversibility and Burke s Theorem Hongwei Zhang http://www.cs.wayne.edu/~hzhang Acknowledgement: this lecture is partially based on the slides of Dr. Yannis A. Korilis. Outline Time-Reversal
More informationReview++ of linear algebra continues
Review++ of linear algebra continues Recall a matrix A P M m,n pf q is an array 1 1 2 1 1 n A p j i q 1 2 2 2 2 n...... 1 m n m This encodes a map ' P HompF n,f m q via the images of basis vectors of F
More informationdirected weighted graphs as flow networks the Ford-Fulkerson algorithm termination and running time
Network Flow 1 The Maximum-Flow Problem directed weighted graphs as flow networks the Ford-Fulkerson algorithm termination and running time 2 Maximum Flows and Minimum Cuts flows and cuts max flow equals
More informationExtensive Form Abstract Economies and Generalized Perfect Recall
Extensive Form Abstract Economies and Generalized Perfect Recall Nicholas Butler : Abstract I introduce the notion of an extensive form abstract economy (EFAE), a framework for modeling dynamic settings
More informationRandom Variables. Andreas Klappenecker. Texas A&M University
Random Variables Andreas Klappenecker Texas A&M University 1 / 29 What is a Random Variable? Random variables are functions that associate a numerical value to each outcome of an experiment. For instance,
More informationProof Techniques (Review of Math 271)
Chapter 2 Proof Techniques (Review of Math 271) 2.1 Overview This chapter reviews proof techniques that were probably introduced in Math 271 and that may also have been used in a different way in Phil
More informationLecture 10: Lovász Local Lemma. Lovász Local Lemma
Lecture 10: Introduction Let A 1,..., A n be indicator variables for bad events in an experiment Suppose P [A i ] p We want to avoid all the bad events If P [ A 1 A n ] > 0, then there exists a way to
More informationArea of left square = Area of right square c 2 + (4 Area of (a, b)-triangle) = a 2 + b 2 + (4 Area of (a, b)-triangle) c 2 = a 2 + b 2.
Worksheet Proof (of Pythagoras Theorem). The proof can be shown using the two squares in Figure 19.3. To draw the first square begin by drawing a general triangle with sides a and b and then extend these
More informationIntroduction to Algorithms
Introduction to Algorithms, Lecture 5 // Introduction to Algorithms 6.46J/.4J LECTURE Shortest Paths I Properties o shortest paths Dijkstra s Correctness Analysis Breadth-irst Pro. Manolis Kellis March,
More informationLecture 5: Hard Core Predicates
Lecture 5: Hard Core Predicates Instructor: Omkant Pandey Spring 2017 (CSE 594) Instructor: Omkant Pandey Lecture 5: Hard Core Predicates Spring 2017 (CSE 594) 1 / 17 Last Time Proof via Reduction: fˆ
More informationDo not turn this page until you have received the signal to start. Please fill out the identification section above. Good Luck!
CSC 373H5 F 2017 Midterm Duration 1 hour and 50 minutes Last Name: Lecture Section: 1 Student Number: First Name: Instructor: Vincent Maccio Do not turn this page until you have received the signal to
More informationIntroduction to Algorithms
Introduction to Algorithms 6.046J/8.40J/SMA550 Lecture 7 Prof. Erik Demaine Paths in graphs Consider a digraph G = (V, E) with edge-weight function w : E R. The weight of path p = v v L v k is defined
More informationGap probabilities in tiling models and Painlevé equations
Gap probabilities in tiling models and Painlevé equations Alisa Knizel Columbia University Painlevé Equations and Applications: A Workshop in Memory of A. A. Kapaev August 26, 2017 1 / 17 Tiling model
More informationDigital Microelectronic Circuits ( ) Logical Effort. Lecture 7: Presented by: Adam Teman
Digital Microelectronic ircuits (361-1-3021 ) Presented by: Adam Teman Lecture 7: Logical Effort Digital Microelectronic ircuits The VLSI Systems enter - BGU Lecture 7: Logical Effort 1 Last Lectures The
More informationLecture 16 Methods for System of Linear Equations (Linear Systems) Songting Luo. Department of Mathematics Iowa State University
Lecture 16 Methods for System of Linear Equations (Linear Systems) Songting Luo Department of Mathematics Iowa State University MATH 481 Numerical Methods for Differential Equations Songting Luo ( Department
More informationNOTES WEEK 04 DAY 1 SCOT ADAMS
NOTES WEEK 0 DAY 1 SCOT ADAMS DEFINITION 01 Let m, n P N, B P BpR m, R n q Let e 1,, e m be the standard basis of R m Let f 1,, f n be the standard basis of R n Then we define rbs P R nˆm by rbs ji Bpe
More informationCharacterizing Cycle Partition in 2-Row Bulgarian Solitaire
Saint Peter s University Honors Thesis Characterizing Cycle Partition in 2-Row Bulgarian Solitaire Author: Sabin K Pradhan Advisor: Dr Brian Hopkins A thesis submitted in partial fulfillment of the requirements
More informationIntroduction to Kleene Algebras
Introduction to Kleene Algebras Riccardo Pucella Basic Notions Seminar December 1, 2005 Introduction to Kleene Algebras p.1 Idempotent Semirings An idempotent semiring is a structure S = (S, +,, 1, 0)
More informationIntroduction to Algorithms
Introduction to Algorithms 6.046J/18.401J LECTURE 14 Shortest Paths I Properties of shortest paths Dijkstra s algorithm Correctness Analysis Breadth-first search Prof. Charles E. Leiserson Paths in graphs
More informationShortest paths: label setting
: label setting CE 377K February 19, 2015 REVIEW HW 2 posted, due in 2 weeks Review Basic search algorithm Prim s algorithm Review Algorithm (Assumes that the network is connected.) 1 Arbitrarily choose
More informationarxiv: v1 [math.nt] 23 May 2017
arxiv:1705.08232v1 [math.nt] 23 May 2017 An equation about sum of primes with digital sum constraints Haifeng Xu February 12, 2018 Abstract We know that any prime number of form 4s ` 1 can be written as
More information6. DYNAMIC PROGRAMMING II. sequence alignment Hirschberg's algorithm Bellman-Ford distance vector protocols negative cycles in a digraph
6. DYNAMIC PROGRAMMING II sequence alignment Hirschberg's algorithm Bellman-Ford distance vector protocols negative cycles in a digraph Shortest paths Shortest path problem. Given a digraph G = (V, E),
More informationCS261: A Second Course in Algorithms Lecture #8: Linear Programming Duality (Part 1)
CS261: A Second Course in Algorithms Lecture #8: Linear Programming Duality (Part 1) Tim Roughgarden January 28, 2016 1 Warm-Up This lecture begins our discussion of linear programming duality, which is
More informationCS1800: Mathematical Induction. Professor Kevin Gold
CS1800: Mathematical Induction Professor Kevin Gold Induction: Used to Prove Patterns Just Keep Going For an algorithm, we may want to prove that it just keeps working, no matter how big the input size
More informationThe Logical Consistency of Simultaneous Agnostic Hypothesis Tests
entropy rticle The Logical Consistency of Simultaneous gnostic Hypothesis Tests Luís G. Esteves 1, Rafael Izbicki, Julio M. Stern 1 and Rafael. Stern, * 1 Institute of Mathematics and Statistics, University
More informationCS 151. Red Black Trees & Structural Induction. Thursday, November 1, 12
CS 151 Red Black Trees & Structural Induction 1 Announcements Majors fair tonight 4:30-6:30pm in the Root Room in Carnegie. Come and find out about the CS major, or some other major. Winter Term in CS
More informationLocal behaviour of Galois representations
Local behaviour of Galois representations Devika Sharma Weizmann Institute of Science, Israel 23rd June, 2017 Devika Sharma (Weizmann) 23rd June, 2017 1 / 14 The question Let p be a prime. Let f ř 8 ně1
More informationEntropy and Ergodic Theory Lecture 7: Rate-distortion theory
Entropy and Ergodic Theory Lecture 7: Rate-distortion theory 1 Coupling source coding to channel coding Let rσ, ps be a memoryless source and let ra, θ, Bs be a DMC. Here are the two coding problems we
More informationExam 2 Solutions. In class questions
Math 5330 Spring 2018 Exam 2 Solutions In class questions 1. (15 points) Solve the following congruences. Put your answer in the form of a congruence. I usually find it easier to go from largest to smallest
More informationABSTRACT ALGEBRA 1 COURSE NOTES, LECTURE 11: SYLOW THEORY.
ABSTRACT ALGEBRA 1 COURSE NOTES, LECTURE 11: SYLOW THEORY. ANDREW SALCH Here s a quick definition we could have introduced a long time ago: Definition 0.1. If n is a positive integer, we often write C
More information3 Fields, Elementary Matrices and Calculating Inverses
3 Fields, Elementary Matrices and Calculating Inverses 3. Fields So far we have worked with matrices whose entries are real numbers (and systems of equations whose coefficients and solutions are real numbers).
More informationCMPS 2200 Fall Carola Wenk Slides courtesy of Charles Leiserson with small changes by Carola Wenk. 10/8/12 CMPS 2200 Intro.
CMPS 00 Fall 01 Single Source Shortest Paths Carola Wenk Slides courtesy of Charles Leiserson with small changes by Carola Wenk 1 Paths in graphs Consider a digraph G = (V, E) with edge-weight function
More informationCrypto math II. Alin Tomescu May 27, Abstract A quick overview on group theory from Ron Rivest s course in Spring 2015.
Crypto math II Alin Tomescu alinush@mit.edu May 7, 015 Abstract A quick overview on group theory from Ron Rivest s 6.857 course in Spring 015. 1 Overview Group theory review Diffie-Hellman (DH) key exchange
More informationCoq as a Metatheory for Nuprl with Bar Induction
Coq as a Metatheory for Nuprl with Bar Induction Vincent Rahli and Mark Bickford http://www.nuprl.org October 7, 2015 Vincent Rahli Bar Induction October 7, 2015 1/25 Overall Story Mark Bickford Luitzen
More informationNP-complete problems. CSE 101: Design and Analysis of Algorithms Lecture 20
NP-complete problems CSE 101: Design and Analysis of Algorithms Lecture 20 CSE 101: Design and analysis of algorithms NP-complete problems Reading: Chapter 8 Homework 7 is due today, 11:59 PM Tomorrow
More informationL E C T U R E 1 2 : R N A N D V E C T O R S PA C E S. Monday, October 3
L E C T U R E 1 2 : R N A N D V E C T O R S PA C E S Monday, October 3 In the last few lectures we considered various properties of matrices in order to better understand the coefficient matrices of our
More informationDiscrete Optimization 2010 Lecture 3 Maximum Flows
Remainder: Shortest Paths Maximum Flows Discrete Optimization 2010 Lecture 3 Maximum Flows Marc Uetz University of Twente m.uetz@utwente.nl Lecture 3: sheet 1 / 29 Marc Uetz Discrete Optimization Outline
More informationGame Theory. 2.1 Zero Sum Games (Part 2) George Mason University, Spring 2018
Game Theory 2.1 Zero Sum Games (Part 2) George Mason University, Spring 2018 The Nash equilibria of two-player, zero-sum games have various nice properties. Minimax Condition A pair of strategies is in
More information6. DYNAMIC PROGRAMMING II
6. DYNAMIC PROGRAMMING II sequence alignment Hirschberg's algorithm Bellman-Ford algorithm distance vector protocols negative cycles in a digraph Lecture slides by Kevin Wayne Copyright 2005 Pearson-Addison
More informationNOTES WEEK 13 DAY 2 SCOT ADAMS
NOTES WEEK 13 DAY 2 SCOT ADAMS Recall: Let px, dq be a metric space. Then, for all S Ď X, we have p S is sequentially compact q ñ p S is closed and bounded q. DEFINITION 0.1. Let px, dq be a metric space.
More informationCSCE 222 Discrete Structures for Computing. Review for Exam 2. Dr. Hyunyoung Lee !!!
CSCE 222 Discrete Structures for Computing Review for Exam 2 Dr. Hyunyoung Lee 1 Strategy for Exam Preparation - Start studying now (unless have already started) - Study class notes (lecture slides and
More informationGeometric Spanners With Small Chromatic Number
Geometric Spanners With Small Chromatic Number Prosenjit Bose 1, Paz Carmi 1, Mathieu Couture 1, Anil Maheshwari 1, Michiel Smid 1, and Norbert Zeh 2 1 School of Computer Science, Carleton University 2
More informationMidterm Exam 2 Solutions
Algorithm Design and Analysis November 12, 2010 Pennsylvania State University CSE 565, Fall 2010 Professor Adam Smith Exam 2 Solutions Problem 1 (Miscellaneous). Midterm Exam 2 Solutions (a) Your friend
More informationReview Questions, Final Exam
Review Questions, Final Exam A few general questions. What does the Representation Theorem say (in linear programming)? In words, the representation theorem says that any feasible point can be written
More informationUdaan School Of Mathematics Class X Chapter 10 Circles Maths
Exercise 10.1 1. Fill in the blanks (i) The common point of tangent and the circle is called point of contact. (ii) A circle may have two parallel tangents. (iii) A tangent to a circle intersects it in
More informationIntroduction to Algorithms
Introduction to Algorithms 6.046J/18.401J LECTURE 17 Shortest Paths I Properties of shortest paths Dijkstra s algorithm Correctness Analysis Breadth-first search Prof. Erik Demaine November 14, 005 Copyright
More informationLECTURES 14/15: LINEAR INDEPENDENCE AND BASES
LECTURES 14/15: LINEAR INDEPENDENCE AND BASES MA1111: LINEAR ALGEBRA I, MICHAELMAS 2016 1. Linear Independence We have seen in examples of span sets of vectors that sometimes adding additional vectors
More informationMath 110 Answers for Homework 8
Math 110 Answers for Homework 8 1. Determine if the linear transformations described by the following matrices are invertible. If not, explain why, and if so, nd the matrix of the inverse transformation.
More informationAutomata theory and its applications
Automata theory and its applications Lecture 12-14: Automata over ranked finite trees Zhilin Wu State Key Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences January 16,
More informationwe can assume without loss of generality that x and y are of the form x pabcq and y pbcdq,
1. Symmetric and alternating groups. SOLUTIONS Math A4900 Homework 9 11/1/2017 (a) In class we showed that S n is generated by T tpi jq 1 ď i ă j ď nu, the set of transpositions in S n. Show by induction
More informationcs/ee/ids 143 Communication Networks
cs/ee/ids 143 Communication Networks Chapter 5 Routing Text: Walrand & Parakh, 2010 Steven Low CMS, EE, Caltech Warning These notes are not self-contained, probably not understandable, unless you also
More informationI I. R E L A T E D W O R K
A c c e l e r a t i n g L a r g e S c a l e C e n t r o i d - B a s e d C l u s t e r i n g w i t h L o c a l i t y S e n s i t i v e H a s h i n g R y a n M c C o n v i l l e, X i n C a o, W e i r u L
More informationAn algebraic framework for a unified view of route-vector protocols
An algebraic framework for a unified view of route-vector protocols João Luís Sobrinho Instituto Superior Técnico, Universidade de Lisboa Instituto de Telecomunicações Portugal 1 Outline 1. ontext for
More informationMath 5330 Spring Notes Congruences
Math 5330 Spring 2018 Notes Congruences One of the fundamental tools of number theory is the congruence. This idea will be critical to most of what we do the rest of the term. This set of notes partially
More informationLecture 4. Quicksort
Lecture 4. Quicksort T. H. Cormen, C. E. Leiserson and R. L. Rivest Introduction to Algorithms, 3rd Edition, MIT Press, 2009 Sungkyunkwan University Hyunseung Choo choo@skku.edu Copyright 2000-2018 Networking
More informationCSE 417. Chapter 4: Greedy Algorithms. Many Slides by Kevin Wayne. Copyright 2005 Pearson-Addison Wesley. All rights reserved.
CSE 417 Chapter 4: Greedy Algorithms Many Slides by Kevin Wayne. Copyright 2005 Pearson-Addison Wesley. All rights reserved. 1 Greed is good. Greed is right. Greed works. Greed clarifies, cuts through,
More information