Nonlinear methods in discrete optimization László Lovász Eötvös Loránd University, Budapest

Slides:



Advertisements
Similar presentations
Planar graphs Algorithms and Networks. Planar graphs2 Can be drawn on the plane without crossings Plane graph: planar graph, given together with an embedding.
Advertisements

Spatial Embedding of Pseudo-Triangulations Peter Braß Institut für Informatik Freie Universität Berlin Berlin, Germany Franz Aurenhammer Hannes Krasser.
TexPoint fonts used in EMF.
Orthogonal Drawing Kees Visser. Overview  Introduction  Orthogonal representation  Flow network  Bend optimal drawing.
22C:19 Discrete Math Graphs Fall 2010 Sukumar Ghosh.
22C:19 Discrete Math Graphs Fall 2014 Sukumar Ghosh.
1 Constructing Splits Graphs Author: Andreas W.M. Dress Daniel H. Huson Presented by: Bakhtiyar Uddin.
Greedy Routing with Guaranteed Delivery Using Ricci Flow Jie Gao Stony Brook University Rik Sarkar, Xiaotian Yin, Feng Luo, Xianfeng David Gu.
Spherical Representation & Polyhedron Routing for Load Balancing in Wireless Sensor Networks Xiaokang Yu Xiaomeng Ban Wei Zeng Rik Sarkar Xianfeng David.
 Distance Problems: › Post Office Problem › Nearest Neighbors and Closest Pair › Largest Empty and Smallest Enclosing Circle  Sub graphs of Delaunay.
