CMSC 858T: Randomized Algorithms Spring 2003 Handout 8: The Local Lemma

Save this PDF as:

Size: px
Start display at page:

Download "CMSC 858T: Randomized Algorithms Spring 2003 Handout 8: The Local Lemma"

Transcription

1 CMSC 858T: Randomized Algorithms Spring 2003 Handout 8: The Local Lemma Please Note: The references at the end are given for extra reading if you are interested in exploring these ideas further. You are not required to read these references for the purposes of this course. 1 The Lovász Local Lemma A basic problem that arises often in the design and analysis of randomized algorithms is to get a good estimate (upper bound, lower bound, or both) of Pr( i [m] E i), for some given events E i. Equivalently, a good lower bound, upper bound or both, is required for Pr( i [m] E i). As we have seen, one approach would be to use the union bound ( counting sieve ), which is unfortunately quite weak in general. Another obvious approach, which works when the E i s are independent, is to use Pr( E i ) = Pr(E i ), i [m] the independence sieve. A common situation where we have to look for such bounds is when the E i s are bad events, all of which we wish to avoid simultaneously. The minimal requirement for this is that Pr( i [m] E i) > 0; however, even to prove this, the independence sieve will often not apply and the counting sieve could be quite weak. However, the independence sieve does suggest something: can we say something interesting if each E i is independent of most other E j? The powerful Lovász Local Lemma (LLL) due to Erdős and Lovász ([4]) is often very useful in such cases; see Alon & Spencer [2] for many such applications. The basic (symmetric) version of the LLL shows that all of a set of bad events E i can be avoided under some conditions: Lemma 1.1 ([4]) Let E 1, E 2,..., E m be any events with Pr(E i ) p i. If each E i is mutually independent of all but at most D 1 of the other events E j and if 4pD 1, then i [m] m Pr( E i ) (1 2p) m > 0. i=1 Remark. Note that if D = 0, then we can apply the independence sieve. Also, we have discussed the more general asymmetric version of the LLL in class; we have also seen how it leads to the slightly weaker requirement ep(d + 1) 1 instead of the 4pD 1 in Lemma The Mutual Independence Principle We present a general framework into which most applications of the LLL fall; in order to directly plug in the LLL in such situations, we present a simple and useful idea called the mutual independence principle. First convince yourself, using the proof of the LLL, that the following condition is sufficient for a set S i to be considered the dependent set of E i : i A i (S i {i}), Pr[E i E j ] = Pr[E i ]. (1) 1

2 (Note also from the proof of the LLL that instead of (1), the following weaker requirement is in fact sufficient for S i to be the dependent set of E i : i A i (S i {i}), Pr[E i E j ] Pr[E i ]. (2) The LLL with this weaker requirement is sometimes called the Lopsided Local Lemma, and has proved useful in some applications.) We study an abstract framework where we can rigorously prove that for each i, a certain set S i is indeed the dependent set of E i, in the sense of (1). Suppose we have some independent random variables X 1, X 2,..., X n, each taking values in some finite set. Suppose we have subsets B 1, B 2,..., B m of {1, 2,..., n} such that each E i is completely determined by the values of (X j : j B i ). Then, since the X i are all independent, it seems intuitively clear that the dependent set S i of E i, can be taken to be S i. = {j : j i, and Bj B i }. (3) This idea is called the mutual independence principle, and we now give a proof that S i can indeed be taken as the dependent set of E i. Consider any A i (S i {i}). We will prove the following equality: Pr[E i E j ] = Pr[E i ]. (4) We use a simple and often very useful conditioning method. Suppose we have events A and B such that Pr[B] > 0; we want to estimate Pr[A B]. (Since conditioning on B is not well-defined if Pr[B] = 0, we require here that Pr[B] > 0.) It is often fruitful in such cases to involve an auxiliary random variable T which takes values, say, in some finite set U. Call t U consistent with B iff Pr[(T = t) B] > 0; let U U be the set of all consistent elements of U. The following lemma is often very useful: Lemma 2.1 (i) Pr[A B] = Pr[A (B (T = t))] Pr[(T = t) B]. (ii) Pr[(T = t) B] = 1. To prove part (i) of the lemma, we apply Bayes theorem to both sides. Then, we need to show that Pr[AB] Pr[B] But this is easy to see, since = Pr[AB (T = t)] Pr[(T = t) B] Pr[B (T = t)] = Pr[AB (T = t)]. Pr[B] Pr[AB] = Pr[AB (T = t)] = Pr[AB (T = t)], t U since by definition of U, Pr[AB (T = t)] = 0 for all t U. This proves part (i); the proof of part (ii) also follows Bayes theorem, and just uses the fact that Pr[B] = Pr[B (T = t)] = Pr[B (T = t)]. t U 2

