1 Problem Statement. 2 Overview

Save this PDF as:

Size: px
Start display at page:

Transcription

1 Lecture Notes on an FPRAS for Network Unreliability. Eric Vigoda Georgia Institute of Technology Last updated for Randomized Algorithms, Spring 200. In this lecture, we will consider the problem of calculating the probability that a given network fails, and give a FPRAS (Fully Polynomial Randomized Approximation Scheme) for the same. The work on reliability is due to Karger [2], and the earlier work on #DNF is due to Karp and Luby [4], which was later improved by Karp, Luby and Madras [5]. Problem Statement Fix an undirected graph G and 0 p. Let H be a graph obtained by deleting edges of G, independently with probability p. Let F AIL G (p) denote the probability that the graph H obtained as above is disconnected. The network reliability problem is to calculate F AIL G (p) given inputs G and p. 2 Overview For an undirected graph H, let MINCUT(H) denote its min-cut. First observe that a graph H is disconnected iff MINCUT(H) = 0. If G is an undirected graph and H is obtained by deleting some edges of G, then H is disconnected iff the deleted edges contain some cut of G (not necessarily a min-cut). Hence, we have that where E(G) denotes the edge set of G. F AIL G (p) = Pr (E(G) \ E(H) contains a cut of G) () Since, calculating the exact value of F AIL G (p) is #P-complete, we will try to develop an FPRAS for the same, i.e. there is an algorithm A ɛ > 0, δ > 0 and all inputs (G, p), we have ( ɛ)f AIL G (p) A(G, p) ( + ɛ)f AIL G (p), with probability δ and the running time of A is polynomial in the input size, /ɛ and log(/δ). Here the input size is O( G + log(/p)). One simple way to solve this problem is to keep generating random H s, and observe how many of them turn out to be disconnected. For this to work, we need to generate at least /F AIL G (p) random H s, and then some if we want to keep the error down. Since F AIL G (p) can be exponentially small, this algorithm will not cut it. If F AIL G (p) is polynomially small, we do as suggested above. In the alternate case, we show that if in equation (), we keep only the terms corresponding to small cuts, then the right hand side, is a good enough approximation to F AIL G (p). In the rest of this lecture, we make the terms polynomially small and small cuts more precise and show that the algorithm does indeed work as advertised. For the rest of this lecture (G, p) denotes a fixed input Based on scribe notes first prepared by Murali Krishnan Ganapathy at the University of Chicago in the winter quarter,

2 to our algorithm. Similarly, we fix some ɛ > 0 and δ > 0. Let C := MINCUT(G). This is calculated by using Karger s algorithm discussed in the previous lecture. Finally put q := F AIL G (p) and observe that q = F AIL G (p) P r(e(g) \ E(H) contains a specific cut) p C. Now we consider two cases depending on whether p C is greater or smaller than n 4. This defines polynomially small. 3 p C n 4 In this case, we show that the Monte Carlo method discussed before actually works. Put l = 3n4 ɛ log(2/δ). 2 All in all, we do l trials, and in each trial we create a random H by tossing coins of bias p, once for each edge of G, and then check if the H generated is connected. Finally, we output the fraction of the H s which were connected. For i =,..., l, set X i equal to if the i th trial resulted in a disconnected graph and 0 otherwise, and put X = i X i. Since Pr(X i = ) = F AIL G (p) = q, E(X) = ql. Since the X i s are independent, by Chernoff s bound we have, Pr ( X E(X) ɛe(x)) 2 exp( ɛ 2 ql/3) 2 exp( ɛ 2 4 n4 n ɛ 2 log(2/δ)) = 2 exp( log(2/δ)) = δ. Each trial involves generating the random H, and testing it for connectedness. Checking connectedness takes time O( G ). Generating the random H requires time O( G log(/p)), assuming that we only have access to unbiased coins. So, total time is O(l G log(/p)), which is polynomial in the size of the input, /ɛ and log(/δ). 4 Enumerating small cuts In this section we consider the problem of enumerating the small cuts. This will be used as a subroutine to solve the main problem at hand. The algorithm is a variation of Karger s min-cut algorithm [] to find a cut of size αc, where α > is a parameter:. Pick a random edge and contract it (eliminating self loops and keeping multiple edges). 2. Repeat step, till there are k := 2α meta-vertices left. 3. Choose a random subset T of these k-vertices. 4. If the cut defined by T and its complement, has size αc, output it. 2