Some applications of graph theory. More on the Four Color Problem.
Applications of Euler’s Formula for Graphs Hannah Stevens.
Eigenvalues and geometric representations of graphs László Lovász Microsoft Research One Microsoft Way, Redmond, WA 98052
GOLOMB RULERS AND GRACEFUL GRAPHS
1 Constructing Convex 3-Polytopes From Two Triangulations of a Polygon Benjamin Marlin Dept. of Mathematics & Statistics McGill University Godfried Toussaint.
Steinitz Representations László Lovász Microsoft Research One Microsoft Way, Redmond, WA 98052
Last time: terminology reminder w Simple graph Vertex = node Edge Degree Weight Neighbours Complete Dual Bipartite Planar Cycle Tree Path Circuit Components.
many branches of mathematics
Vertex Cut Vertex Cut: A separating set or vertex cut of a graph G is a set S  V(G) such that G-S has more than one component. a b c d e f g h i.
Graph Drawing Introduction 2005/2006. Graph Drawing: Introduction2 Contents Applications of graph drawing Planar graphs: some theory Different types of.
Computational Geometry Seminar Lecture 1
Vertex Cover, Dominating set, Clique, Independent set
2IL90: Graph Drawing Introduction Fall Graphs  Vertices  Edges.
Vertex Cut Vertex Cut: A separating set or vertex cut of a graph G is a set SV(G) such that S has more than one component. Connectivity of G ((G)): The.
Graph Colouring Lecture 20: Nov 25.
Tutte Embedding: How to Draw a Graph Kyri Pavlou Math 543 Fall 2008.
Definition Dual Graph G* of a Plane Graph:
Dept. of Computer Science Distributed Computing Group Asymptotically Optimal Mobile Ad-Hoc Routing Fabian Kuhn Roger Wattenhofer Aaron Zollinger.
Chapter 4: Straight Line Drawing Ronald Kieft. Contents Introduction Algorithm 1: Shift Method Algorithm 2: Realizer Method Other parts of chapter 4 Questions?
1 University of Denver Department of Mathematics Department of Computer Science.
Exersise 01 If A 1 is the foot of the bisector at A of the triangle ABC, and b, c the lengths of the sides CA, AB respectively, then A 1 = (Bb + Cc)/(b.
Vertex Cut Vertex Cut: A separating set or vertex cut of a graph G is a set SV(G) such that G-S has more than one component. d f b e a g c i h.
Curve Curve: The image of a continous map from [0,1] to R 2. Polygonal curve: A curve composed of finitely many line segments. Polygonal u,v-curve: A polygonal.
22C:19 Discrete Math Graphs Spring 2014 Sukumar Ghosh.
Graph Theory Ch6 Planar Graphs. Basic Definitions  curve, polygon curve, drawing  crossing, planar, planar embedding, and plane graph  open set  region,
Graph Theory Chapter 6 Planar Graphs Ch. 6. Planar Graphs.
Planar Graphs Graph G is planar, if it can be “properly” drawn in the plane. In order to explain this informal notion we have to define embeddings of graphs.
SECTION 9-2 Curves, Polygons, and Circles Slide
Graph limit theory: Algorithms László Lovász Eötvös Loránd University, Budapest May
Circle GEOMETRY Radius (or Radii for plural) The segment joining the center of a circle to a point on the circle. Example: OA.
Straight line drawings of planar graphs – part II Roeland Luitwieler.
October Large networks: a new language for science László Lovász Eötvös Loránd University, Budapest
Optimization in very large graphs László Lovász Eötvös Loránd University, Budapest December
Planar Graphs. A graph is called planar if it can be drawn in the plane in such a way that no two edges cross. Example of a planar graph: The clique on.
15-853Page :Algorithms in the Real World Planar Separators I & II – Definitions – Separators of Trees – Planar Separator Theorem.
September1999 CMSC 203 / 0201 Fall 2002 Week #13 – 18/20/22 November 2002 Prof. Marie desJardins.
Graph Colouring Lecture 20: Nov 25. This Lecture Graph coloring is another important problem in graph theory. It also has many applications, including.
Decomposition Theory in Matching Covered Graphs Qinglin Yu Nankai U., China & U. C. Cariboo, Canada.
1 11. Polygons Polygons 2D polygons ( 다각형 ) –Polygon sides are all straight lines lying in the same plane 3D polyhedra ( 다면체 )  chap. 12 –Polyhedra.
Lower Bounds for Embedding Edit Distance into Normed Spaces A. Andoni, M. Deza, A. Gupta, P. Indyk, S. Raskhodnikova.
A perfect notion László Lovász Microsoft Research To the memory of Claude Berge.
January 2016 Spectra of graphs and geometric representations László Lovász Hungarian Academy of Sciences Eötvös Loránd University
Tilings, Geometric Representations, and Discrete Analytic Functions László Lovász Microsoft Research
COMPSCI 102 Introduction to Discrete Mathematics.
Indian Institute of Technology Kharagpur PALLAB DASGUPTA Graph Theory: Planarity Pallab Dasgupta, Professor, Dept. of Computer Sc. and Engineering, IIT.
Dense graph limit theory: Extremal graph theory László Lovász Eötvös Loránd University, Budapest May
Network Formation Games. NFGs model distinct ways in which selfish agents might create and evaluate networks We’ll see two models: Global Connection Game.
Xuding Zhu National Sun Yat-sen University Circular chromatic index.
Network Formation Games. NFGs model distinct ways in which selfish agents might create and evaluate networks We’ll see two models: Global Connection Game.
Algorithms and Networks
Graph Drawing.
Vector representations of graphs
Vertex Cover, Dominating set, Clique, Independent set
GEOMETRIC CONSTRUCTION
Planarity Testing.
Every planar graph can be drawn in the plane with straight edges
Partitioning and decomposing graphs László Lovász
Vertex orderings.
Planarity.
Discrete Mathematics for Computer Science
Presentation transcript:

Nonlinear methods in discrete optimization László Lovász Eötvös Loránd University, Budapest

planar graph Fáry-Wagner Every simple planar graph can be drawn in the plane with straight edges Exercise 1: Prove this.

Rubber bands and planarity Every 3-connected planar graph can be drawn with straight edges and convex faces. Tutte (1963)

Rubber bands and planarity outer face fixed to convex polygon edges replaced by rubber bands Energy: Equilibrium:

G 3-connected planar rubber band embedding is planar Exercise 2. (a) Let L be a line intersecting the outer polygon P, and let U be the set of nodes of G that fall on a given (open) side of L. Then U induces a connected subgraph of G. (b) There cannot exists a node and a line such that the node and all its neighbors fall on this line. (c) Let ab be an edge that is not an edge of P, and let F and F’ be the two faces incident with ab. Prove that all the other nodes of F fall on one side of the line through this edge, and all the other nodes of F’ are mapped on the other side. (d) Prove the theorem above. Tutte

Discrete Riemann Mapping Theorem Coin representation Koebe (1936) Every planar graph can be represented by touching circles

Can this be obtained from a rubber band representation? Tutte representation  optimal circles Want: Minimize: Optimum satisfies  i:

Rubber bands and strengths rubber bands have strengths c ij > 0 Energy: Equilibrium:

Update strengths: The procedure converges to an equilibrium, where Exercise 3. The edges of a simple planar map are 2-colored with red and blue. Prove that there is always a node where the red edges (and so also the blue edges) are consecutive.

There is a node where “too strong” edges (and “too weak” edges) are consecutive.

A direct optimization proof [Colin de Verdiere] Variables: Set log radii of circles representing nodes log radii of circles inscribed in facets minimize p i From any Tutte representation

Polar polytope

Blocking polyhedra Fulkerson 1970 convex, ascending Exercise 4. Let K be the dominant of the convex hull of edgesets of s-t paths. Prove that the blocker is the dominant of the convex hull of edge-sets of s-t cuts.

Energy convex, ascending (recessive)

x : shortest vector in K x *: shortest vector in K *

Generalized energy convex, ascending (recessive)

Exercise 5. Prove these inequalities. Also prove that they are sharp. x : shortest vector in K x *: shortest vector in K *

Example 1. Example 2. s-t flows of value 1 and “everything above” electrical resistance between nodes s and t

Example 3 Traffic jams (directed) s t time to cross e ~ traffic through e = x e N N cars from s to t average travel time: (x e ): flow of value 1 from s to t Best average travel time = distance of 0 from the directed flow polytope

Brooks-Smith-Stone-Tutte Square tilings I

Square tilings II

Every triangulation of a quadrilateral can be represented by a square tiling of a rectangle. Schramm

Every triangulation of a quadrilateral can be represented by a square tiling of a rectangle. Schramm If the triangulation is 5-connected, then the representing squares are non-degeenerate.

K =convex hull of nodesets of u-v paths +  + n u v s t x : shortest vector in K x *: shortest vector in K * x gives lengths of edges of the squares. Exercise 6. The blocker of K is the dominant of the convex hull of s-t paths. Exercise 7. (a) How to get the position of the center of each square? (b) Complete the proof.

Unit vector flows skew symmetric vector flow Trivial necessary condition: G is 2-edge-connected.

Conjecture 1. For d=2, every 4-edge-connected graph has a unit vector flow. Conjecture 2. For d=3, every 2-edge-connected graph has a unit vector flow. Theorem. For d=7, every 2-edge-connected graph has a unit vector flow. Jain It suffices to consider 3-edge-connected 3-regular graphs Exercise 8. Prove conjecture 2 for planar graphs.

[Schramm] unit vector flow?

Conjecture 2’. Conjecture 2’’. Every 3-regular 3-connected graph can be drawn on the sphere so that every edge is an arc of a large circle, and at every node, any two edges form 120 o. Exercise 9. Conjectures 2' and 2" are equivalent to Conjecture 2.

Antiblocking polyhedra Fulkerson 1971 convex corner (polarity in the nonnegative orthant)

The stable set polytope

Graph entropy Körner 1973 p : probability distribution on V(G)

connected iff distinguishable Want: encode most of V(G) t by 0-1 words of min length, so that distinguishable words get different codes. (measure of “complexity” of G )

Csiszár, Körner, Lovász, Marton, Simonyi