3 This completes our proof of the lemma. Going back to our problem, let Z i denote the tuple of all the random variables X j except for the random variables (X k : k B i ). [As an example, suppose n = 5 and B i = {2, 4}. Then, Z i could be the tuple (X 1, X 3, X 5 ).] Then, if B i has cardinality s, and if each random variable X j takes values in some set C, note that Z i takes on values in the set C n s, which is the Cartesian product of the set C with itself, taken n s times. Let V C n s be the set of all σ C n s such that Pr[(Z i = σ) E j ] > 0. Then, using Lemma 2.1(i), we get Pr[E i E j ] = (Pr[(Z i = σ) E j ] Pr[E i ((Z i = σ) E j )]). (5) σ V Now fix any σ V. The definition of Z i and of the sets B i shows that if we know that Z i = σ, then the truth value of E j is completely determined. (This is the primary reason for our definition of Z i.) More formally, Pr[( E j ) (Z i = σ)] {0, 1}. However, since σ V, we get that Pr[( E j ) (Z i = σ)] = 1; thus, the events ( E j ) (Z i = σ) and Z i = σ are logically identical. Plugging this into (5), we get Pr[E i E j ] = (Pr[(Z i = σ) E j ] Pr[E i (Z i = σ)]). (6) σ V Now, the definition of Z i and the sets S i, as well as the fact that the X j are independent, shows that Pr[E i (Z i = σ)] = Pr[E i ]. Second, Lemma 2.1(ii) shows that Pr[(Z i = σ) E j ] = 1. σ V Substituting these two ideas into (6) shows that the l.h.s. of (6) equals Pr[E i ]. 3 An Application to Packet Routing The LLL is a powerful tool. We now present a portion of a surprising result on routing due to Leighton, Maggs & Rao, which makes involved use of the LLL [5]. Suppose we have a routing problem on a network, where the paths also have been specified for each of the packets. Concretely, we are given an undirected graph G, a set of pairs of vertices (s i, t i ), and a path P i in G that connects s i with t i, for each i. Initially, we have one packet residing at each s i ; this packet has to be routed to t i using the path P i. We assume that a packet takes unit time to traverse each edge, and the main constraint as usual is that an edge can carry at most one packet per (synchronous) time step. Subject to these restrictions, we want to minimize the maximum time taken by any packet to reach its destination. We may further assume that the paths P i are all edge-simple, i.e., do not repeat any edge. Since we are also given the paths P i, the only question is the queuing discipline we need to provide at the nodes/links (what a node must do if several packets that are currently resident at it, want to traverse the same edge on their next hop). One motivation for assuming such a model (wherein the paths P i are prespecified) is that many routing strategies can be divided into two phases: (a) choosing an intermediate destination for each packet (e.g., the paradigm of choosing the intermediate destination randomly and 3

4 independently for each packet [8, 9]) and taking each packet on some canonical path to the intermediate destination, and (b) routing each packet on a canonical path from the intermediate destination to the final destination t i. Such a strategy can thus use two invocations of the above prespecified paths model. Let us study the objective function, i.e., the maximum time taken by any packet to reach its destination. Two relevant parameters are the congestion c, the maximum number of paths P i that use any given edge in G, and the dilation d, the length of a longest path among the P i. It is immediate that each of c and d is a lower bound on the objective function. In terms of upper bounds, the simple greedy algorithm that never lets an edge go idle if it can carry a packet at a given time step, terminates within cd steps; this is because any packet can be delayed by at most c 1 other packets at any edge in the network. Can we do better than cd? Recall our assumption that the paths P i are all edge-simple. Under this assumption, the work of [5] shows the amazing result that there exists a schedule of length O(c + d) with constant queue-sizes at each edge, independent of the topology of the network or of the paths, and of the total number of packets! The proof makes heavy use of the LLL, and we just show a portion of this beautiful result here. Henceforth, we assume without loss of generality that c = d, to simplify notational cluttering such as O(c + d). (However, we also use both c and d in places where such a distinction would make the discussion clear.) Imagine giving each packet a random initial delay, an integer chosen uniformly at random and independently from {1, 2,..., ac} for a suitable constant a > 1. We think of each packet waiting out its initial delay period, and then traversing its path P i without interruption to reach its delay. Of course this schedule is likely to be infeasible, since it may result in an edge having to carry more than one packet at a time step. Nevertheless, the LLL can be used to show that some such schedules exist with certain very useful properties, as we shall see now. The above (infeasible) schedule clearly has a length of at most ac + d. Let us partition this period into frames, contiguous time intervals starting at time 1, with each frame having a length (number of time steps) of ln c. Our basic idea is as follows. We shall prove, using the LLL, that every edge has a congestion of at most ln c in each such frame, with positive probability. Suppose indeed that this is true; fix such a choice for the initial delays. Then, we would have essentially broken up the problem into at most (ac + d)/ ln c subproblems, one corresponding to each frame, wherein the congestion and the dilation are at most ln c in each subproblem. Furthermore, we can solve each subproblem recursively and independently, and paste together the resulting schedules in an obvious way. Finally, the facts that: the congestion and dilation go from d to ln d, and a problem with constant congestion and dilation can be scheduled in constant time (e.g., by the above-seen greedy protocol), will guarantee a schedule of length (c + d) 2 O(log (c+d)) for us. We now use the LLL to prove that every edge has a congestion of at most ln c in each frame, with positive probability. For any given edge f, let E f denote the event that there is some frame in which it has a congestion of more than ln c. We want to show that Pr( f E f ) > 0. For any given edge f and any given frame F, let E (f, F ) denote the event that the congestion of f in F is more than ln c. It is easy to see that the expected congestion on any given edge at any given time instant, is at most c/ac = 1/a, in our randomized schedule. Thus, the expectation of the congestion C(f, F ) of f in F is at most (ln c)/a. Now, crucially, using our assumption that the paths P i are edge-simple, it can be deduced that C(f, F ) is a sum of 4