3 Fix a cut S of size αc. For the above algorithm to output S, it must not choose any edge in S during step, and in step 3, the random subset T should correspond to one side of the cut defined by S. Since every vertex (of every intermediate graph) has degree C (since C = MINCUT(G)), Pr(S survives till step 3) = n k t=0 ( n 2α k ( ) ) αc (n t)c/2 ( n k) (2) ( n k) (3) Hence, Pr(output = S) ( n k)2 k+ ( ) k k 2 2en n k assuming α > 2 = n 2α Since S was an arbitrary cut of size αc, we have that the number of cuts of size αc is n 2α. This bound can be easily improved to n 2α if we replace the right hand side of equation (2) with ( ) ( k 2α / n 2α), whose definition would involve Γ functions. In order to enumerate all small cuts with high probability, we repeat the above algorithm r := θ log(θ/δ) times, where θ = n 2α. For a specific cut S, Pr(S was not the result of the i th trial ) /θ. Hence the probability that S was not the result any of the r-trials is bounded above by ( /θ) r. This implies that the probability that some small cut did not appear in any of the r-trials, is bounded above by θ( θ ) θ log(θ/δ) δ. This gives us an algorithm which for any α >, δ > 0, enumerates all cuts of a graph of size αc with probability δ and running time O(rn 2 ). 5 A FPRAS for #DNF In this section, we consider the problem of estimating the number of satisfying assignments of a DNF formula, and its weighted version. Let Φ be a DNF formula with M clauses θ,..., θ M. Let r i be the number of literals appearing in θ i. Let N denote the total number of distinct variables in Φ. Without loss of generality assume Φ is satisfiable (checking this can be done in time O( r i ). Let 0 p, be given. Consider a random assignment with bias p. We wish to calculate the probability, f(φ), of the random assignment satisfying Φ. In case p = /2, it reduces to the problem of counting the number of satisfying assignments. The obvious trick of choosing a random assignment (with required bias) and checking if it satisfies Φ is out of question, since f(φ) can be exponentially small. Let w i denote the probability that a random assignment satisfies the i th clause. If p i and n i denote the number of positive and negative literals appearing in θ i, then w i = p pi ( p) ni. Finally, put = i w i. Consider the following algorithm: 3

4 . Choose a random clause θ i, with probability of selecting θ i equal to w i /. 2. Choose a random assignment σ satisfying θ i. 3. Calculate S = /N(σ), where N(σ) is the number of clauses satisfied by σ. 4. Repeat steps -3 t := (4M/ɛ 2 ) times, and output the observed mean. First we show that E(S) = f(φ). For any assignment σ, let w(σ) denote the probability that a random assignment equals σ, i.e. w(σ) = p a ( p) b, where a is the # of variables set to and b = N a is the # of variables set to 0. P r(choosing σ in step 2 θ i in step ) = w(σ)/w i = E(S θ i in step ) = σ: N(σ) w(σ) w i This gives E(S) = i = i w i w(σ) N(σ) w i w(σ)/n(σ) = w(σ)/n(σ) σ =Φ i: = w(σ)/n(σ) σ =Φ = σ =Φ w(σ) = f(φ) i: Similarly E(S 2 ) = i = i = σ =Φ w i 2 w(σ) N(σ) 2 w i N(σ) 2 w(σ) N(σ) w(σ) f(φ) the last inequality following from the fact that N(σ) if σ = Φ. Now V ar(s) = E(S 2 ) E(S) 2 (/f(φ) )f(φ) 2 (M )f(φ) 2. To see that Mf(Φ), define A i to be the event that a random σ satisfies θ i and note that = i w i = i Pr(A i) M Pr( i A i ) = Mf(Φ). 4

