CSC Metric Embeddings Lecture 8: Sparsest Cut and Embedding to
|
|
- Eugene Little
- 5 years ago
- Views:
Transcription
1 CSC21 - Metric Embeddings Lecture 8: Sparsest Cut and Embedding to Notes taken by Nilesh ansal revised by Hamed Hatami Summary: Sparsest Cut (SC) is an important problem ith various applications, including those in VLSI layout design, packet routing in distributed netorking, and clustering ut since sparsest cut is NP-hard, e need to find approximate algorithms Solution to uniform Multi Commodity Flo (MCF) problem using Linear Programming (LP) can be used to approximate SC by in polynomial time We then discuss, Poincaré inequalities for metrics, hich can be used to find loer bounds for distortion for embedding a metric to This discussion is further continued, and e define -gonal inequalities and hypermetrics 1 Sparsest Cut Definition 11 Flux of a graph is defined as,!#" $ %& ')(+*-,/ '0 1# * here 89;:<2 The cut hich minimizes the flux is knon as the minimum quotient separator Computing minimum quotient separator is NP-complete Definition 12 Sparsity of a graph >?@ is defined as, " $ %& ')(+* 6 2 CD The cut hich minimizes the sparsity is knon as the sparsest cut (SC), hich is NP-hard to compute Remark 13 Sparsity and flux of a graph are closely related! "FE "FEHG! " I Lecture Notes for a course given by vner Magen, Dept of Computer Sciecne, University of Toronto 1
2 _ 11 pproximate Solutions to Sparsest Cut Lemma 1 Solving sparsest cut is equivalent to solving minimize ONP RSUTV subject to ON * WRUTDX [ ZY Proof If \ ' represents the metric corresponding to the cut, e can rite, 6 >2 V ONP \ ' WRSTD ^ \ ' WRSTD H_ and therefore, $ %& 6 >2 ONP \ ' RSTD ' V H$ %& ' \ ' RSUTV H_ Recall that C metrics are linear combinations of cut metrics, and therefore cut metrics are extreme rays of C From the lemma proved in the last lecture, ratio in the equation above is minimized at one of the extreme rays of the cone Therefore, 6 >2 ONP KfL $`%& ' Ca H$ %& b Nced g_ Since this is invariant to scaling, ithout loss of generality, e can assume that the sum X C to If e relax our requirement from is a metric by adding i#j>klnm triangle inequalities, e can solve this problemhy in polynomial time using Linear Programming (LP) The relaxed LP to solve is minimize subject to ONPo WRSTD KfL ON * WRUTD?pX RSTDrqgs, and WRSTD tta@ru RSTD E WRSvx TSvy (1) Theorem 1 There exists an W t a? approximate algorithm for the sparsest cut problem Theorem 1 is due to [LLR9 but it originally appeared in [LR88 2
3 Y Proof Equation 1 can be solved using LP to get a solution (hich is a metric) Using the ourgain s theorem [ou8, e can find an embedding )z y k of {z to Y ith distortion No can be expressed as a linear combination of cut metrics ' N < ' \ ', here ˆ is a collection of cuts Since is in the cone of cut metrics, From ourgain s theorem, ut, Therefore, $ %t& ' N ONP ONP \ ' RSTD \ ' RSTD $ %t& ' N ONP ONP \ ' RSTD \ ' RSTD H_ -z bs $`%& ONP is metric z E ONP? E ONP H_ E ONP VŠKfL ŠKfL KfL -z KfL z KfL Dz z E ONP \ ' $`%& ' K \ ' WRSTD WRUTD _ E?-$`%& ' _ ONP \ ' WRSTD \ ' WRSTD 12 Non-Uniform Sparsest Cut What e have discussed till no can be generalized to the case of non-uniform sparsest cut, here e have to minimize 0 KfL \ ' RSTD +Œ KfL \ ' WRSTD For the problem of uniform sparsest cut, X if RST Œ X alays 2 Multi Commodity Flo Problem, and 0 otherise; and In a Multi Commodity Flo (MCF) problem, there are ŽqX commodities, each ith its on source K, sink K and demand K The aim is to simultaneously route all the commodities from their source to sink in a ay that total amount of commodity passing through an edge is not more than the capacity of the edge In our analysis e ill only discuss a special kind of MCF that e call a uniform multi-commodity flo 3
4 E E problem In this special case, all edges have capacity X, and demand K is same for all the commodities Hence the problem statement in the uniform multi-commodity flo problem is to ship simultaneously maximum amount of commodity beteen each pair of vertices Remark 21 Uniform multi-commodity flo problem forms the dual to the approximate sparsest cut problem presented in Equation (1) 21 Uniform Sparsest Cut units from each vertex in to, the total flo across the cut ill Since the number of edges carrying this load is 6 >, the maximal flo If e ant to ship be t beteen each pair is bounded by 6 >2 ny feasible solution to uniform MCF must therefore have the solution to sparsest cut problem, " ;$ %& ')(+* ", here " P 'V, ' is '{ / '{ While E " is neces- sary, it is not alays sufficient for a uniform MCF to have a flo of size Since MCF Therefore, forms dual to approximate y [ ", from Theorem 1, " E W t a? E " E W t a? No e ill prove that W t a? is a tight bound by providing an example here " q W t a Consider a constant degree expander graph ith degree š We ant to ship units of commodity beteen every pair of vertices The contribution to total load from flo beteen to vertices and œ is at least " eœv, here " W eœv is the length of shortest path Hence total load is at least " WRSTD Since for H_ a constant degree graph, a large fraction of pair of vertices are in distance asymptotically, _ x " WRUTD?y
5 Y Y Y Since total number of edges is +šž G ith capacity 1 each, t a E +š G Xa Therefore Since ; P 'V, ' k k Ÿ '0,/ ') q for every F g in expander graphs, 6 > CV q X 6 2? $ %& The difference in the solution to MCF and SC in this case is Remark 22 Sparsest Cut is NP-hard MCF is solvable using linear programming Solution to MCF is ithin W t a? to the solution of the sparsest cut Hence e can use MCF to find approximation to sparsest cut 3 Loer ound for Embedding to X To compute the loer bounds for distortion hen embedding to, e ill first construct an inequality that holds for, and then use this inequality to say something about distortion hile embedding to The inequality e ill construct falls under the general class of Poincaré inequalities, and is of form,! D K+ LV qh D K+ LV (2) We need to determine! to ill be at least, a metric such that Equation (2) holds true Distortion for embedding KfL! RSUTV RSTD if Equation (2) holds true for all C metrics Since linear metrics can be expressed as a linear combination of cut metrics, for every [, ' N ' \ ' Thus Equation (2) ill hold true if the equation belo holds true for all ˆ Let be a graph ith determine! and can be to set,! KfL X if RSUT and KfL! \ ' RSTD q X KfL \ ' WRSTD K ª K '! q K ',L KfL,L separated by,l separated by (3) " as the metric induced by it, then one possible attempt to, a constant and s otherise ( is the edge set), y
6 In this case, for a cut, and separated by '! separated by ' Since this must hold true for all, e can set 6 >? a CD $ %& ' P 'V, ' '0 / 'v for the Poincaré inequality in Equation 2 to hold true Therefore, the minimum distortion for embedding a metric in [ is at least,! RSTD WRUTD $ %& ' P 'V, ' '0 / '{ WRUTD For a constant degree expander ith nodes and degree š this becomes, «W k +š ; O because in a constant degree graph, a constant fraction of asymptotically pair of vertices have length Theorem 31 constant degree expander graph requires distortion W t a for embedding to 31 -Gonal Inequalities Let be an -dimensional integral vector, holds true if e set 1,! K L y and KfL > K L ±< Y k, such that K K X Equation (2) 1 For a real number ², ³ ²nµ> ² if ² ¹ º and º otherise ³²[µu»Ž ¼³²[µW ¾½`² Examples, ³À yµ> Á Â, ³W½ yµ> 6 Žº, ³W½ÃOµW ĺ, ³>½ÃOµU»6 ŽÃ 6
7 E E s Ë Õ Õ l Õ Ó Ó l Ó K K This can proved by proving the Equation (3) for all separated by '! separated by ' Remark 32 For all separated by > K L S Ä > K L ± separated by ' K L Åx K N ' Å K N ' K Æ ÇÈ K Æ ÇÈ X Ë L N 3 ' LOÉÊ X LON ' LyÉÊ because here ËÌ KWN ' K X K is an integer Y k, such that K K X, > K L Kx LD q > K L ± K+ LV () is a valid inequality This inequality is knon as -gonal inequality, ith K Example 33 Let K px, L X and SÍx X and all other ÏÎÐ s Equation can be ritten as, K LV K+ LV Ñ K Í K+ Í F L Í Í LV E s) ie, K+ LV E Kx Í Í LV hich is the ell knon triangle inequality Example 3 Consider a vector oò exïxaïxa X X[ [, it must satisfy, Y¼ ÔÓ Thus if a metric l l () Õ Ó Consider the bipartite graph Ö Ï, l ith metric For this graph metric, LHS of Equation () is 8, hile RHS is 6 Hence Ö Ï, l V can eø Ùnot be isometrically embedded to [, and the distortion must be at least ÚÛ is a hyper- Remark 3 If a metric metric Therefore, C is a hypermetric satisfies the all the -gonal inequalities, then is in
8 1 2 3 Figure 1: Ö O, l bipartite graph [ hypermetrics all metrics Figure 2: schematic diagram shoing that all metrics are, hich in turn are hypermetrics References [ou8 ourgain On lipschitz embedding of finite metric spaces in hilbert space Israel ournal of Mathematics, 198 [LLR9 Nathan Linial, Eran London, and Yuri Rabinovich The geometry of graphs and some of its algorithmic applications In 3th nnual Symposium on Foundations of Computer Science, pages 91, Santa Fe, Ne Mexico, November 199 IEEE [LR88 Tom Leighton and Satish Rao n approximate max-flo min-cut theorem for uniform multicommodity flo problems ith applications to approxima- 8
9 tion algorithms In 29th nnual Symposium on Foundations of Computer Science, pages 22 31, White Plains, Ne York, 2 26 October 1988 IEEE 9
CSC Metric Embeddings Lecture 7: Lower bounds on the embeddability in via expander graphs and some algorithmic connections to
CSC2414 - Metric Embeddings Lecture 7: Lower bounds on the embeddability in via expander graphs and some algorithmic connections to Notes taken by Periklis Papakonstantinou revised by Hamed Hatami Summary:
More informationTopic: Balanced Cut, Sparsest Cut, and Metric Embeddings Date: 3/21/2007
CS880: Approximations Algorithms Scribe: Tom Watson Lecturer: Shuchi Chawla Topic: Balanced Cut, Sparsest Cut, and Metric Embeddings Date: 3/21/2007 In the last lecture, we described an O(log k log D)-approximation
More informationLecture: Flow-based Methods for Partitioning Graphs (1 of 2)
Stat260/CS294: Spectral Graph Methods Lecture 10-02/24/2015 Lecture: Flow-based Methods for Partitioning Graphs (1 of 2) Lecturer: Michael Mahoney Scribe: Michael Mahoney Warning: these notes are still
More information236 Chapter 4 Applications of Derivatives
26 Chapter Applications of Derivatives Î$ &Î$ Î$ 5 Î$ 0 "Î$ 5( 2) $È 26. (a) g() œ ( 5) œ 5 Ê g () œ œ Ê critical points at œ 2 and œ 0 Ê g œ ± )(, increasing on ( _ß 2) and (!ß _), decreasing on ( 2 ß!)!
More informationLecture #21. c T x Ax b. maximize subject to
COMPSCI 330: Design and Analysis of Algorithms 11/11/2014 Lecture #21 Lecturer: Debmalya Panigrahi Scribe: Samuel Haney 1 Overview In this lecture, we discuss linear programming. We first show that the
More informationFinite Metric Spaces & Their Embeddings: Introduction and Basic Tools
Finite Metric Spaces & Their Embeddings: Introduction and Basic Tools Manor Mendel, CMI, Caltech 1 Finite Metric Spaces Definition of (semi) metric. (M, ρ): M a (finite) set of points. ρ a distance function
More informationORIE 6334 Spectral Graph Theory November 22, Lecture 25
ORIE 64 Spectral Graph Theory November 22, 206 Lecture 25 Lecturer: David P. Williamson Scribe: Pu Yang In the remaining three lectures, we will cover a prominent result by Arora, Rao, and Vazirani for
More information1. Suppose preferences are represented by the Cobb-Douglas utility function, u(x1,x2) = Ax 1 a x 2
Additional questions for chapter 7 1. Suppose preferences are represented by the Cobb-Douglas utility function ux1x2 = Ax 1 a x 2 1-a 0 < a < 1 &A > 0. Assuming an interior solution solve for the Marshallian
More informationPart I consists of 14 multiple choice questions (worth 5 points each) and 5 true/false question (worth 1 point each), for a total of 75 points.
Math 131 Exam 1 Solutions Part I consists of 14 multiple choice questions (orth 5 points each) and 5 true/false question (orth 1 point each), for a total of 75 points. 1. The folloing table gives the number
More informationTravelling Salesman Problem
Travelling Salesman Problem Fabio Furini November 10th, 2014 Travelling Salesman Problem 1 Outline 1 Traveling Salesman Problem Separation Travelling Salesman Problem 2 (Asymmetric) Traveling Salesman
More informationRandomized Smoothing Networks
Randomized Smoothing Netorks Maurice Herlihy Computer Science Dept., Bron University, Providence, RI, USA Srikanta Tirthapura Dept. of Electrical and Computer Engg., Ioa State University, Ames, IA, USA
More information- Well-characterized problems, min-max relations, approximate certificates. - LP problems in the standard form, primal and dual linear programs
LP-Duality ( Approximation Algorithms by V. Vazirani, Chapter 12) - Well-characterized problems, min-max relations, approximate certificates - LP problems in the standard form, primal and dual linear programs
More information! " # $! % & '! , ) ( + - (. ) ( ) * + / 0 1 2 3 0 / 4 5 / 6 0 ; 8 7 < = 7 > 8 7 8 9 : Œ Š ž P P h ˆ Š ˆ Œ ˆ Š ˆ Ž Ž Ý Ü Ý Ü Ý Ž Ý ê ç è ± ¹ ¼ ¹ ä ± ¹ w ç ¹ è ¼ è Œ ¹ ± ¹ è ¹ è ä ç w ¹ ã ¼ ¹ ä ¹ ¼ ¹ ±
More informationarxiv: v2 [physics.gen-ph] 28 Oct 2017
A CHART FOR THE ENERGY LEVELS OF THE SQUARE QUANTUM WELL arxiv:1610.04468v [physics.gen-ph] 8 Oct 017 M. CHIANI Abstract. A chart for the quantum mechanics of a particle of mass m in a one-dimensional
More informationNotes taken by Costis Georgiou revised by Hamed Hatami
CSC414 - Metric Embeddings Lecture 6: Reductions that preserve volumes and distance to affine spaces & Lower bound techniques for distortion when embedding into l Notes taken by Costis Georgiou revised
More informationLecture 9: Dantzig-Wolfe Decomposition
Lecture 9: Dantzig-Wolfe Decomposition (3 units) Outline Dantzig-Wolfe decomposition Column generation algorithm Relation to Lagrangian dual Branch-and-price method Generated assignment problem and multi-commodity
More informationEnhancing Generalization Capability of SVM Classifiers with Feature Weight Adjustment
Enhancing Generalization Capability of SVM Classifiers ith Feature Weight Adjustment Xizhao Wang and Qiang He College of Mathematics and Computer Science, Hebei University, Baoding 07002, Hebei, China
More informationU.C. Berkeley CS294: Spectral Methods and Expanders Handout 11 Luca Trevisan February 29, 2016
U.C. Berkeley CS294: Spectral Methods and Expanders Handout Luca Trevisan February 29, 206 Lecture : ARV In which we introduce semi-definite programming and a semi-definite programming relaxation of sparsest
More informationPartitioning Algorithms that Combine Spectral and Flow Methods
CS369M: Algorithms for Modern Massive Data Set Analysis Lecture 15-11/11/2009 Partitioning Algorithms that Combine Spectral and Flow Methods Lecturer: Michael Mahoney Scribes: Kshipra Bhawalkar and Deyan
More informationEXCERPTS FROM ACTEX CALCULUS REVIEW MANUAL
EXCERPTS FROM ACTEX CALCULUS REVIEW MANUAL Table of Contents Introductory Comments SECTION 6 - Differentiation PROLEM SET 6 TALE OF CONTENTS INTRODUCTORY COMMENTS Section 1 Set Theory 1 Section 2 Intervals,
More informationMulticommodity Flows and Column Generation
Lecture Notes Multicommodity Flows and Column Generation Marc Pfetsch Zuse Institute Berlin pfetsch@zib.de last change: 2/8/2006 Technische Universität Berlin Fakultät II, Institut für Mathematik WS 2006/07
More informationIntroduction to Algorithms
Introduction to Algorithms 6.046J/18.401J/SMA5503 Lecture 18 Prof. Erik Demaine Negative-weight cycles Recall: If a graph G = (V, E) contains a negativeweight cycle, then some shortest paths may not exist.
More informationModèles stochastiques II
Modèles stochastiques II INFO 154 Gianluca Bontempi Département d Informatique Boulevard de Triomphe - CP 1 http://ulbacbe/di Modéles stochastiques II p1/50 The basics of statistics Statistics starts ith
More informationLA PRISE DE CALAIS. çoys, çoys, har - dis. çoys, dis. tons, mantz, tons, Gas. c est. à ce. C est à ce. coup, c est à ce
> ƒ? @ Z [ \ _ ' µ `. l 1 2 3 z Æ Ñ 6 = Ð l sl (~131 1606) rn % & +, l r s s, r 7 nr ss r r s s s, r s, r! " # $ s s ( ) r * s, / 0 s, r 4 r r 9;: < 10 r mnz, rz, r ns, 1 s ; j;k ns, q r s { } ~ l r mnz,
More informationStat 8112 Lecture Notes Weak Convergence in Metric Spaces Charles J. Geyer January 23, Metric Spaces
Stat 8112 Lecture Notes Weak Convergence in Metric Spaces Charles J. Geyer January 23, 2013 1 Metric Spaces Let X be an arbitrary set. A function d : X X R is called a metric if it satisfies the folloing
More informationAn Example file... log.txt
# ' ' Start of fie & %$ " 1 - : 5? ;., B - ( * * B - ( * * F I / 0. )- +, * ( ) 8 8 7 /. 6 )- +, 5 5 3 2( 7 7 +, 6 6 9( 3 5( ) 7-0 +, => - +< ( ) )- +, 7 / +, 5 9 (. 6 )- 0 * D>. C )- +, (A :, C 0 )- +,
More informationChapter 1 Linear Programming. Paragraph 5 Duality
Chapter 1 Linear Programming Paragraph 5 Duality What we did so far We developed the 2-Phase Simplex Algorithm: Hop (reasonably) from basic solution (bs) to bs until you find a basic feasible solution
More informationDuality of LPs and Applications
Lecture 6 Duality of LPs and Applications Last lecture we introduced duality of linear programs. We saw how to form duals, and proved both the weak and strong duality theorems. In this lecture we will
More informationCHAPTER V MULTIPLE SCALES..? # w. 5?œ% 0 a?ß?ß%.?.? # %?œ!.>#.>
CHAPTER V MULTIPLE SCALES This chapter and the next concern initial value prolems of oscillatory type on long intervals of time. Until Chapter VII e ill study autonomous oscillatory second order initial
More informationOn Shortest Single/Multiple Path Computation Problems in Fiber-Wireless (FiWi) Access Networks
2014 IEEE 15th International Conference on High Performance Sitching and Routing (HPSR) On Shortest Single/Multiple Path Computation Problems in Fiber-Wireless (FiWi) Access Netorks Chenyang Zhou, Anisha
More informationCSC Linear Programming and Combinatorial Optimization Lecture 10: Semidefinite Programming
CSC2411 - Linear Programming and Combinatorial Optimization Lecture 10: Semidefinite Programming Notes taken by Mike Jamieson March 28, 2005 Summary: In this lecture, we introduce semidefinite programming
More informationEnergy Minimization via a Primal-Dual Algorithm for a Convex Program
Energy Minimization via a Primal-Dual Algorithm for a Convex Program Evripidis Bampis 1,,, Vincent Chau 2,, Dimitrios Letsios 1,2,, Giorgio Lucarelli 1,2,,, and Ioannis Milis 3, 1 LIP6, Université Pierre
More informationCSC373: Algorithm Design, Analysis and Complexity Fall 2017 DENIS PANKRATOV NOVEMBER 1, 2017
CSC373: Algorithm Design, Analysis and Complexity Fall 2017 DENIS PANKRATOV NOVEMBER 1, 2017 Linear Function f: R n R is linear if it can be written as f x = a T x for some a R n Example: f x 1, x 2 =
More information3 - Vector Spaces Definition vector space linear space u, v,
3 - Vector Spaces Vectors in R and R 3 are essentially matrices. They can be vieed either as column vectors (matrices of size and 3, respectively) or ro vectors ( and 3 matrices). The addition and scalar
More informationAn Introduction to Optimal Control Applied to Disease Models
An Introduction to Optimal Control Applied to Disease Models Suzanne Lenhart University of Tennessee, Knoxville Departments of Mathematics Lecture1 p.1/37 Example Number of cancer cells at time (exponential
More informationAlgebraic Geometry (Intersection Theory) Seminar
Algebraic Geometry (Intersection Theory) Seminar Lecture 1 (January 20, 2009) We ill discuss cycles, rational equivalence, and Theorem 1.4 in Fulton, as ell as push-forard of rational equivalence. Notationise,
More informationand sinθ = cosb =, and we know a and b are acute angles, find cos( a+ b) Trigonometry Topics Accuplacer Review revised July 2016 sin.
Trigonometry Topics Accuplacer Revie revised July 0 You ill not be alloed to use a calculator on the Accuplacer Trigonometry test For more information, see the JCCC Testing Services ebsite at http://jcccedu/testing/
More informationLecture 17: Cheeger s Inequality and the Sparsest Cut Problem
Recent Advances in Approximation Algorithms Spring 2015 Lecture 17: Cheeger s Inequality and the Sparsest Cut Problem Lecturer: Shayan Oveis Gharan June 1st Disclaimer: These notes have not been subjected
More informationEcon 201: Problem Set 3 Answers
Econ 20: Problem Set 3 Ansers Instructor: Alexandre Sollaci T.A.: Ryan Hughes Winter 208 Question a) The firm s fixed cost is F C = a and variable costs are T V Cq) = 2 bq2. b) As seen in class, the optimal
More informationA Generalization of a result of Catlin: 2-factors in line graphs
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 72(2) (2018), Pages 164 184 A Generalization of a result of Catlin: 2-factors in line graphs Ronald J. Gould Emory University Atlanta, Georgia U.S.A. rg@mathcs.emory.edu
More informationBBM402-Lecture 20: LP Duality
BBM402-Lecture 20: LP Duality Lecturer: Lale Özkahya Resources for the presentation: https://courses.engr.illinois.edu/cs473/fa2016/lectures.html An easy LP? which is compact form for max cx subject to
More informationKey words. sparsification, approximation algorithm, graph partitioning, routing, metric space
VERTEX SPARSIFICATION AND OBLIVIOUS REDUCTIONS ANKUR MOITRA Abstract. Given an undirected, capacitated graph G = (V, E) and a set K V of terminals of size k, we construct an undirected, capacitated graph
More informationMachine Learning: Logistic Regression. Lecture 04
Machine Learning: Logistic Regression Razvan C. Bunescu School of Electrical Engineering and Computer Science bunescu@ohio.edu Supervised Learning Task = learn an (unkon function t : X T that maps input
More informationCO 250 Final Exam Guide
Spring 2017 CO 250 Final Exam Guide TABLE OF CONTENTS richardwu.ca CO 250 Final Exam Guide Introduction to Optimization Kanstantsin Pashkovich Spring 2017 University of Waterloo Last Revision: March 4,
More informationVectors. Teaching Learning Point. Ç, where OP. l m n
Vectors 9 Teaching Learning Point l A quantity that has magnitude as well as direction is called is called a vector. l A directed line segment represents a vector and is denoted y AB Å or a Æ. l Position
More informationLecture 18: March 15
CS71 Randomness & Computation Spring 018 Instructor: Alistair Sinclair Lecture 18: March 15 Disclaimer: These notes have not been subjected to the usual scrutiny accorded to formal publications. They may
More informationLecture 9 Tuesday, 4/20/10. Linear Programming
UMass Lowell Computer Science 91.503 Analysis of Algorithms Prof. Karen Daniels Spring, 2010 Lecture 9 Tuesday, 4/20/10 Linear Programming 1 Overview Motivation & Basics Standard & Slack Forms Formulating
More informationFramework for functional tree simulation applied to 'golden delicious' apple trees
Purdue University Purdue e-pubs Open Access Theses Theses and Dissertations Spring 2015 Framework for functional tree simulation applied to 'golden delicious' apple trees Marek Fiser Purdue University
More informationComplex Analysis. PH 503 Course TM. Charudatt Kadolkar Indian Institute of Technology, Guwahati
Complex Analysis PH 503 Course TM Charudatt Kadolkar Indian Institute of Technology, Guwahati ii Copyright 2000 by Charudatt Kadolkar Preface Preface Head These notes were prepared during the lectures
More informationLecture: Expanders, in theory and in practice (2 of 2)
Stat260/CS294: Spectral Graph Methods Lecture 9-02/19/2015 Lecture: Expanders, in theory and in practice (2 of 2) Lecturer: Michael Mahoney Scribe: Michael Mahoney Warning: these notes are still very rough.
More informationThe Capacity of a Network
The Capacity of a Network April Rasala Lehman MIT Collaborators: Nick Harvey and Robert Kleinberg MIT What is the Capacity of a Network? Source a Source b c d e Sink f Sink What is the Capacity of a Network?
More informationFréchet embeddings of negative type metrics
Fréchet embeddings of negative type metrics Sanjeev Arora James R Lee Assaf Naor Abstract We show that every n-point metric of negative type (in particular, every n-point subset of L 1 ) admits a Fréchet
More informationDiscrete Optimization 23
Discrete Optimization 23 2 Total Unimodularity (TU) and Its Applications In this section we will discuss the total unimodularity theory and its applications to flows in networks. 2.1 Total Unimodularity:
More informationAssessment Exemplars: Polynomials, Radical and Rational Functions & Equations
Class: Date: Assessment Exemplars: Polynomials, Radical and Rational Functions & Equations 1 Express the following polynomial function in factored form: P( x) = 10x 3 + x 2 52x + 20 2 SE: Express the following
More informationDoubling metric spaces and embeddings. Assaf Naor
Doubling metric spaces and embeddings Assaf Naor Our approach to general metric spaces bears the undeniable imprint of early exposure to Euclidean geometry. We just love spaces sharing a common feature
More informationCSC Linear Programming and Combinatorial Optimization Lecture 12: The Lift and Project Method
CSC2411 - Linear Programming and Combinatorial Optimization Lecture 12: The Lift and Project Method Notes taken by Stefan Mathe April 28, 2007 Summary: Throughout the course, we have seen the importance
More informationJuan Juan Salon. EH National Bank. Sandwich Shop Nail Design. OSKA Beverly. Chase Bank. Marina Rinaldi. Orogold. Mariposa.
( ) X é X é Q Ó / 8 ( ) Q / ( ) ( ) : ( ) : 44-3-8999 433 4 z 78-19 941, #115 Z 385-194 77-51 76-51 74-7777, 75-5 47-55 74-8141 74-5115 78-3344 73-3 14 81-4 86-784 78-33 551-888 j 48-4 61-35 z/ zz / 138
More informationMax-Margin Ratio Machine
JMLR: Workshop and Conference Proceedings 25:1 13, 2012 Asian Conference on Machine Learning Max-Margin Ratio Machine Suicheng Gu and Yuhong Guo Department of Computer and Information Sciences Temple University,
More informationOptimal Control of PDEs
Optimal Control of PDEs Suzanne Lenhart University of Tennessee, Knoville Department of Mathematics Lecture1 p.1/36 Outline 1. Idea of diffusion PDE 2. Motivating Eample 3. Big picture of optimal control
More informationA turbulence closure based on the maximum entropy method
Advances in Fluid Mechanics IX 547 A turbulence closure based on the maximum entropy method R. W. Derksen Department of Mechanical and Manufacturing Engineering University of Manitoba Winnipeg Canada Abstract
More informationLecture 8: Path Technology
Counting and Sampling Fall 07 Lecture 8: Path Technology Lecturer: Shayan Oveis Gharan October 0 Disclaimer: These notes have not been subjected to the usual scrutiny reserved for formal publications.
More information1 Perfect Matching and Matching Polytopes
CS 598CSC: Combinatorial Optimization Lecture date: /16/009 Instructor: Chandra Chekuri Scribe: Vivek Srikumar 1 Perfect Matching and Matching Polytopes Let G = (V, E be a graph. For a set E E, let χ E
More informationSDP Relaxations for MAXCUT
SDP Relaxations for MAXCUT from Random Hyperplanes to Sum-of-Squares Certificates CATS @ UMD March 3, 2017 Ahmed Abdelkader MAXCUT SDP SOS March 3, 2017 1 / 27 Overview 1 MAXCUT, Hardness and UGC 2 LP
More informationPreliminaries. Definition: The Euclidean dot product between two vectors is the expression. i=1
90 8 80 7 70 6 60 0 8/7/ Preliminaries Preliminaries Linear models and the perceptron algorithm Chapters, T x + b < 0 T x + b > 0 Definition: The Euclidean dot product beteen to vectors is the expression
More informationExploring the relationship between a fluid container s geometry and when it will balance on edge
Exploring the relationship eteen a fluid container s geometry and hen it ill alance on edge Ryan J. Moriarty California Polytechnic State University Contents 1 Rectangular container 1 1.1 The first geometric
More informationLecture 21 November 11, 2014
CS 224: Advanced Algorithms Fall 2-14 Prof. Jelani Nelson Lecture 21 November 11, 2014 Scribe: Nithin Tumma 1 Overview In the previous lecture we finished covering the multiplicative weights method and
More information16.1 Min-Cut as an LP
600.469 / 600.669 Approximation Algorithms Lecturer: Michael Dinitz Topic: LPs as Metrics: Min Cut and Multiway Cut Date: 4//5 Scribe: Gabriel Kaptchuk 6. Min-Cut as an LP We recall the basic definition
More informationCHARACTERIZATION OF ULTRASONIC IMMERSION TRANSDUCERS
CHARACTERIZATION OF ULTRASONIC IMMERSION TRANSDUCERS INTRODUCTION David D. Bennink, Center for NDE Anna L. Pate, Engineering Science and Mechanics Ioa State University Ames, Ioa 50011 In any ultrasonic
More informationy(x) = x w + ε(x), (1)
Linear regression We are ready to consider our first machine-learning problem: linear regression. Suppose that e are interested in the values of a function y(x): R d R, here x is a d-dimensional vector-valued
More informationQUESTIONS ON QUARKONIUM PRODUCTION IN NUCLEAR COLLISIONS
International Workshop Quarkonium Working Group QUESTIONS ON QUARKONIUM PRODUCTION IN NUCLEAR COLLISIONS ALBERTO POLLERI TU München and ECT* Trento CERN - November 2002 Outline What do we know for sure?
More informationChapter Eight The Formal Structure of Quantum Mechanical Function Spaces
Chapter Eight The Formal Structure of Quantum Mechanical Function Spaces Introduction In this chapter, e introduce the formal structure of quantum theory. This formal structure is based primarily on the
More informationSemi-simple Splicing Systems
Semi-simple Splicing Systems Elizabeth Goode CIS, University of Delaare Neark, DE 19706 goode@mail.eecis.udel.edu Dennis Pixton Mathematics, Binghamton University Binghamton, NY 13902-6000 dennis@math.binghamton.edu
More informationTopics in Approximation Algorithms Solution for Homework 3
Topics in Approximation Algorithms Solution for Homework 3 Problem 1 We show that any solution {U t } can be modified to satisfy U τ L τ as follows. Suppose U τ L τ, so there is a vertex v U τ but v L
More informationAverage Coset Weight Distributions of Gallager s LDPC Code Ensemble
1 Average Coset Weight Distributions of Gallager s LDPC Code Ensemble Tadashi Wadayama Abstract In this correspondence, the average coset eight distributions of Gallager s LDPC code ensemble are investigated.
More informationConsider this problem. A person s utility function depends on consumption and leisure. Of his market time (the complement to leisure), h t
VI. INEQUALITY CONSTRAINED OPTIMIZATION Application of the Kuhn-Tucker conditions to inequality constrained optimization problems is another very, very important skill to your career as an economist. If
More information" #$ P UTS W U X [ZY \ Z _ `a \ dfe ih j mlk n p q sr t u s q e ps s t x q s y i_z { U U z W } y ~ y x t i e l US T { d ƒ ƒ ƒ j s q e uˆ ps i ˆ p q y
" #$ +. 0. + 4 6 4 : + 4 ; 6 4 < = =@ = = =@ = =@ " #$ P UTS W U X [ZY \ Z _ `a \ dfe ih j mlk n p q sr t u s q e ps s t x q s y i_z { U U z W } y ~ y x t i e l US T { d ƒ ƒ ƒ j s q e uˆ ps i ˆ p q y h
More information4.3 Laplace Transform in Linear System Analysis
4.3 Laplace Transform in Linear System Analysis The main goal in analysis of any dynamic system is to find its response to a given input. The system response in general has two components: zero-state response
More informationON THE INTEGRALITY OF THE UNCAPACITATED FACILITY LOCATION POLYTOPE. 1. Introduction
ON THE INTEGRALITY OF THE UNCAPACITATED FACILITY LOCATION POLYTOPE MOURAD BAÏOU AND FRANCISCO BARAHONA Abstract We study a system of linear inequalities associated with the uncapacitated facility location
More information1 Integer Decomposition Property
CS 598CSC: Combinatorial Optimization Lecture date: Feb 2, 2010 Instructor: Chandra Chekuri Scribe: Siva Theja Maguluri Material taken mostly from [1] (Chapter 19). 1 Integer Decomposition Property A polyhedron
More informationNonlinear Projection Trick in kernel methods: An alternative to the Kernel Trick
Nonlinear Projection Trick in kernel methods: An alternative to the Kernel Trick Nojun Kak, Member, IEEE, Abstract In kernel methods such as kernel PCA and support vector machines, the so called kernel
More information15-850: Advanced Algorithms CMU, Fall 2018 HW #4 (out October 17, 2018) Due: October 28, 2018
15-850: Advanced Algorithms CMU, Fall 2018 HW #4 (out October 17, 2018) Due: October 28, 2018 Usual rules. :) Exercises 1. Lots of Flows. Suppose you wanted to find an approximate solution to the following
More informationOn the approximation of real powers of sparse, infinite, bounded and Hermitian matrices
On the approximation of real poers of sparse, infinite, bounded and Hermitian matrices Roman Werpachoski Center for Theoretical Physics, Al. Lotnikó 32/46 02-668 Warszaa, Poland Abstract We describe a
More informationSIMULTANEOUS CONFIDENCE BANDS FOR THE PTH PERCENTILE AND THE MEAN LIFETIME IN EXPONENTIAL AND WEIBULL REGRESSION MODELS. Ping Sa and S.J.
SIMULTANEOUS CONFIDENCE BANDS FOR THE PTH PERCENTILE AND THE MEAN LIFETIME IN EXPONENTIAL AND WEIBULL REGRESSION MODELS " # Ping Sa and S.J. Lee " Dept. of Mathematics and Statistics, U. of North Florida,
More information11.1 Set Cover ILP formulation of set cover Deterministic rounding
CS787: Advanced Algorithms Lecture 11: Randomized Rounding, Concentration Bounds In this lecture we will see some more examples of approximation algorithms based on LP relaxations. This time we will use
More informationA shortening of C on the coordinate i is the [n 1, k 1, d] linear code obtained by leaving only such codewords and deleting the ith coordinate.
ENEE 739C: Advanced Topics in Signal Processing: Coding Theory Instructor: Alexander Barg Lecture 6a (draft; 9/21/03. Linear codes. Weights, supports, ranks. http://.enee.umd.edu/ abarg/enee739c/course.html
More informationLanguage Recognition Power of Watson-Crick Automata
01 Third International Conference on Netorking and Computing Language Recognition Poer of Watson-Crick Automata - Multiheads and Sensing - Kunio Aizaa and Masayuki Aoyama Dept. of Mathematics and Computer
More informationNotes taken by Graham Taylor. January 22, 2005
CSC4 - Linear Programming and Combinatorial Optimization Lecture : Different forms of LP. The algebraic objects behind LP. Basic Feasible Solutions Notes taken by Graham Taylor January, 5 Summary: We first
More informationIntroduction to Semidefinite Programming I: Basic properties a
Introduction to Semidefinite Programming I: Basic properties and variations on the Goemans-Williamson approximation algorithm for max-cut MFO seminar on Semidefinite Programming May 30, 2010 Semidefinite
More information4. Duality Duality 4.1 Duality of LPs and the duality theorem. min c T x x R n, c R n. s.t. ai Tx = b i i M a i R n
2 4. Duality of LPs and the duality theorem... 22 4.2 Complementary slackness... 23 4.3 The shortest path problem and its dual... 24 4.4 Farkas' Lemma... 25 4.5 Dual information in the tableau... 26 4.6
More informationBivariate Uniqueness in the Logistic Recursive Distributional Equation
Bivariate Uniqueness in the Logistic Recursive Distributional Equation Antar Bandyopadhyay Technical Report # 629 University of California Department of Statistics 367 Evans Hall # 3860 Berkeley CA 94720-3860
More informationLinear Programming. Jie Wang. University of Massachusetts Lowell Department of Computer Science. J. Wang (UMass Lowell) Linear Programming 1 / 47
Linear Programming Jie Wang University of Massachusetts Lowell Department of Computer Science J. Wang (UMass Lowell) Linear Programming 1 / 47 Linear function: f (x 1, x 2,..., x n ) = n a i x i, i=1 where
More informationLecture 5. Max-cut, Expansion and Grothendieck s Inequality
CS369H: Hierarchies of Integer Programming Relaxations Spring 2016-2017 Lecture 5. Max-cut, Expansion and Grothendieck s Inequality Professor Moses Charikar Scribes: Kiran Shiragur Overview Here we derive
More informationNCG Group New Results and Open Problems
NCG Group Ne Results and Open Problems Table of Contents NP-Completeness 1 NP-Completeness 2 3 4 2 / 19 NP-Completeness 3 / 19 (P)NSP OPT - Problem Definition An instance I of (P)NSP opt : I = (G, F ),
More informationNotes on Dantzig-Wolfe decomposition and column generation
Notes on Dantzig-Wolfe decomposition and column generation Mette Gamst November 11, 2010 1 Introduction This note introduces an exact solution method for mathematical programming problems. The method is
More informationThe degree sequence of Fibonacci and Lucas cubes
The degree sequence of Fibonacci and Lucas cubes Sandi Klavžar Faculty of Mathematics and Physics University of Ljubljana, Slovenia and Faculty of Natural Sciences and Mathematics University of Maribor,
More informationElements of Economic Analysis II Lecture VII: Equilibrium in a Competitive Market
Elements of Economic Analysis II Lecture VII: Equilibrium in a Competitive Market Kai Hao Yang 10/31/2017 1 Partial Equilibrium in a Competitive Market In the previous lecture, e derived the aggregate
More informationVapor Pressure Prediction for Stacked-Chip Packages in Reflow by Convection-Diffusion Model
Vapor Pressure Prediction for Stacked-Chip Packages in Reflo by Convection-Diffusion Model Jeremy Adams, Liangbiao Chen, and Xuejun Fan Lamar University, PO Box 10028, Beaumont, TX 77710, USA Tel: 409-880-7792;
More informationModeling the Effects of Greenbelts at the Urban-Rural Fringe
Modeling the Effects of Greenbelts at the Urban-Rural Fringe Daniel G. Bron, Scott E. Page, Rick Riolo, William Rand School of atural Resources and Environment, University of Michigan, Ann Arbor, MI 48109
More informationASYMPTOTIC PERFORMANCE OF MIMO WIRELESS CHANNELS WITH LIMITED FEEDBACK
ASYMPTTIC PERFRMANCE F MIM WIRELESS CHANNELS WITH LIMITED FEEDBACK Wiroonsak Santipach and Michael L. Honig Department of Electrical and Computer Engineering Northestern University 2145 Sheridan Road Evanston,
More informationFLOER HOMOLOGY AND SINGULAR KNOTS
FLOER HOMOLOGY AND SINGULAR KNOTS PETER OZSVÁTH, ANDRÁS STIPSICZ, AND ZOLTÁN SZABÓ arxiv:0705.2661v3 [math.gt] 6 May 2009 Abstract. In this paper e define and investigate variants of the link Floer homology
More information