5 independent indicator random variables. Thus, by the Chernoff-Hoeffding bounds, we see that Pr(E (f, F )) F + ((ln c)/a, a 1). So, by the union bound, Pr(E f ) F Pr(E (f, F )) O(c + d) F + ((ln c)/a, a 1), i.e., a term that can be made the reciprocal of an arbitrarily large polynomial in c, by just choosing the constant a large enough. To apply the LLL, we also need to upper-bound the dependency among the E f, which is easy: E f depends only on those E g where the edges f and g have a common packet that traverses both of them. (More formally, we can apply the Mutual Independence Principle as follows. In the notation of that Principle, the underlying independent random variables X j are the random delays chosen by the different packets. Now, E f is completely determined by the random delays chosen by the packets that use edge f. Thus, by the Mutual Independence Principle, E f depends, in the sense of the LLL, only on those E g where the edges f and g have a common packet that traverses both of them.) By our definitions of c and d, we see that each E f depends on at most cd = c 2 other events E g ; combined with our above upper-bound on each Pr(E f ), the LLL completes the result for us (by choosing a to be a suitably large positive constant). Sophisticated use of similar ideas leads to the main result of [5] the existence of a schedule of length O(c + d) with constant-sized queues. An interesting point is that the LLL usually only guarantees an extremely small (though positive) probability for the event being shown to exist. In the notation of Lemma 1.1, p 1/m in many applications, and hence the probability upper bound of (1 2p) m is tiny, though positive. (For instance, in the applications of the LLL in the above routing result, p could be (c + d) Θ(1) while m could be Ω(N), where N is the total number of packets; note that c and d could be very small compared to N.) In fact, it can be proven in many applications of the LLL, that the actual probability of the desired structure occurring is very small. Thus, the LLL is often viewed as proving the existence of a needle in a haystack; this is in contrast to the much weaker union bound, which, when applicable, usually also gives a good probability of existence for the desired structure (thus leading to an efficient randomized or even deterministic algorithm to produce the structure). Breakthrough work of Beck [3] showed polynomial-time algorithms to produce several structures guaranteed to exist by the LLL; parallel algorithms to do this were then exhibited by Alon [1]. While these and other later results have been used to constructivize many known applications of the LLL, some applications still remain elusive (non-constructive). For the above specific problem of routing using prespecified paths, polynomial-time algorithms have been presented in [6]. However, routing problems often need to be solved in a distributed fashion where each packet knows the network as well as its source and destination, and where there is no centralized controller who can guide the routing; significant progress toward such a distributed algorithmic analog of the above result of [5], has been made in [7]. References [1] N. Alon. A parallel algorithmic version of the Local Lemma. Random Structures & Algorithms, 2: , [2] N. Alon and J. H. Spencer. The Probabilistic Method, Second Edition. Wiley Interscience Series, John Wiley & Sons, Inc., [3] J. Beck. An algorithmic approach to the Lovász Local Lemma. Random Structures & Algorithms, 2: ,

6 [4] P. Erdős and L. Lovász. Problems and results on 3-chromatic hypergraphs and some related questions. In Infinite and Finite Sets, A. Hajnal et. al., editors, Colloq. Math. Soc. J. Bolyai 11, North Holland, Amsterdam, pages , [5] F. T. Leighton, B. Maggs, and S. Rao. Packet routing and jobshop scheduling in O(congestion + dilation) steps. Combinatorica, 14: , [6] F. T. Leighton, B. Maggs, and A. Richa. Fast algorithms for finding O(congestion + dilation) packet routing schedules. Combinatorica, 19: , [7] R. Ostrovsky and Y. Rabani. Universal O(congestion + dilation + log 1+ɛ N) local control packet switching algorithms. In Proc. ACM Symposium on the Theory of Computing, pages , [8] L. G. Valiant. A scheme for fast parallel communication. SIAM Journal on Computing, 11: , [9] L. G. Valiant and G. J. Brebner. Universal schemes for parallel communication. In Proc. ACM Symposium on the Theory of Computing, pages ,

Lecture 22: November 10

CS271 Randomness & Computation Fall 2011 Lecture 22: November 10 Lecturer: Alistair Sinclair Based on scribe notes by Rafael Frongillo Disclaimer: These notes have not been subjected to the usual scrutiny

Packet Routing and Job-Shop Scheduling in O(Congestion + Dilation) Steps

Packet Routing and Job-Shop Scheduling in O(Congestion + Dilation) Steps F. T. Leighton 1 Bruce M. Maggs 2 Satish B. Rao 2 1 Mathematics Department and Laboratory for Computer Science Massachusetts Institute

Lecture 6: Approximation via LP Rounding

Lecture 6: Approximation via LP Rounding Let G = (V, E) be an (undirected) graph. A subset C V is called a vertex cover for G if for every edge (v i, v j ) E we have v i C or v j C (or both). In other

On an anti-ramsey type result

On an anti-ramsey type result Noga Alon, Hanno Lefmann and Vojtĕch Rödl Abstract We consider anti-ramsey type results. For a given coloring of the k-element subsets of an n-element set X, where two k-element

The Goldberg Rao Algorithm for the Maximum Flow Problem