5 Now let S,..., S t denote the observed values during the run of the algorithm, and let Ŝ be the observed mean, i.e. Ŝ = ( i S i)/t. Clearly, E(Ŝ) = E(S) = f(φ) and V ar(ŝ) = V ar(s)/t (M )f(φ)2 /t. Now applying Chebychev s inequality, we have ) ( Pr ( Ŝ f(φ) ɛf(φ) Pr( Ŝ f(φ) ɛ ) t V ar(ŝ) M M ɛ 2 /4 t To reduce the error probability to less then δ, we repeat the above procedure log(/δ) times and output the median of all the observed means. 6 p C n 4 Now back to the original network reliability problem. In the case when q = F AIL G (p) is small, we use equation, and consider only the terms on the right hand side corresponding to small cuts. We now show that that one can choose α >, so that if we restrict ourselves to only those terms which correspond to cuts of size αc, then the error we introduce is small. Then we enumerate all small cuts and approximate the probability using the FPRAS for #DNF. Choose ζ 2 such that p C = n (2+ζ). Let H be a random graph obtained from G by removing some edges (in the prescribed manner). Then Pr(some cut of size αc fails in H) n 2β p βc dβ β α n ζβ dβ β α = O() n ζα Setting α = 2 ln(ɛ/o())/ζ ln n, we see that Pr(large cut failing in H) ɛn 2ζ ɛp C ɛq. Therefore, by ignoring all large cuts (i.e. those of size > αc), we calculate F AIL G (p) to within a multiplicative factor of ± ɛ. Now, we enumerate all the small cuts, using the algorithm from Section 4. Let C,..., C r be the small cuts. Define a DNF formula Φ over the variables {x e } e E(G) as follows. For each cut C i, define the clause θ i = e Ci x e. Set x e to true if the edge appears in H, and false otherwise. Then θ i evaluates to true exactly when the cut C i fails in H. Hence Φ evaluates to true iff some small cut fails in H. So, we are left with the problem of evaluating the probability that a random assignment of truth values to x e (true with prob p) satisfies Φ. This is solved using the FPRAS of section 5. 7 Putting it all together Combining all the previous discussion the final algorithm is:. C = MINCUT(G) 2. If p C > n 4 goto step 3, else goto step 4 5

6 3. (Monte Carlo) Using l := 3n4 ɛ log(2/δ) trials, estimate F AIL 2 G (p) to within ± ɛ with probability δ and end program. 4. Calculate α = 2 ln(ɛ/o())/ζ ln n, where ζ satisfies p C = n 2 ζ. 5. Using the extension of Karger s min-cut algorithm described in Section 4, enumerate all cuts of size αc, with probability δ. 6. Construct the DNF Φ as described in Section Using FPRAS of section 5 evaluate f(φ) to within a multiplicative error of + ɛ with probability δ. 8. Output f(φ) This algorithm calculates F AIL G (p) to within a multiplicative error of ( ± ɛ) with probability ( δ) 2. Each step takes polynomial time with respect to its input,/ɛ and log(/δ). Composing all this we get an algorithm whose running time is polynomial in G, log p, /ɛ and log δ, and the cumulative multiplicative error is bounded by ( ± ɛ) with error probability bounded by ( δ) 2. 8 Open problems An interesting open problem is to devise a deterministic approximation algorithm for F AIL G (p). Karger [3] showed that his approach can be efficiently derandomized when F AIL G (p) /n 4. However it is open how to derandomize the case F AIL G (p) > /n 4, which was the somewhat trivial case for the randomized algorithm. The high-level idea for the deterministic algorithm for small failure probabilities is the following. There is an efficient deterministic algorithm to list all small cuts via max-flow computations. Then F AIL G (p) can be estimated via inclusion-exclusion where only the first few terms are needed for a sufficient estimate. References [] D. R. Karger. Global min-cuts in RNC, and other ramifications of a simple min-cut algorithm. In Proceedings of the Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (Austin, TX, 993), pages 2 30, New York, 993. ACM. [2] D. R. Karger. A randomized fully polynomial time approximation scheme for the all-terminal network reliability problem. SIAM J. Comput., 29(2):492 54, 999. [3] D. R. Karger. A randomized fully polynomial time approximation scheme for the all-terminal network reliability problem. SIAM Rev., 43(3): , 200. Reprint of SIAM J. Comput. 29 (999), no. 2, [4] R. M. Karp and M. Luby. Monte Carlo algorithms for the planar multiterminal network reliability problem. J. Complexity, ():45 64, 985. [5] R. M. Karp, M. Luby, and N. Madras. Monte Carlo approximation algorithms for enumeration problems. J. Algorithms, 0(3): ,

Approximation Algorithms: LP Relaxation, Rounding, and Randomized Rounding Techniques. My T. Thai

Approximation Algorithms: LP Relaxation, Rounding, and Randomized Rounding Techniques My T. Thai 1 Overview An overview of LP relaxation and rounding method is as follows: 1. Formulate an optimization

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

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

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

Exponential time algorithms for graph coloring

Exponential time algorithms for graph coloring Uriel Feige Lecture notes, March 14, 2011 1 Introduction Let [n] denote the set {1,..., k}. A k-labeling of vertices of a graph G(V, E) is a function V [k].

CS5314 Randomized Algorithms. Lecture 16: Balls, Bins, Random Graphs (Random Graphs, Hamiltonian Cycles)

CS5314 Randomized Algorithms Lecture 16: Balls, Bins, Random Graphs (Random Graphs, Hamiltonian Cycles) 1 Objectives Introduce Random Graph Model used to define a probability space for all graphs with

Errata and updates for ASM Exam C/Exam 4 Manual (Sixteenth Edition) sorted by page

Errata for ASM Exam C/4 Study Manual (Sixteenth Edition) Sorted by Page 1 Errata and updates for ASM Exam C/Exam 4 Manual (Sixteenth Edition) sorted by page Practice exam 1:9, 1:22, 1:29, 9:5, and 10:8

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

8.1 Makespan Scheduling

600.469 / 600.669 Approximation Algorithms Lecturer: Michael Dinitz Topic: Dynamic Programing: Min-Makespan and Bin Packing Date: 2/19/15 Scribe: Gabriel Kaptchuk 8.1 Makespan Scheduling Consider an instance

Generating Random Numbers Variance Reduction Quasi-Monte Carlo. Simulation Methods. Leonid Kogan. MIT, Sloan. 15.450, Fall 2010

Simulation Methods Leonid Kogan MIT, Sloan 15.450, Fall 2010 c Leonid Kogan ( MIT, Sloan ) Simulation Methods 15.450, Fall 2010 1 / 35 Outline 1 Generating Random Numbers 2 Variance Reduction 3 Quasi-Monte

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

CS 598CSC: Combinatorial Optimization Lecture date: 2/4/2010

CS 598CSC: Combinatorial Optimization Lecture date: /4/010 Instructor: Chandra Chekuri Scribe: David Morrison Gomory-Hu Trees (The work in this section closely follows [3]) Let G = (V, E) be an undirected

Discrete Mathematics and Probability Theory Fall 2009 Satish Rao,David Tse Note 11

CS 70 Discrete Mathematics and Probability Theory Fall 2009 Satish Rao,David Tse Note Conditional Probability A pharmaceutical company is marketing a new test for a certain medical condition. According

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

THE NUMBER OF GRAPHS AND A RANDOM GRAPH WITH A GIVEN DEGREE SEQUENCE. Alexander Barvinok

THE NUMBER OF GRAPHS AND A RANDOM GRAPH WITH A GIVEN DEGREE SEQUENCE Alexer Barvinok Papers are available at http://www.math.lsa.umich.edu/ barvinok/papers.html This is a joint work with J.A. Hartigan

MATH4427 Notebook 2 Spring 2016. 2 MATH4427 Notebook 2 3. 2.1 Definitions and Examples... 3. 2.2 Performance Measures for Estimators...

MATH4427 Notebook 2 Spring 2016 prepared by Professor Jenny Baglivo c Copyright 2009-2016 by Jenny A. Baglivo. All Rights Reserved. Contents 2 MATH4427 Notebook 2 3 2.1 Definitions and Examples...................................

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

Proximal mapping via network optimization

L. Vandenberghe EE236C (Spring 23-4) Proximal mapping via network optimization minimum cut and maximum flow problems parametric minimum cut problem application to proximal mapping Introduction this lecture:

IEOR 6711: Stochastic Models I Fall 2012, Professor Whitt, Tuesday, September 11 Normal Approximations and the Central Limit Theorem

IEOR 6711: Stochastic Models I Fall 2012, Professor Whitt, Tuesday, September 11 Normal Approximations and the Central Limit Theorem Time on my hands: Coin tosses. Problem Formulation: Suppose that I have

Lecture 11: The Goldreich-Levin Theorem

COM S 687 Introduction to Cryptography September 28, 2006 Lecture 11: The Goldreich-Levin Theorem Instructor: Rafael Pass Scribe: Krishnaprasad Vikram Hard-Core Bits Definition: A predicate b : {0, 1}

(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

1 Formulating The Low Degree Testing Problem

6.895 PCP and Hardness of Approximation MIT, Fall 2010 Lecture 5: Linearity Testing Lecturer: Dana Moshkovitz Scribe: Gregory Minton and Dana Moshkovitz In the last lecture, we proved a weak PCP Theorem,

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

α α λ α = = λ λ α ψ = = α α α λ λ ψ α = + β = > θ θ β > β β θ θ θ β θ β γ θ β = γ θ > β > γ θ β γ = θ β = θ β = θ β = β θ = β β θ = = = β β θ = + α α α α α = = λ λ λ λ λ λ λ = λ λ α α α α λ ψ + α =

Guessing Game: NP-Complete?

Guessing Game: NP-Complete? 1. LONGEST-PATH: Given a graph G = (V, E), does there exists a simple path of length at least k edges? YES 2. SHORTEST-PATH: Given a graph G = (V, E), does there exists a simple

The sum of d small-bias generators fools polynomials of degree d

The sum of d small-bias generators fools polynomials of degree d Emanuele Viola April 15, 2009 Abstract We prove that the sum of d small-bias generators L : F s F n fools degree-d polynomials in n variables

Lecture 8. Confidence intervals and the central limit theorem

Lecture 8. Confidence intervals and the central limit theorem Mathematical Statistics and Discrete Mathematics November 25th, 2015 1 / 15 Central limit theorem Let X 1, X 2,... X n be a random sample of

Discrete Mathematics and Probability Theory Fall 2009 Satish Rao, David Tse Note 18. A Brief Introduction to Continuous Probability

CS 7 Discrete Mathematics and Probability Theory Fall 29 Satish Rao, David Tse Note 8 A Brief Introduction to Continuous Probability Up to now we have focused exclusively on discrete probability spaces

Calculating Interval Forecasts

Calculating Chapter 7 (Chatfield) Monika Turyna & Thomas Hrdina Department of Economics, University of Vienna Summer Term 2009 Terminology An interval forecast consists of an upper and a lower limit between

Introduction to Algorithms Review information for Prelim 1 CS 4820, Spring 2010 Distributed Wednesday, February 24

Introduction to Algorithms Review information for Prelim 1 CS 4820, Spring 2010 Distributed Wednesday, February 24 The final exam will cover seven topics. 1. greedy algorithms 2. divide-and-conquer algorithms

Estimating survival functions has interested statisticians for numerous years.

ZHAO, GUOLIN, M.A. Nonparametric and Parametric Survival Analysis of Censored Data with Possible Violation of Method Assumptions. (2008) Directed by Dr. Kirsten Doehler. 55pp. Estimating survival functions

Lecture 2: Universality

CS 710: Complexity Theory 1/21/2010 Lecture 2: Universality Instructor: Dieter van Melkebeek Scribe: Tyson Williams In this lecture, we introduce the notion of a universal machine, develop efficient universal

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

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

Welcome to... Problem Analysis and Complexity Theory 716.054, 3 VU

Welcome to... Problem Analysis and Complexity Theory 716.054, 3 VU Birgit Vogtenhuber Institute for Software Technology email: bvogt@ist.tugraz.at office hour: Tuesday 10:30 11:30 slides: http://www.ist.tugraz.at/pact.html

SYSM 6304: Risk and Decision Analysis Lecture 3 Monte Carlo Simulation

SYSM 6304: Risk and Decision Analysis Lecture 3 Monte Carlo Simulation M. Vidyasagar Cecil & Ida Green Chair The University of Texas at Dallas Email: M.Vidyasagar@utdallas.edu September 19, 2015 Outline

Counting Falsifying Assignments of a 2-CF via Recurrence Equations

Counting Falsifying Assignments of a 2-CF via Recurrence Equations Guillermo De Ita Luna, J. Raymundo Marcial Romero, Fernando Zacarias Flores, Meliza Contreras González and Pedro Bello López Abstract

The University of Kansas

Fall 2011 Scholarship Report All Greek Summary Rank Chapter Name Chapter GPA 1 Beta Theta Pi 3.57 2 Chi Omega 3.42 3 Kappa Alpha Theta 3.36 *4 Gamma Phi Beta 3.28 4 Kappa Kappa Gamma 3.28 6 Pi Beta Phi

5.1 Bipartite Matching

CS787: Advanced Algorithms Lecture 5: Applications of Network Flow In the last lecture, we looked at the problem of finding the maximum flow in a graph, and how it can be efficiently solved using the Ford-Fulkerson

Lecture 14: Fourier Transform

Machine Learning: Foundations Fall Semester, 2010/2011 Lecture 14: Fourier Transform Lecturer: Yishay Mansour Scribes: Avi Goren & Oron Navon 1 14.1 Introduction In this lecture, we examine the Fourier

Triangle deletion. Ernie Croot. February 3, 2010

Triangle deletion Ernie Croot February 3, 2010 1 Introduction The purpose of this note is to give an intuitive outline of the triangle deletion theorem of Ruzsa and Szemerédi, which says that if G = (V,

Contents. 3 Survival Distributions: Force of Mortality 37 Exercises Solutions... 51

Contents 1 Probability Review 1 1.1 Functions and moments...................................... 1 1.2 Probability distributions...................................... 2 1.2.1 Bernoulli distribution...................................

An Introduction to Basic Statistics and Probability

An Introduction to Basic Statistics and Probability Shenek Heyward NCSU An Introduction to Basic Statistics and Probability p. 1/4 Outline Basic probability concepts Conditional probability Discrete Random

Finding and counting given length cycles

Finding and counting given length cycles Noga Alon Raphael Yuster Uri Zwick Abstract We present an assortment of methods for finding and counting simple cycles of a given length in directed and undirected

Supplement to Call Centers with Delay Information: Models and Insights

Supplement to Call Centers with Delay Information: Models and Insights Oualid Jouini 1 Zeynep Akşin 2 Yves Dallery 1 1 Laboratoire Genie Industriel, Ecole Centrale Paris, Grande Voie des Vignes, 92290

Polarization codes and the rate of polarization

Polarization codes and the rate of polarization Erdal Arıkan, Emre Telatar Bilkent U., EPFL Sept 10, 2008 Channel Polarization Given a binary input DMC W, i.i.d. uniformly distributed inputs (X 1,...,

Page 1. CSCE 310J Data Structures & Algorithms. CSCE 310J Data Structures & Algorithms. P, NP, and NP-Complete. Polynomial-Time Algorithms

CSCE 310J Data Structures & Algorithms P, NP, and NP-Complete Dr. Steve Goddard goddard@cse.unl.edu CSCE 310J Data Structures & Algorithms Giving credit where credit is due:» Most of the lecture notes

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

OHJ-2306 Introduction to Theoretical Computer Science, Fall 2012 8.11.2012

276 The P vs. NP problem is a major unsolved problem in computer science It is one of the seven Millennium Prize Problems selected by the Clay Mathematics Institute to carry a \$ 1,000,000 prize for the

NPTEL STRUCTURAL RELIABILITY

NPTEL Course On STRUCTURAL RELIABILITY Module # 02 Lecture 6 Course Format: Web Instructor: Dr. Arunasis Chakraborty Department of Civil Engineering Indian Institute of Technology Guwahati 6. Lecture 06:

Lecture 3: Linear Programming Relaxations and Rounding

Lecture 3: Linear Programming Relaxations and Rounding 1 Approximation Algorithms and Linear Relaxations For the time being, suppose we have a minimization problem. Many times, the problem at hand can

CMPSCI611: Approximating MAX-CUT Lecture 20

CMPSCI611: Approximating MAX-CUT Lecture 20 For the next two lectures we ll be seeing examples of approximation algorithms for interesting NP-hard problems. Today we consider MAX-CUT, which we proved to

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

1. Nondeterministically guess a solution (called a certificate) 2. Check whether the solution solves the problem (called verification)

Some N P problems Computer scientists have studied many N P problems, that is, problems that can be solved nondeterministically in polynomial time. Traditionally complexity question are studied as languages:

General Sampling Methods

General Sampling Methods Reference: Glasserman, 2.2 and 2.3 Claudio Pacati academic year 2016 17 1 Inverse Transform Method Assume U U(0, 1) and let F be the cumulative distribution function of a distribution

Definition 11.1. Given a graph G on n vertices, we define the following quantities:

Lecture 11 The Lovász ϑ Function 11.1 Perfect graphs We begin with some background on perfect graphs. graphs. First, we define some quantities on Definition 11.1. Given a graph G on n vertices, we define

1 Solving LPs: The Simplex Algorithm of George Dantzig

Solving LPs: The Simplex Algorithm of George Dantzig. Simplex Pivoting: Dictionary Format We illustrate a general solution procedure, called the simplex algorithm, by implementing it on a very simple example.

COLORED GRAPHS AND THEIR PROPERTIES

COLORED GRAPHS AND THEIR PROPERTIES BEN STEVENS 1. Introduction This paper is concerned with the upper bound on the chromatic number for graphs of maximum vertex degree under three different sets of coloring

Lecture 4: BK inequality 27th August and 6th September, 2007

CSL866: Percolation and Random Graphs IIT Delhi Amitabha Bagchi Scribe: Arindam Pal Lecture 4: BK inequality 27th August and 6th September, 2007 4. Preliminaries The FKG inequality allows us to lower bound

CSC 373: Algorithm Design and Analysis Lecture 16

CSC 373: Algorithm Design and Analysis Lecture 16 Allan Borodin February 25, 2013 Some materials are from Stephen Cook s IIT talk and Keven Wayne s slides. 1 / 17 Announcements and Outline Announcements

Homework # 3 Solutions

Homework # 3 Solutions February, 200 Solution (2.3.5). Noting that and ( + 3 x) x 8 = + 3 x) by Equation (2.3.) x 8 x 8 = + 3 8 by Equations (2.3.7) and (2.3.0) =3 x 8 6x2 + x 3 ) = 2 + 6x 2 + x 3 x 8

13. Randomized Algorithms Contention Resolution. Randomization. Contention Resolution in a Distributed System. Algorithmic design patterns.

Randomization 13 Randomized Algorithms Algorithmic design patterns! Greed! Divide-and-conquer! Dynamic programming! Network flow! Randomization in practice, access to a pseudo-random number generator Randomization

Approximating Concept Stability

Approximating Concept Stability Mikhail A. Babin and Sergei O. Kuznetsov National Research University Higher School of Economics, Pokrovskii bd. 11, 109028 Moscow, Russia mikleb@yandex.ru, skuznetsov@hse.ru

Maximum Likelihood Estimation

Math 541: Statistical Theory II Lecturer: Songfeng Zheng Maximum Likelihood Estimation 1 Maximum Likelihood Estimation Maximum likelihood is a relatively simple method of constructing an estimator for

Aggregate Loss Models

Aggregate Loss Models Chapter 9 Stat 477 - Loss Models Chapter 9 (Stat 477) Aggregate Loss Models Brian Hartman - BYU 1 / 22 Objectives Objectives Individual risk model Collective risk model Computing

CHAPTER 2 Estimating Probabilities

CHAPTER 2 Estimating Probabilities Machine Learning Copyright c 2016. Tom M. Mitchell. All rights reserved. *DRAFT OF January 24, 2016* *PLEASE DO NOT DISTRIBUTE WITHOUT AUTHOR S PERMISSION* This is a

Polytope Examples (PolyComp Fukuda) Matching Polytope 1

Polytope Examples (PolyComp Fukuda) Matching Polytope 1 Matching Polytope Let G = (V,E) be a graph. A matching in G is a subset of edges M E such that every vertex meets at most one member of M. A matching

arxiv:1112.0829v1 [math.pr] 5 Dec 2011

How Not to Win a Million Dollars: A Counterexample to a Conjecture of L. Breiman Thomas P. Hayes arxiv:1112.0829v1 [math.pr] 5 Dec 2011 Abstract Consider a gambling game in which we are allowed to repeatedly

The University of Kansas

All Greek Summary Rank Chapter Name Total Membership Chapter GPA 1 Beta Theta Pi 3.57 2 Chi Omega 3.42 3 Kappa Alpha Theta 3.36 4 Kappa Kappa Gamma 3.28 *5 Pi Beta Phi 3.27 *5 Gamma Phi Beta 3.27 *7 Alpha

P versus NP, and More

1 P versus NP, and More Great Ideas in Theoretical Computer Science Saarland University, Summer 2014 If you have tried to solve a crossword puzzle, you know that it is much harder to solve it than to verify

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

CHAPTER 5 Round-off errors

CHAPTER 5 Round-off errors In the two previous chapters we have seen how numbers can be represented in the binary numeral system and how this is the basis for representing numbers in computers. Since any

Discrete Mathematics and Probability Theory Fall 2009 Satish Rao, David Tse Note 10

CS 70 Discrete Mathematics and Probability Theory Fall 2009 Satish Rao, David Tse Note 10 Introduction to Discrete Probability Probability theory has its origins in gambling analyzing card games, dice,

Lecture Notes on Spanning Trees

Lecture Notes on Spanning Trees 15-122: Principles of Imperative Computation Frank Pfenning Lecture 26 April 26, 2011 1 Introduction In this lecture we introduce graphs. Graphs provide a uniform model

Product irregularity strength of certain graphs

Also available at http://amc.imfm.si ISSN 1855-3966 (printed edn.), ISSN 1855-3974 (electronic edn.) ARS MATHEMATICA CONTEMPORANEA 7 (014) 3 9 Product irregularity strength of certain graphs Marcin Anholcer

P (x) 0. Discrete random variables Expected value. The expected value, mean or average of a random variable x is: xp (x) = v i P (v i )

Discrete random variables Probability mass function Given a discrete random variable X taking values in X = {v 1,..., v m }, its probability mass function P : X [0, 1] is defined as: P (v i ) = Pr[X =

Test of Hypotheses. Since the Neyman-Pearson approach involves two statistical hypotheses, one has to decide which one

Test of Hypotheses Hypothesis, Test Statistic, and Rejection Region Imagine that you play a repeated Bernoulli game: you win \$1 if head and lose \$1 if tail. After 10 plays, you lost \$2 in net (4 heads

You flip a fair coin four times, what is the probability that you obtain three heads.

Handout 4: Binomial Distribution Reading Assignment: Chapter 5 In the previous handout, we looked at continuous random variables and calculating probabilities and percentiles for those type of variables.

0.1 Phase Estimation Technique

Phase Estimation In this lecture we will describe Kitaev s phase estimation algorithm, and use it to obtain an alternate derivation of a quantum factoring algorithm We will also use this technique to design

Fifth Problem Assignment

EECS 40 PROBLEM (24 points) Discrete random variable X is described by the PMF { K x p X (x) = 2, if x = 0,, 2 0, for all other values of x Due on Feb 9, 2007 Let D, D 2,..., D N represent N successive

1 The Consistency Model

COS 511: Foundations of Machine Learning Rob Schapire Lecture #2 Scribe: Tamara Broderick February 9, 2006 1 The Consistency Model c : X {0,1} is a concept. C is a concept class. C is learnable (in the

Efficiency and the Cramér-Rao Inequality

Chapter Efficiency and the Cramér-Rao Inequality Clearly we would like an unbiased estimator ˆφ (X of φ (θ to produce, in the long run, estimates which are fairly concentrated i.e. have high precision.

Lecture 19: Introduction to NP-Completeness Steven Skiena. Department of Computer Science State University of New York Stony Brook, NY 11794 4400

Lecture 19: Introduction to NP-Completeness Steven Skiena Department of Computer Science State University of New York Stony Brook, NY 11794 4400 http://www.cs.sunysb.edu/ skiena Reporting to the Boss Suppose

COMS4236: Introduction to Computational Complexity. Summer 2014

COMS4236: Introduction to Computational Complexity Summer 2014 Mihalis Yannakakis Lecture 17 Outline conp NP conp Factoring Total NP Search Problems Class conp Definition of NP is nonsymmetric with respect

4. Continuous Random Variables, the Pareto and Normal Distributions

4. Continuous Random Variables, the Pareto and Normal Distributions A continuous random variable X can take any value in a given range (e.g. height, weight, age). The distribution of a continuous random

1 Basic Definitions and Concepts in Graph Theory

CME 305: Discrete Mathematics and Algorithms 1 Basic Definitions and Concepts in Graph Theory A graph G(V, E) is a set V of vertices and a set E of edges. In an undirected graph, an edge is an unordered

Fraternity & Sorority Academic Report Spring 2016

Fraternity & Sorority Academic Report Organization Overall GPA Triangle 17-17 1 Delta Chi 88 12 100 2 Alpha Epsilon Pi 77 3 80 3 Alpha Delta Chi 28 4 32 4 Alpha Delta Pi 190-190 4 Phi Gamma Delta 85 3

5. Continuous Random Variables

5. Continuous Random Variables Continuous random variables can take any value in an interval. They are used to model physical characteristics such as time, length, position, etc. Examples (i) Let X be

Practice problems for Homework 11 - Point Estimation

Practice problems for Homework 11 - Point Estimation 1. (10 marks) Suppose we want to select a random sample of size 5 from the current CS 3341 students. Which of the following strategies is the best:

Universal Hash Proofs and a Paradigm for Adaptive Chosen Ciphertext Secure Public-Key Encryption

Universal Hash Proofs and a Paradigm for Adaptive Chosen Ciphertext Secure Public-Key Encryption Ronald Cramer Victor Shoup December 12, 2001 Abstract We present several new and fairly practical public-key

CS 3719 (Theory of Computation and Algorithms) Lecture 4

CS 3719 (Theory of Computation and Algorithms) Lecture 4 Antonina Kolokolova January 18, 2012 1 Undecidable languages 1.1 Church-Turing thesis Let s recap how it all started. In 1990, Hilbert stated a

Institut für Informatik Lehrstuhl Theoretische Informatik I / Komplexitätstheorie. An Iterative Compression Algorithm for Vertex Cover

Friedrich-Schiller-Universität Jena Institut für Informatik Lehrstuhl Theoretische Informatik I / Komplexitätstheorie Studienarbeit An Iterative Compression Algorithm for Vertex Cover von Thomas Peiselt

Why? A central concept in Computer Science. Algorithms are ubiquitous.

Analysis of Algorithms: A Brief Introduction Why? A central concept in Computer Science. Algorithms are ubiquitous. Using the Internet (sending email, transferring files, use of search engines, online

ECON 459 Game Theory. Lecture Notes Auctions. Luca Anderlini Spring 2015

ECON 459 Game Theory Lecture Notes Auctions Luca Anderlini Spring 2015 These notes have been used before. If you can still spot any errors or have any suggestions for improvement, please let me know. 1

Chapter 4. Probability and Probability Distributions

Chapter 4. robability and robability Distributions Importance of Knowing robability To know whether a sample is not identical to the population from which it was selected, it is necessary to assess the

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

Hypothesis Testing: General Framework 1 1

Hypothesis Testing: General Framework Lecture 2 K. Zuev February 22, 26 In previous lectures we learned how to estimate parameters in parametric and nonparametric settings. Quite often, however, researchers

Fraternity & Sorority Academic Report Fall 2015

Fraternity & Sorority Academic Report Organization Lambda Upsilon Lambda 1-1 1 Delta Chi 77 19 96 2 Alpha Delta Chi 30 1 31 3 Alpha Delta Pi 134 62 196 4 Alpha Sigma Phi 37 13 50 5 Sigma Alpha Epsilon