The Goldberg Rao Algorithm for the Maximum Flow Problem COS 528 class notes October 18, 2006 Scribe: Dávid Papp Main idea: use of the blocking flow paradigm to achieve essentially O(min{m 2/3, n 1/2 }

2.3 Scheduling jobs on identical parallel machines

2.3 Scheduling jobs on identical parallel machines There are jobs to be processed, and there are identical machines (running in parallel) to which each job may be assigned Each job = 1,,, must be processed

Best Monotone Degree Bounds for Various Graph Parameters

Best Monotone Degree Bounds for Various Graph Parameters D. Bauer Department of Mathematical Sciences Stevens Institute of Technology Hoboken, NJ 07030 S. L. Hakimi Department of Electrical and Computer

The degree, size and chromatic index of a uniform hypergraph

The degree, size and chromatic index of a uniform hypergraph Noga Alon Jeong Han Kim Abstract Let H be a k-uniform hypergraph in which no two edges share more than t common vertices, and let D denote the

High degree graphs contain large-star factors

High degree graphs contain large-star factors Dedicated to László Lovász, for his 60th birthday Noga Alon Nicholas Wormald Abstract We show that any finite simple graph with minimum degree d contains a

International Journal of Information Technology, Modeling and Computing (IJITMC) Vol.1, No.3,August 2013

FACTORING CRYPTOSYSTEM MODULI WHEN THE CO-FACTORS DIFFERENCE IS BOUNDED Omar Akchiche 1 and Omar Khadir 2 1,2 Laboratory of Mathematics, Cryptography and Mechanics, Fstm, University of Hassan II Mohammedia-Casablanca,

The positive minimum degree game on sparse graphs

The positive minimum degree game on sparse graphs József Balogh Department of Mathematical Sciences University of Illinois, USA jobal@math.uiuc.edu András Pluhár Department of Computer Science University

Fairness in Routing and Load Balancing

Fairness in Routing and Load Balancing Jon Kleinberg Yuval Rabani Éva Tardos Abstract We consider the issue of network routing subject to explicit fairness conditions. The optimization of fairness criteria

Data Management in Hierarchical Bus Networks

Data Management in Hierarchical Bus Networks F. Meyer auf der Heide Department of Mathematics and Computer Science and Heinz Nixdorf Institute, Paderborn University, Germany fmadh@upb.de H. Räcke Department

Approximation Algorithms Chapter Approximation Algorithms Q. Suppose I need to solve an NP-hard problem. What should I do? A. Theory says you're unlikely to find a poly-time algorithm. Must sacrifice one

Lecture 7: Approximation via Randomized Rounding

Lecture 7: Approximation via Randomized Rounding Often LPs return a fractional solution where the solution x, which is supposed to be in {0, } n, is in [0, ] n instead. There is a generic way of obtaining

Competitive Analysis of On line Randomized Call Control in Cellular Networks

Competitive Analysis of On line Randomized Call Control in Cellular Networks Ioannis Caragiannis Christos Kaklamanis Evi Papaioannou Abstract In this paper we address an important communication issue arising

Uniform Multicommodity Flow through the Complete Graph with Random Edge-capacities

Combinatorics, Probability and Computing (2005) 00, 000 000. c 2005 Cambridge University Press DOI: 10.1017/S0000000000000000 Printed in the United Kingdom Uniform Multicommodity Flow through the Complete

Approximation Algorithms

Approximation Algorithms or: How I Learned to Stop Worrying and Deal with NP-Completeness Ong Jit Sheng, Jonathan (A0073924B) March, 2012 Overview Key Results (I) General techniques: Greedy algorithms

! Solve problem to optimality. ! Solve problem in poly-time. ! Solve arbitrary instances of the problem. !-approximation algorithm.

Approximation Algorithms Chapter Approximation Algorithms Q Suppose I need to solve an NP-hard problem What should I do? A Theory says you're unlikely to find a poly-time algorithm Must sacrifice one of

! Solve problem to optimality. ! Solve problem in poly-time. ! Solve arbitrary instances of the problem. #-approximation algorithm.

Approximation Algorithms 11 Approximation Algorithms Q Suppose I need to solve an NP-hard problem What should I do? A Theory says you're unlikely to find a poly-time algorithm Must sacrifice one of three

On the Union of Arithmetic Progressions

On the Union of Arithmetic Progressions Shoni Gilboa Rom Pinchasi August, 04 Abstract We show that for any integer n and real ɛ > 0, the union of n arithmetic progressions with pairwise distinct differences,

On the k-path cover problem for cacti

On the k-path cover problem for cacti Zemin Jin and Xueliang Li Center for Combinatorics and LPMC Nankai University Tianjin 300071, P.R. China zeminjin@eyou.com, x.li@eyou.com Abstract In this paper we

How Asymmetry Helps oad Balancing Berthold Vöcking nternational Computer Science nstitute Berkeley, CA 947041198 voecking@icsiberkeleyedu Abstract This paper deals with balls and bins processes related

Private Approximation of Clustering and Vertex Cover

Private Approximation of Clustering and Vertex Cover Amos Beimel, Renen Hallak, and Kobbi Nissim Department of Computer Science, Ben-Gurion University of the Negev Abstract. Private approximation of search

EE384Y Project Final Report Load Balancing and Switch Scheduling Xiangheng Liu Department of Electrical Engineering Stanford University, Stanford CA 94305 Email: liuxh@systems.stanford.edu Abstract Load

Scheduling Real-time Tasks: Algorithms and Complexity

Scheduling Real-time Tasks: Algorithms and Complexity Sanjoy Baruah The University of North Carolina at Chapel Hill Email: baruah@cs.unc.edu Joël Goossens Université Libre de Bruxelles Email: joel.goossens@ulb.ac.be

2.1 Complexity Classes

15-859(M): Randomized Algorithms Lecturer: Shuchi Chawla Topic: Complexity classes, Identity checking Date: September 15, 2004 Scribe: Andrew Gilpin 2.1 Complexity Classes In this lecture we will look

A Sublinear Bipartiteness Tester for Bounded Degree Graphs

A Sublinear Bipartiteness Tester for Bounded Degree Graphs Oded Goldreich Dana Ron February 5, 1998 Abstract We present a sublinear-time algorithm for testing whether a bounded degree graph is bipartite

Introduction to Relations

CHAPTER 7 Introduction to Relations 1. Relations and Their Properties 1.1. Definition of a Relation. Definition: A binary relation from a set A to a set B is a subset R A B. If (a, b) R we say a is related

Two General Methods to Reduce Delay and Change of Enumeration Algorithms

ISSN 1346-5597 NII Technical Report Two General Methods to Reduce Delay and Change of Enumeration Algorithms Takeaki Uno NII-2003-004E Apr.2003 Two General Methods to Reduce Delay and Change of Enumeration

Lecture 1: Course overview, circuits, and formulas

Lecture 1: Course overview, circuits, and formulas Topics in Complexity Theory and Pseudorandomness (Spring 2013) Rutgers University Swastik Kopparty Scribes: John Kim, Ben Lund 1 Course Information Swastik

8.1 Min Degree Spanning Tree

CS880: Approximations Algorithms Scribe: Siddharth Barman Lecturer: Shuchi Chawla Topic: Min Degree Spanning Tree Date: 02/15/07 In this lecture we give a local search based algorithm for the Min Degree

1 Approximating Set Cover

CS 05: Algorithms (Grad) Feb 2-24, 2005 Approximating Set Cover. Definition An Instance (X, F ) of the set-covering problem consists of a finite set X and a family F of subset of X, such that every elemennt

Algorithm Design and Analysis

Algorithm Design and Analysis LECTURE 27 Approximation Algorithms Load Balancing Weighted Vertex Cover Reminder: Fill out SRTEs online Don t forget to click submit Sofya Raskhodnikova 12/6/2011 S. Raskhodnikova;

Partitioning edge-coloured complete graphs into monochromatic cycles and paths

arxiv:1205.5492v1 [math.co] 24 May 2012 Partitioning edge-coloured complete graphs into monochromatic cycles and paths Alexey Pokrovskiy Departement of Mathematics, London School of Economics and Political

Notes from Week 1: Algorithms for sequential prediction

CS 683 Learning, Games, and Electronic Markets Spring 2007 Notes from Week 1: Algorithms for sequential prediction Instructor: Robert Kleinberg 22-26 Jan 2007 1 Introduction In this course we will be looking

GESJ: Computer Science and Telecommunications 21 No.3(26) BRAESS-LIKE PARADOXES FOR NON-COOPERATIVE DYNAMIC LOAD BALANCING IN DISTRIBUTED COMPUTER SYSTEMS Said Fathy El-Zoghdy Department of Computer Science,

Stationary random graphs on Z with prescribed iid degrees and finite mean connections

Stationary random graphs on Z with prescribed iid degrees and finite mean connections Maria Deijfen Johan Jonasson February 2006 Abstract Let F be a probability distribution with support on the non-negative

A Turán Type Problem Concerning the Powers of the Degrees of a Graph

A Turán Type Problem Concerning the Powers of the Degrees of a Graph Yair Caro and Raphael Yuster Department of Mathematics University of Haifa-ORANIM, Tivon 36006, Israel. AMS Subject Classification:

Offline sorting buffers on Line

Offline sorting buffers on Line Rohit Khandekar 1 and Vinayaka Pandit 2 1 University of Waterloo, ON, Canada. email: rkhandekar@gmail.com 2 IBM India Research Lab, New Delhi. email: pvinayak@in.ibm.com

Approximated Distributed Minimum Vertex Cover Algorithms for Bounded Degree Graphs

Approximated Distributed Minimum Vertex Cover Algorithms for Bounded Degree Graphs Yong Zhang 1.2, Francis Y.L. Chin 2, and Hing-Fung Ting 2 1 College of Mathematics and Computer Science, Hebei University,

Mean Ramsey-Turán numbers

Mean Ramsey-Turán numbers Raphael Yuster Department of Mathematics University of Haifa at Oranim Tivon 36006, Israel Abstract A ρ-mean coloring of a graph is a coloring of the edges such that the average

Randomized algorithms

Randomized algorithms March 10, 2005 1 What are randomized algorithms? Algorithms which use random numbers to make decisions during the executions of the algorithm. Why would we want to do this?? Deterministic

U.C. Berkeley CS276: Cryptography Handout 0.1 Luca Trevisan January, 2009. Notes on Algebra

U.C. Berkeley CS276: Cryptography Handout 0.1 Luca Trevisan January, 2009 Notes on Algebra These notes contain as little theory as possible, and most results are stated without proof. Any introductory

arxiv:1203.1525v1 [math.co] 7 Mar 2012

Constructing subset partition graphs with strong adjacency and end-point count properties Nicolai Hähnle haehnle@math.tu-berlin.de arxiv:1203.1525v1 [math.co] 7 Mar 2012 March 8, 2012 Abstract Kim defined

Online Bipartite Perfect Matching With Augmentations

Online Bipartite Perfect Matching With Augmentations Kamalika Chaudhuri, Constantinos Daskalakis, Robert D. Kleinberg, and Henry Lin Information Theory and Applications Center, U.C. San Diego Email: kamalika@soe.ucsd.edu

JUST-IN-TIME SCHEDULING WITH PERIODIC TIME SLOTS. Received December May 12, 2003; revised February 5, 2004

Scientiae Mathematicae Japonicae Online, Vol. 10, (2004), 431 437 431 JUST-IN-TIME SCHEDULING WITH PERIODIC TIME SLOTS Ondřej Čepeka and Shao Chin Sung b Received December May 12, 2003; revised February

A Practical Scheme for Wireless Network Operation

A Practical Scheme for Wireless Network Operation Radhika Gowaikar, Amir F. Dana, Babak Hassibi, Michelle Effros June 21, 2004 Abstract In many problems in wireline networks, it is known that achieving

Applied Algorithm Design Lecture 5

Applied Algorithm Design Lecture 5 Pietro Michiardi Eurecom Pietro Michiardi (Eurecom) Applied Algorithm Design Lecture 5 1 / 86 Approximation Algorithms Pietro Michiardi (Eurecom) Applied Algorithm Design

The Classes P and NP

The Classes P and NP We now shift gears slightly and restrict our attention to the examination of two families of problems which are very important to computer scientists. These families constitute the

Every tree contains a large induced subgraph with all degrees odd

Every tree contains a large induced subgraph with all degrees odd A.J. Radcliffe Carnegie Mellon University, Pittsburgh, PA A.D. Scott Department of Pure Mathematics and Mathematical Statistics University

Cost Model: Work, Span and Parallelism. 1 The RAM model for sequential computation:

CSE341T 08/31/2015 Lecture 3 Cost Model: Work, Span and Parallelism In this lecture, we will look at how one analyze a parallel program written using Cilk Plus. When we analyze the cost of an algorithm

Lecture 4: AC 0 lower bounds and pseudorandomness

Lecture 4: AC 0 lower bounds and pseudorandomness Topics in Complexity Theory and Pseudorandomness (Spring 2013) Rutgers University Swastik Kopparty Scribes: Jason Perry and Brian Garnett In this lecture,

Gambling Systems and Multiplication-Invariant Measures

Gambling Systems and Multiplication-Invariant Measures by Jeffrey S. Rosenthal* and Peter O. Schwartz** (May 28, 997.. Introduction. This short paper describes a surprising connection between two previously

Distributed Computing over Communication Networks: Maximal Independent Set

Distributed Computing over Communication Networks: Maximal Independent Set What is a MIS? MIS An independent set (IS) of an undirected graph is a subset U of nodes such that no two nodes in U are adjacent.

Lecture 15 An Arithmetic Circuit Lowerbound and Flows in Graphs

CSE599s: Extremal Combinatorics November 21, 2011 Lecture 15 An Arithmetic Circuit Lowerbound and Flows in Graphs Lecturer: Anup Rao 1 An Arithmetic Circuit Lower Bound An arithmetic circuit is just like

Multi-layer Structure of Data Center Based on Steiner Triple System

Journal of Computational Information Systems 9: 11 (2013) 4371 4378 Available at http://www.jofcis.com Multi-layer Structure of Data Center Based on Steiner Triple System Jianfei ZHANG 1, Zhiyi FANG 1,

CS268: Geometric Algorithms Handout #5 Design and Analysis Original Handout #15 Stanford University Tuesday, 25 February 1992

CS268: Geometric Algorithms Handout #5 Design and Analysis Original Handout #15 Stanford University Tuesday, 25 February 1992 Original Lecture #6: 28 January 1991 Topics: Triangulating Simple Polygons

Connected Identifying Codes for Sensor Network Monitoring

Connected Identifying Codes for Sensor Network Monitoring Niloofar Fazlollahi, David Starobinski and Ari Trachtenberg Dept. of Electrical and Computer Engineering Boston University, Boston, MA 02215 Email:

A REMARK ON ALMOST MOORE DIGRAPHS OF DEGREE THREE. 1. Introduction and Preliminaries

Acta Math. Univ. Comenianae Vol. LXVI, 2(1997), pp. 285 291 285 A REMARK ON ALMOST MOORE DIGRAPHS OF DEGREE THREE E. T. BASKORO, M. MILLER and J. ŠIRÁŇ Abstract. It is well known that Moore digraphs do

Introduction to Series and Sequences Math 121 Calculus II D Joyce, Spring 2013

Introduction to Series and Sequences Math Calculus II D Joyce, Spring 03 The goal. The main purpose of our study of series and sequences is to understand power series. A power series is like a polynomial

An example of a computable

An example of a computable absolutely normal number Verónica Becher Santiago Figueira Abstract The first example of an absolutely normal number was given by Sierpinski in 96, twenty years before the concept

princeton univ. F 13 cos 521: Advanced Algorithm Design Lecture 6: Provable Approximation via Linear Programming Lecturer: Sanjeev Arora

princeton univ. F 13 cos 521: Advanced Algorithm Design Lecture 6: Provable Approximation via Linear Programming Lecturer: Sanjeev Arora Scribe: One of the running themes in this course is the notion of

On Integer Additive Set-Indexers of Graphs

On Integer Additive Set-Indexers of Graphs arxiv:1312.7672v4 [math.co] 2 Mar 2014 N K Sudev and K A Germina Abstract A set-indexer of a graph G is an injective set-valued function f : V (G) 2 X such that

A set is a Many that allows itself to be thought of as a One. (Georg Cantor)

Chapter 4 Set Theory A set is a Many that allows itself to be thought of as a One. (Georg Cantor) In the previous chapters, we have often encountered sets, for example, prime numbers form a set, domains

This article has been accepted for inclusion in a future issue of this journal. Content is final as presented, with the exception of pagination.

IEEE/ACM TRANSACTIONS ON NETWORKING 1 A Greedy Link Scheduler for Wireless Networks With Gaussian Multiple-Access and Broadcast Channels Arun Sridharan, Student Member, IEEE, C Emre Koksal, Member, IEEE,

GROUPS SUBGROUPS. Definition 1: An operation on a set G is a function : G G G.

Definition 1: GROUPS An operation on a set G is a function : G G G. Definition 2: A group is a set G which is equipped with an operation and a special element e G, called the identity, such that (i) the

1 The Line vs Point Test

6.875 PCP and Hardness of Approximation MIT, Fall 2010 Lecture 5: Low Degree Testing Lecturer: Dana Moshkovitz Scribe: Gregory Minton and Dana Moshkovitz Having seen a probabilistic verifier for linearity

Cycles in a Graph Whose Lengths Differ by One or Two

Cycles in a Graph Whose Lengths Differ by One or Two J. A. Bondy 1 and A. Vince 2 1 LABORATOIRE DE MATHÉMATIQUES DISCRÉTES UNIVERSITÉ CLAUDE-BERNARD LYON 1 69622 VILLEURBANNE, FRANCE 2 DEPARTMENT OF MATHEMATICS

Rational exponents in extremal graph theory

Rational exponents in extremal graph theory Boris Bukh David Conlon Abstract Given a family of graphs H, the extremal number ex(n, H) is the largest m for which there exists a graph with n vertices and

ON INDUCED SUBGRAPHS WITH ALL DEGREES ODD. 1. Introduction

ON INDUCED SUBGRAPHS WITH ALL DEGREES ODD A.D. SCOTT Abstract. Gallai proved that the vertex set of any graph can be partitioned into two sets, each inducing a subgraph with all degrees even. We prove

Matching Nuts and Bolts Faster? Max-Planck-Institut fur Informatik, Im Stadtwald, Saarbrucken, Germany.

Matching Nuts and Bolts Faster? Phillip G. Bradford Rudolf Fleischer Max-Planck-Institut fur Informatik, Im Stadtwald, 6613 Saarbrucken, Germany. E-mail: fbradford,rudolfg@mpi-sb.mpg.de. Abstract. The

Factoring & Primality

Factoring & Primality Lecturer: Dimitris Papadopoulos In this lecture we will discuss the problem of integer factorization and primality testing, two problems that have been the focus of a great amount

Topology-based network security

Topology-based network security Tiit Pikma Supervised by Vitaly Skachek Research Seminar in Cryptography University of Tartu, Spring 2013 1 Introduction In both wired and wireless networks, there is the

Applications of Methods of Proof

CHAPTER 4 Applications of Methods of Proof 1. Set Operations 1.1. Set Operations. The set-theoretic operations, intersection, union, and complementation, defined in Chapter 1.1 Introduction to Sets are

Lecture 13 - Basic Number Theory.

Lecture 13 - Basic Number Theory. Boaz Barak March 22, 2010 Divisibility and primes Unless mentioned otherwise throughout this lecture all numbers are non-negative integers. We say that A divides B, denoted

IN THIS PAPER, we study the delay and capacity trade-offs

IEEE/ACM TRANSACTIONS ON NETWORKING, VOL. 15, NO. 5, OCTOBER 2007 981 Delay and Capacity Trade-Offs in Mobile Ad Hoc Networks: A Global Perspective Gaurav Sharma, Ravi Mazumdar, Fellow, IEEE, and Ness

S = {1, 2,..., n}. P (1, 1) P (1, 2)... P (1, n) P (2, 1) P (2, 2)... P (2, n) P = . P (n, 1) P (n, 2)... P (n, n)

last revised: 26 January 2009 1 Markov Chains A Markov chain process is a simple type of stochastic process with many social science applications. We ll start with an abstract description before moving

GENERATING LOW-DEGREE 2-SPANNERS

SIAM J. COMPUT. c 1998 Society for Industrial and Applied Mathematics Vol. 27, No. 5, pp. 1438 1456, October 1998 013 GENERATING LOW-DEGREE 2-SPANNERS GUY KORTSARZ AND DAVID PELEG Abstract. A k-spanner

CSE 20: Discrete Mathematics for Computer Science. Prof. Miles Jones. Today s Topics: Graphs. The Internet graph

Today s Topics: CSE 0: Discrete Mathematics for Computer Science Prof. Miles Jones. Graphs. Some theorems on graphs. Eulerian graphs Graphs! Model relations between pairs of objects The Internet graph!

Victor Shoup Avi Rubin. fshoup,rubing@bellcore.com. Abstract

Session Key Distribution Using Smart Cards Victor Shoup Avi Rubin Bellcore, 445 South St., Morristown, NJ 07960 fshoup,rubing@bellcore.com Abstract In this paper, we investigate a method by which smart

Ph.D. Thesis. Judit Nagy-György. Supervisor: Péter Hajnal Associate Professor

Online algorithms for combinatorial problems Ph.D. Thesis by Judit Nagy-György Supervisor: Péter Hajnal Associate Professor Doctoral School in Mathematics and Computer Science University of Szeged Bolyai

The minimum number of monochromatic 4-term progressions

The minimum number of monochromatic 4-term progressions Rutgers University May 28, 2009 Monochromatic 3-term progressions Monochromatic 4-term progressions 1 Introduction Monochromatic 3-term progressions

A Note on Maximum Independent Sets in Rectangle Intersection Graphs

A Note on Maximum Independent Sets in Rectangle Intersection Graphs Timothy M. Chan School of Computer Science University of Waterloo Waterloo, Ontario N2L 3G1, Canada tmchan@uwaterloo.ca September 12,

Lecture Steiner Tree Approximation- June 15

Approximation Algorithms Workshop June 13-17, 2011, Princeton Lecture Steiner Tree Approximation- June 15 Fabrizio Grandoni Scribe: Fabrizio Grandoni 1 Overview In this lecture we will summarize our recent

Logic & Discrete Math in Software Engineering (CAS 701) Dr. Borzoo Bonakdarpour

Logic & Discrete Math in Software Engineering (CAS 701) Background Dr. Borzoo Bonakdarpour Department of Computing and Software McMaster University Dr. Borzoo Bonakdarpour Logic & Discrete Math in SE (CAS

Bounded Cost Algorithms for Multivalued Consensus Using Binary Consensus Instances

Bounded Cost Algorithms for Multivalued Consensus Using Binary Consensus Instances Jialin Zhang Tsinghua University zhanggl02@mails.tsinghua.edu.cn Wei Chen Microsoft Research Asia weic@microsoft.com Abstract

(67902) Topics in Theory and Complexity Nov 2, 2006. Lecture 7

(67902) Topics in Theory and Complexity Nov 2, 2006 Lecturer: Irit Dinur Lecture 7 Scribe: Rani Lekach 1 Lecture overview This Lecture consists of two parts In the first part we will refresh the definition

Stochastic Inventory Control

Chapter 3 Stochastic Inventory Control 1 In this chapter, we consider in much greater details certain dynamic inventory control problems of the type already encountered in section 1.3. In addition to the

MapReduce and Distributed Data Analysis. Sergei Vassilvitskii Google Research

MapReduce and Distributed Data Analysis Google Research 1 Dealing With Massive Data 2 2 Dealing With Massive Data Polynomial Memory Sublinear RAM Sketches External Memory Property Testing 3 3 Dealing With

Reihe Informatik 11 / 1996 Constructing Optimal Bushy Processing Trees for Join Queries is NP-hard Wolfgang Scheufele Guido Moerkotte 1 Constructing Optimal Bushy Processing Trees for Join Queries is NP-hard

All trees contain a large induced subgraph having all degrees 1 (mod k)

All trees contain a large induced subgraph having all degrees 1 (mod k) David M. Berman, A.J. Radcliffe, A.D. Scott, Hong Wang, and Larry Wargo *Department of Mathematics University of New Orleans New

Chapter 7: Products and quotients

Chapter 7: Products and quotients Matthew Macauley Department of Mathematical Sciences Clemson University http://www.math.clemson.edu/~macaule/ Math 42, Spring 24 M. Macauley (Clemson) Chapter 7: Products

Maximum Hitting Time for Random Walks on Graphs. Graham Brightwell, Cambridge University Peter Winkler*, Emory University

Maximum Hitting Time for Random Walks on Graphs Graham Brightwell, Cambridge University Peter Winkler*, Emory University Abstract. For x and y vertices of a connected graph G, let T G (x, y denote the

An Empirical Study of Two MIS Algorithms

An Empirical Study of Two MIS Algorithms Email: Tushar Bisht and Kishore Kothapalli International Institute of Information Technology, Hyderabad Hyderabad, Andhra Pradesh, India 32. tushar.bisht@research.iiit.ac.in,

Example Correctness Proofs

Example Correctness Proofs Kevin C. Zatloukal March 8, 2014 In these notes, we give three examples of proofs of correctness. These are intended to demonstrate the sort of proofs we would like to see in

Theorem 2. If x Q and y R \ Q, then. (a) x + y R \ Q, and. (b) xy Q.

Math 305 Fall 011 The Density of Q in R The following two theorems tell us what happens when we add and multiply by rational numbers. For the first one, we see that if we add or multiply two rational numbers

CARDINALITY, COUNTABLE AND UNCOUNTABLE SETS PART ONE

CARDINALITY, COUNTABLE AND UNCOUNTABLE SETS PART ONE With the notion of bijection at hand, it is easy to formalize the idea that two finite sets have the same number of elements: we just need to verify