Lecture 3. denote the orthogonal complement of S k. Then. 1 x S k. n. 2 x T Ax = ( ) λ x. with x = 1, we have. i = λ k x 2 = λ k.


 Charla Wilcox
 4 years ago
 Views:
Transcription
1 A Algorithmist s Toolkit September 17, 009 Lecture 3 Lecturer: Joatha Keler Scribe: Adre Wibisoo 1 Outlie Today s lecture covers three mai parts: CouratFischer formula ad Rayleigh quotiets The coectio of λ to graph cuttig Cheeger s Iequality CouratFischer ad Rayleigh Quotiets The CouratFischer theorem gives a variatioal formulatio of the eigevalues of a symmetric matrix, which ca be useful for obtaiig bouds o the eigevalues. Theorem 1 (CouratFischer Formula) Let A be a symmetric matrix with eigevalues λ 1 λ... λ ad correspodig eigevectors v 1,...,v. The λ 1 = mi = mi, x =1 x 0 x T x λ = mi = mi, x =1 x 0 x T x xv 1 xv 1 λ = λ max = max = max. x =1 x 0 x T x I geeral, for 1 k, let S k deote the spa of v 1,...,v k (with S 0 = {0}), ad let S k deote the orthogoal complemet of S k. The λ k = mi = mi. x =1 x 0 x T x x S k 1 x S k 1 Proof Let A = Q T ΛQ be the eigedecompositio of A. We observe that = x T Q T ΛQx = (Qx) T Λ(Qx), ad sice Q is orthogoal, Qx = x. Thus it suffices to cosider the case whe A = Λ is a diagoal matrix with the eigevalues λ 1,...,λ i the diagoal. The we ca write λ 1 x 1. = ( ) x 1 x... = λ i x i. λ x i=1 We ote that whe A is diagoal, the eigevectors of A are v k = e k, the stadard basis vector i R, i.e. (e k ) i =1 if i = k, ad (e k ) i = 0 otherwise. The the coditio x S k 1 implies x e i for i =1,...,k 1, so x i = x, e i = 0. Therefore, for x S k 1 with x = 1, we have = λ i x i = λ i x i λ k x i = λ k x = λ k. i=1 i=k i=k 31
2 O the other had, pluggig i x = e k S k 1 yields = (e k ) T Ae k = λ k. This shows that Similarly, for x = 1, λ k = mi. x =1 x S k 1 = λ i x i λ max x i = λ max x = λ max. i=1 i=1 O the other had, takig x = e yields = (e ) T Ae = λ max. Hece we coclude that λ max = max. x =1 The Rayleigh quotiet is the applicatio of the CouratFischer Formula to the Laplacia of a graph. Corollary (Rayleigh Quotiet) Let G = (V, E) be a graph ad L be the Laplacia of G. We already kow that the smallest eigevalue is λ 1 =0 with eigevector v 1 = 1. By the CouratFischer Formula, (i,j) E (x i x j ) λ = mi = mi, x =0 x T x x=0 xv 1 x1 i V x i (i,j) E (x i x j ) λ max = max = max. x =0 x T x x=0 i V x i We ca iterpret the formula for λ as puttig sprigs o each edge (with slightly weird boudary coditios correspodig to ormalizatio) ad miimizig the potetial eergy of the cofiguratio. Some big matrices are hard or aoyig to diagoalize, so i some cases, we may ot wat to calculate the exact value of λ. However, we ca still get a approximatio by just costructig a vector x that has a small Rayleigh quotiet. Similarly, we ca fid a lower boud o λ max by costructig a vector that has a large Rayleigh quotiet. We will look at two examples i which we boud λ..1 Example 1: The Path Graph Let P +1 be the path graph of +1 vertices. Label the vertices as 0, 1,..., from oe ed of the path to the other. Cosider the vector x R +1 give by x i =i for vertices i = 0, 1,...,. Note that i=0 x i =0, so x 1. Calculatig the Rayleigh quotiet for x gives us ( ) (i,j) E (x i x j ) = = = O. i V x i i=0(i ) Ω( 3 ) Thus we ca boud λ O(1/ ). We kew this was true from the explicit formula of λ i terms of sies ad cosies from Lecture, but this is much cleaer ad more geeral of a result.. Example : A Complete Biary Tree Let G be a complete biary tree o = h 1 odes. Defie the vector x R to have the value 0 o the root ode, 1 o all odes i the left subtree of the root, ad 1 o all odes i the right subtree of the root. 3
3 It is easy to see that i V x i = 0, sice there are equal umbers of odes o the left ad right subtrees of the root, so x 1. Calculatig the Rayleigh quotiet of x gives us ( ) (i,j) E (x i x j ) 1 = = O. x 1 i V i Thus we get λ O(1/), agai with little effort. It turs out i this case that our approximatio is correct withi a costat factor, ad we did ot eve eed to diagoalize a big matrix. 3 Graph Cuttig The basic problem of graph cuttig is to cut a give graph G ito two pieces such that both are pretty big. Graph cuttig has may applicatios i computer sciece ad computig, e.g. for parallel processig, divideadcoquer algorithms, or clusterig. I each applicatio, we wat to divide the problem ito smaller pieces so as to optimize some measure of efficiecy, depedig o the specific problems. 3.1 How Do We Cut Graphs? The first questio to ask about graph cuttig is what we wat to optimize whe we are cuttig a graph. Before attemptig to aswer this questio, we itroduce several otatios. Let G = (V, E) be a graph. Give a set S V of vertices of G, let S = V \ S be the complemet of S i V. Let S ad S deote the umber of vertices i S ad S, respectively. Fially, let e(s) deote the umber of edges betwee S ad S. Note that e(s) = e(s ). Now we cosider some possible aswers to our earlier questio. Attempt 1: Micut. Divide the vertex set V ito two parts S ad S to miimize e(s). This approach is motivated by the ituitio that to get a good cut, we do ot wat to break too may edges. However, this approach aloe is ot sufficiet, as Figure 1(a) demostrates. I this example, we ideally wat to cut the graph across the two edges i the middle, but the micut criterio would result i a cut across the oe edge o the right. Attempt : Approximate bisectio. Divide the vertex set V ito two parts S ad S, such that S ad S are approximately / (or at least /3). This criterio would take care of the problem metioed i Figure 1(a), but it is also ot free of problems, as Figure 1(b) shows. I this example, we ideally wat to cut the graph across the oe edge i the middle that separates the two clusters. However, the approximate bisectio criterio would force us to make a cut across the dese graph o the left. (a) Problem with micut (b) Problem with approximate bisectio Figure 1: Illustratio for problems with the proposed graph cuttig criteria. Now we propose a criterio for graph cuttig that balaces the two approaches above. Defiitio 3 (Cut Ratio) The cut ratio φ of a cut S S is give by e(s) φ(s) = mi( S, S ). 33
4 The cut of miimum ratio is the cut that miimizes φ(s). The isoperimetric umber of a graph G is the value of the miimum cut, φ(g) = mi φ(s). S V As we ca see from the defiitio above, the cut ratio is tryig to miimize the umber of edges across the cut, while pealizig cuts with small umber of vertices. This criterio turs out to be a good oe, ad is widely used for graph cuttig i practice. 3. A Iteger Program for the Cut Ratio Now that we have a good defiitio of graph cuttig, the questio is how to fid the optimal cut i a reasoable time. It turs out that we ca cast the problem of fidig cut of miimum ratio as a iteger program as follows. Associate every cut S S with a vector x { 1, 1}, where { 1, if i S, ad x i = 1, if i S. The it is easy to see that we ca write 1 e(s) = (x i x j ). 4 (i,j) E For a boolea statemet A, let [A] deote the characteristic fuctio o A, so[a] =1if A is true, ad [A] =0 if A is false. The we also have ( ) S S = [i S] [j S] = [i S, j S]= 1 1 [x i = x j ]= (x i x j ). 4 i V j V i,j V i,j V i<j Combiig the two computatios above, (i,j) E (x i x j ) e(s) mi = mi. x { 1,1} (x i x j ) S V S S Now ote that if V = S + S =, the Therefore, solvig the iteger program (i,j) E(x i x j ) mi x { 1,1} (x i x j ) i<j mi( S, S ) S S mi( S, S ), so we get 1 e(s) (i,j) E (x i x j ) e(s) φ(g) = mi mi mi = φ(g). S V mi( S, S ) x { 1,1} (x i x j ) S V mi( S, S ) i<j i<j allows us to approximate φ(g) withi a factor of. The bad ews is that it is NPhard to solve this program. However, if we remove the x { 1, 1} costrait, we ca actually solve the program. Note that removig the costrait x { 1, 1} is actually the same as sayig that x [ 1, 1], sice we ca scale x without chagig the value of the objective fuctio. 34
5 3.3 Iterlude o Relaxatios The idea to drop the costrait x { 1, 1} metioed i the previous sectio is actually a recurrig techique i algorithms, so it is worthwhile to give a more geeral explaatio of this relaxatio techique. A commo setup i approximatio algorithms is as follows: we wat to solve a NPhard questio which takes the form of miimizig f(x) subject to the costrait x C. Istead, we miimize f(x) subject to a weaker costrait x C C (see Figure for a illustratio). Let p ad q be the poits that miimize f i C ad C, respectively. Sice C C, we kow that f(q) f(p). smaller f(x) C C p q q Figure : Illustratio of the relaxatio techique for approximatio algorithms. For this relaxatio to be useful, we have to show how to roud q to a feasible poit q C, ad prove f(q ) γf(q) for some costat γ 1. This implies f(q ) γf(q) γf(p), so this process gives us a γapproximatio. 3.4 Solvig the Relaxed Program Goig back to our iteger program to fid the cut of miimum ratio, ow cosider the followig relaxed program, (i,j) E(x i x j ) mi. x R i<j (x i x j ) Sice the value of the objective fuctio oly depeds o the differeces x i x j, we ca traslate x R such that x 1, i.e. i=1 x i =0. The observe that (x i x j ) = x i, i<j i=1 which ca be obtaied either by expadig the summatio directly, or by otig that x is a eigevector of the Laplacia of the complete graph K with eigevalue (as we saw i Lecture ). Therefore, usig the Rayleigh quotiet, (i,j) E (x i x j ) (i,j) E (x i x j ) λ mi = mi =. x R i<j (x i x j ) x R i=1 x i x1 35
6 Puttig all the pieces together, we get 4 Cheeger s Iequality e(s) φ(g) = mi S V mi( S, S ) e(s) mi S V S S (i,j) E (x i x j ) = mi x { 1,1} i<j (x i x j ) (i,j) E (x i x j ) mi x R i<j (x i x j ) (i,j) E (x i x j ) = mi x R i=1 x i x1 λ =. I the previous sectio, we obtaied the boud φ(g) λ /, but what about the other directio? For that, we would eed a roudig method, which is a way of gettig a cut from λ ad v, ad a upper boud o how much ithe roudig icreases the cut ratio that we are tryig to miimize. I the ext sectio, we will see how to costruct a cut from λ ad v that gives us the followig boud, which is Cheeger s Iequality. Theorem 4 (Cheeger s Iequality) Give a graph G, where d max is the maximum degree i G. φ(g) λ φ(g), d max As a side ote, the d max disappears from the formula if we use the ormalized Laplacia i our calculatios, but the proof is messier ad is ot fudametally ay differet from the proof usig the regular Laplacia. The lower boud of φ(g) /d max i Cheeger s Iequality is the best we ca do to boud λ. The square factor φ(g) is ufortuate, but if it were withi a costat factor of φ(g), we would be able to fid a costat approximatio of a NPhard problem. Also, if we look at the examples of the path graph ad the complete biary tree, their isoperimetric umbers are the same sice we ca cut exactly oe edge i the middle of the graph ad divide the graphs ito two asymptotically equalsized pieces for a value of O(1/). However, the two graphs have differet upper bouds for λ, O(1/ ) ad O(1/) respectively, which demostrate that both the lower ad upper bouds of λ i Cheeger s iequality are tight (to a costat factor). 4.1 How to Get a Cut from v ad λ Let x R such that x 1. We will use x as a map from the vertices V to R. Cuttig R would thus give a partitio of V as follows: order the vertices such that x 1 x... x, ad the cut will be defied by the set S = {1,...,k} for some value of k. The value of k caot be kow a priori sice the best cut depeds o the graph. I practice, a algorithm would have to try all values of k to actually fid the optimal cut after embeddig the graph to the real lie. We will actually prove somethig slightly stroger tha Cheeger s Iequality: 36
7 Theorem 5 For ay x 1, x 1 x... x, there is some i for which x T Lx φ({1,...,i}). x T x d max This is great because it ot oly implies Cheeger s iequality by takig x = v, but it also gives a actual cut. It also works eve if we have ot calculated the exact values for λ ad v ; we just have to get a good approximatio of v ad we ca still get a cut. 4. Proof of Cheeger s Iequality 4..1 Step 1: Preprocessig First, we are goig to do some preprocessig. This step does ot reduce the geerality of the proof much, but it will make the actual proof cleaer. For simplicity, suppose is odd. Let m = ( +1)/. Defie the vector y by y i = x i x m. We ca observe that y m = 0, half of the vertices are to the left of y m, ad the other half are to the right of y m. Claim 6 Proof x T Lx y T Ly x T x y T y First, the umerators are equal by the operatio of the Laplacia, x T Lx = (x i x j ) ( = (yi + x m ) (y j + x m ) ) = (yi y j ) = y T Ly. (i,j) E (i,j) E (i,j) E Next, sice x 1, y T y = (x + x m 1) T (x + x m 1)= x T x +x m (x T 1)+ x m(1 T 1)= x T x + x m x T x. Puttig together the two computatios above yields the desired iequality. 4.. Step : A Little More Preprocessig We do ot wat edges crossig y m = 0 (because we will later cosider the positive ad egative vertices separately), so we replace ay edge (i, j) with two edges (i, m) ad (m, j). Call this ew edge set E. Claim 7 (i,j) E (y i y j ) (i,j) E (y i y j ). i V y i i V y i Proof The oly differece i the umerator comes from the edges (i, j) that we split ito (i, m) ad (m, j). I that case, it is easy to see that (also otig that y m =0) (y j y i ) (y j y m ) +(y m y i ). 37
8 4..3 Step 3: Breakig the Sum i Half We would like to break the summatios i half so that we do ot have to deal with separate cases with positive ad egative umbers. Let E be the edges (i, j) with i, j m, ad let E + be the edges (i, j) with i, j m. We the have (y i y j ) + (y i y j ) (i,j) E (y i y j ) (i,j) E (i,j) E+ = m. i y i i=1 y i + i=m yi Note that y m appears twice i the summatio o the deomiator, which is fie sice y m = 0. We also kow that for ay a, b, c, d > 0, ( ) a + b a b mi,, c + d c d so it is eough to boud (i,j) E (y i y j ) (y i y j ) (i,j) E+ m ad. i=1 y i i=m y i Sice the two values are essetially the same, we will focus oly o the first oe The Mai Lemma Let C i be the umber of edges crossig the poit x i, i.e. the umber of edges i the cut if we were to take S = {1,...,i}. Recall that e(s) φ = φ(g) = mi, S V mi( S, S ) so by takig S = {1,...,i}, weget C i φi for i / ad C i φ( i) for i /. The mai lemma we use to prove Cheeger s Iequality is as follows. Lemma 8 (Summatio by Parts) For ay z 1... z m =0, m z i z j φ z i. j 1 z i z j = z j z i =(z i+1 z i )+(z i+ z i+1 )+ +(z j z j 1 )= (z k+1 z k ). m 1 m 1 z i z j = C k (z k+1 z k ) φ k(z k+1 z k ). m 1 z i z j φ k(z k+1 z k ) ( ) = φ (z z 1 )+(z 3 z )+3(z 4 z 3 )+ +(m 1)(z m z m 1 ) m = φ z i. Proof For each (i, j) E with i <j, write Summig over (i, j) E, we observe that each term z k+1 z k appears exactly C k times. Therefore, i=1 (i,j) E k=1 k=1 Note that z i z m =0, so z i = z i for 1 i m. The we ca evaluate the last summatio above as (i,j) E k=1 = φ( z 1 z z m 1 +(m 1)z m ) i=1 k=i 38
9 4..5 Usig the Mai Lemma to Prove Cheeger s Iequality Now we ca fially prove Cheeger s iequality. Proof of Cheeger s Iequality: This proof has five mai steps. 1. First, we ormalize y such that m i=1 y i =1.. Next, this is perhaps a somewhat oituitive step, but we wat to get squares ito our expressio, so we apply the mai lemma (Lemma 8) to a ew vector z with z i = y i. We ow have m y i y j φ yi = φ. 3. Next, we wat somethig that looks like (y i y j ) istead of y i y j, so we are goig to use the CauchySchwarz iequality. 1/ 1/ y i y j = y i y j y i + y j (y i y j ) (y i + y j ). i=1 4. We wat to get rid of the (y i + y j ) part, so we boud it ad observe that the maximum umber of times ay y i ca show up i the summatio over the edges is the the maximum degree of ay vertex. m (y i + y j ) (y i + y j ) d max y i d max. 5. Puttig it all together, we get ( ) (y i y j ) (i,j) E yi y j φ m. (y i + y j ) d max (i,j) E Similarly, we ca also show that Therefore, i=1 y i (i,j) E (i,j) E + i=m y i d max { } T x Lx y T Ly (i,j) E (y i y j ) (y i y j ) φ (i,j) E mi m, +. x T x y T y y i=1 (y i y j ) φ. i=1 y i i=m i d max 4..6 So who is Cheeger ayway? Jeff Cheeger is a differetial geometer. His iequality makes a lot more sese i the cotiuous world, ad his motivatio was i differetial geometry. This was part of his PhD thesis, ad he was actually ivestigatig heat kerels o smooth maifolds. A heat kerel ca also be thought of as a poit of heat i space, ad the questio is the speed at which the heat spreads. It ca also be thought of as the mixig time of a radom walk, which will be discussed i future lectures. 39
10 MIT OpeCourseWare Topics i Theoretical Computer Sciece: A Algorithmist's Toolkit Fall 009 For iformatio about citig these materials or our Terms of Use, visit:
Lecture 4: Cheeger s Inequality
Spectral Graph Theory ad Applicatios WS 0/0 Lecture 4: Cheeger s Iequality Lecturer: Thomas Sauerwald & He Su Statemet of Cheeger s Iequality I this lecture we assume for simplicity that G is a dregular
More informationLecture 13. Lecturer: Jonathan Kelner Scribe: Jonathan Pines (2009)
18.409 A Algorithmist s Toolkit October 27, 2009 Lecture 13 Lecturer: Joatha Keler Scribe: Joatha Pies (2009) 1 Outlie Last time, we proved the BruMikowski iequality for boxes. Today we ll go over the
More informationProperties of MLE: consistency, asymptotic normality. Fisher information.
Lecture 3 Properties of MLE: cosistecy, asymptotic ormality. Fisher iformatio. I this sectio we will try to uderstad why MLEs are good. Let us recall two facts from probability that we be used ofte throughout
More informationI. Chisquared Distributions
1 M 358K Supplemet to Chapter 23: CHISQUARED DISTRIBUTIONS, TDISTRIBUTIONS, AND DEGREES OF FREEDOM To uderstad tdistributios, we first eed to look at aother family of distributios, the chisquared distributios.
More informationCME 302: NUMERICAL LINEAR ALGEBRA FALL 2005/06 LECTURE 8
CME 30: NUMERICAL LINEAR ALGEBRA FALL 005/06 LECTURE 8 GENE H GOLUB 1 Positive Defiite Matrices A matrix A is positive defiite if x Ax > 0 for all ozero x A positive defiite matrix has real ad positive
More informationIn nite Sequences. Dr. Philippe B. Laval Kennesaw State University. October 9, 2008
I ite Sequeces Dr. Philippe B. Laval Keesaw State Uiversity October 9, 2008 Abstract This had out is a itroductio to i ite sequeces. mai de itios ad presets some elemetary results. It gives the I ite Sequeces
More informationAsymptotic Growth of Functions
CMPS Itroductio to Aalysis of Algorithms Fall 3 Asymptotic Growth of Fuctios We itroduce several types of asymptotic otatio which are used to compare the performace ad efficiecy of algorithms As we ll
More informationApproximating Area under a curve with rectangles. To find the area under a curve we approximate the area using rectangles and then use limits to find
1.8 Approximatig Area uder a curve with rectagles 1.6 To fid the area uder a curve we approximate the area usig rectagles ad the use limits to fid 1.4 the area. Example 1 Suppose we wat to estimate 1.
More informationConvexity, Inequalities, and Norms
Covexity, Iequalities, ad Norms Covex Fuctios You are probably familiar with the otio of cocavity of fuctios. Give a twicedifferetiable fuctio ϕ: R R, We say that ϕ is covex (or cocave up) if ϕ (x) 0 for
More information5 Boolean Decision Trees (February 11)
5 Boolea Decisio Trees (February 11) 5.1 Graph Coectivity Suppose we are give a udirected graph G, represeted as a boolea adjacecy matrix = (a ij ), where a ij = 1 if ad oly if vertices i ad j are coected
More informationLecture 4: Cauchy sequences, BolzanoWeierstrass, and the Squeeze theorem
Lecture 4: Cauchy sequeces, BolzaoWeierstrass, ad the Squeeze theorem The purpose of this lecture is more modest tha the previous oes. It is to state certai coditios uder which we are guarateed that limits
More informationSAMPLE QUESTIONS FOR FINAL EXAM. (1) (2) (3) (4) Find the following using the definition of the Riemann integral: (2x + 1)dx
SAMPLE QUESTIONS FOR FINAL EXAM REAL ANALYSIS I FALL 006 3 4 Fid the followig usig the defiitio of the Riema itegral: a 0 x + dx 3 Cosider the partitio P x 0 3, x 3 +, x 3 +,......, x 3 3 + 3 of the iterval
More informationSECTION 1.5 : SUMMATION NOTATION + WORK WITH SEQUENCES
SECTION 1.5 : SUMMATION NOTATION + WORK WITH SEQUENCES Read Sectio 1.5 (pages 5 9) Overview I Sectio 1.5 we lear to work with summatio otatio ad formulas. We will also itroduce a brief overview of sequeces,
More informationSequences and Series
CHAPTER 9 Sequeces ad Series 9.. Covergece: Defiitio ad Examples Sequeces The purpose of this chapter is to itroduce a particular way of geeratig algorithms for fidig the values of fuctios defied by their
More informationInfinite Sequences and Series
CHAPTER 4 Ifiite Sequeces ad Series 4.1. Sequeces A sequece is a ifiite ordered list of umbers, for example the sequece of odd positive itegers: 1, 3, 5, 7, 9, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29...
More informationChapter 6: Variance, the law of large numbers and the MonteCarlo method
Chapter 6: Variace, the law of large umbers ad the MoteCarlo method Expected value, variace, ad Chebyshev iequality. If X is a radom variable recall that the expected value of X, E[X] is the average value
More informationChapter 7 Methods of Finding Estimators
Chapter 7 for BST 695: Special Topics i Statistical Theory. Kui Zhag, 011 Chapter 7 Methods of Fidig Estimators Sectio 7.1 Itroductio Defiitio 7.1.1 A poit estimator is ay fuctio W( X) W( X1, X,, X ) of
More informationRepeating Decimals are decimal numbers that have number(s) after the decimal point that repeat in a pattern.
5.5 Fractios ad Decimals Steps for Chagig a Fractio to a Decimal. Simplify the fractio, if possible. 2. Divide the umerator by the deomiator. d d Repeatig Decimals Repeatig Decimals are decimal umbers
More informationCS103X: Discrete Structures Homework 4 Solutions
CS103X: Discrete Structures Homewor 4 Solutios Due February 22, 2008 Exercise 1 10 poits. Silico Valley questios: a How may possible sixfigure salaries i whole dollar amouts are there that cotai at least
More informationDiscrete Mathematics and Probability Theory Spring 2014 Anant Sahai Note 13
EECS 70 Discrete Mathematics ad Probability Theory Sprig 2014 Aat Sahai Note 13 Itroductio At this poit, we have see eough examples that it is worth just takig stock of our model of probability ad may
More informationSection 11.3: The Integral Test
Sectio.3: The Itegral Test Most of the series we have looked at have either diverged or have coverged ad we have bee able to fid what they coverge to. I geeral however, the problem is much more difficult
More informationChapter 5: Inner Product Spaces
Chapter 5: Ier Product Spaces Chapter 5: Ier Product Spaces SECION A Itroductio to Ier Product Spaces By the ed of this sectio you will be able to uderstad what is meat by a ier product space give examples
More informationSoving Recurrence Relations
Sovig Recurrece Relatios Part 1. Homogeeous liear 2d degree relatios with costat coefficiets. Cosider the recurrece relatio ( ) T () + at ( 1) + bt ( 2) = 0 This is called a homogeeous liear 2d degree
More informationExample 2 Find the square root of 0. The only square root of 0 is 0 (since 0 is not positive or negative, so those choices don t exist here).
BEGINNING ALGEBRA Roots ad Radicals (revised summer, 00 Olso) Packet to Supplemet the Curret Textbook  Part Review of Square Roots & Irratioals (This portio ca be ay time before Part ad should mostly
More information0.7 0.6 0.2 0 0 96 96.5 97 97.5 98 98.5 99 99.5 100 100.5 96.5 97 97.5 98 98.5 99 99.5 100 100.5
Sectio 13 KolmogorovSmirov test. Suppose that we have a i.i.d. sample X 1,..., X with some ukow distributio P ad we would like to test the hypothesis that P is equal to a particular distributio P 0, i.e.
More informationFIBONACCI NUMBERS: AN APPLICATION OF LINEAR ALGEBRA. 1. Powers of a matrix
FIBONACCI NUMBERS: AN APPLICATION OF LINEAR ALGEBRA. Powers of a matrix We begi with a propositio which illustrates the usefuless of the diagoalizatio. Recall that a square matrix A is diogaalizable if
More informationHypothesis testing. Null and alternative hypotheses
Hypothesis testig Aother importat use of samplig distributios is to test hypotheses about populatio parameters, e.g. mea, proportio, regressio coefficiets, etc. For example, it is possible to stipulate
More informationIncremental calculation of weighted mean and variance
Icremetal calculatio of weighted mea ad variace Toy Fich faf@cam.ac.uk dot@dotat.at Uiversity of Cambridge Computig Service February 009 Abstract I these otes I eplai how to derive formulae for umerically
More information1 Computing the Standard Deviation of Sample Means
Computig the Stadard Deviatio of Sample Meas Quality cotrol charts are based o sample meas ot o idividual values withi a sample. A sample is a group of items, which are cosidered all together for our aalysis.
More informationProject Deliverables. CS 361, Lecture 28. Outline. Project Deliverables. Administrative. Project Comments
Project Deliverables CS 361, Lecture 28 Jared Saia Uiversity of New Mexico Each Group should tur i oe group project cosistig of: About 612 pages of text (ca be loger with appedix) 612 figures (please
More informationDepartment of Computer Science, University of Otago
Departmet of Computer Sciece, Uiversity of Otago Techical Report OUCS200609 Permutatios Cotaiig May Patters Authors: M.H. Albert Departmet of Computer Sciece, Uiversity of Otago Micah Colema, Rya Fly
More information5: Introduction to Estimation
5: Itroductio to Estimatio Cotets Acroyms ad symbols... 1 Statistical iferece... Estimatig µ with cofidece... 3 Samplig distributio of the mea... 3 Cofidece Iterval for μ whe σ is kow before had... 4 Sample
More informationMaximum Likelihood Estimators.
Lecture 2 Maximum Likelihood Estimators. Matlab example. As a motivatio, let us look at oe Matlab example. Let us geerate a radom sample of size 00 from beta distributio Beta(5, 2). We will lear the defiitio
More informationA probabilistic proof of a binomial identity
A probabilistic proof of a biomial idetity Joatho Peterso Abstract We give a elemetary probabilistic proof of a biomial idetity. The proof is obtaied by computig the probability of a certai evet i two
More informationU.C. Berkeley CS270: Algorithms Lecture 9 Professor Vazirani and Professor Rao Last revised. Lecture 9
U.C. Berkeley CS270: Algorithms Lecture 9 Professor Vazirai a Professor Rao Scribe: Aupam Last revise Lecture 9 1 Sparse cuts a Cheeger s iequality Cosier the problem of partitioig a give graph G(V, E
More informationLesson 15 ANOVA (analysis of variance)
Outlie Variability betwee group variability withi group variability total variability Fratio Computatio sums of squares (betwee/withi/total degrees of freedom (betwee/withi/total mea square (betwee/withi
More informationHere are a couple of warnings to my students who may be here to get a copy of what happened on a day that you missed.
This documet was writte ad copyrighted by Paul Dawkis. Use of this documet ad its olie versio is govered by the Terms ad Coditios of Use located at http://tutorial.math.lamar.edu/terms.asp. The olie versio
More informationLecture 5: Span, linear independence, bases, and dimension
Lecture 5: Spa, liear idepedece, bases, ad dimesio Travis Schedler Thurs, Sep 23, 2010 (versio: 9/21 9:55 PM) 1 Motivatio Motivatio To uderstad what it meas that R has dimesio oe, R 2 dimesio 2, etc.;
More information1 Correlation and Regression Analysis
1 Correlatio ad Regressio Aalysis I this sectio we will be ivestigatig the relatioship betwee two cotiuous variable, such as height ad weight, the cocetratio of a ijected drug ad heart rate, or the cosumptio
More informationFactoring x n 1: cyclotomic and Aurifeuillian polynomials Paul Garrett <garrett@math.umn.edu>
(March 16, 004) Factorig x 1: cyclotomic ad Aurifeuillia polyomials Paul Garrett Polyomials of the form x 1, x 3 1, x 4 1 have at least oe systematic factorizatio x 1 = (x 1)(x 1
More information1. C. The formula for the confidence interval for a population mean is: x t, which was
s 1. C. The formula for the cofidece iterval for a populatio mea is: x t, which was based o the sample Mea. So, x is guarateed to be i the iterval you form.. D. Use the rule : pvalue
More informationTrigonometric Form of a Complex Number. The Complex Plane. axis. ( 2, 1) or 2 i FIGURE 6.44. The absolute value of the complex number z a bi is
0_0605.qxd /5/05 0:45 AM Page 470 470 Chapter 6 Additioal Topics i Trigoometry 6.5 Trigoometric Form of a Complex Number What you should lear Plot complex umbers i the complex plae ad fid absolute values
More informationUniversity of California, Los Angeles Department of Statistics. Distributions related to the normal distribution
Uiversity of Califoria, Los Ageles Departmet of Statistics Statistics 100B Istructor: Nicolas Christou Three importat distributios: Distributios related to the ormal distributio Chisquare (χ ) distributio.
More informationOur aim is to show that under reasonable assumptions a given 2πperiodic function f can be represented as convergent series
8 Fourier Series Our aim is to show that uder reasoable assumptios a give periodic fuctio f ca be represeted as coverget series f(x) = a + (a cos x + b si x). (8.) By defiitio, the covergece of the series
More informationThe following example will help us understand The Sampling Distribution of the Mean. C1 C2 C3 C4 C5 50 miles 84 miles 38 miles 120 miles 48 miles
The followig eample will help us uderstad The Samplig Distributio of the Mea Review: The populatio is the etire collectio of all idividuals or objects of iterest The sample is the portio of the populatio
More informationCS103A Handout 23 Winter 2002 February 22, 2002 Solving Recurrence Relations
CS3A Hadout 3 Witer 00 February, 00 Solvig Recurrece Relatios Itroductio A wide variety of recurrece problems occur i models. Some of these recurrece relatios ca be solved usig iteratio or some other ad
More informationThe Stable Marriage Problem
The Stable Marriage Problem William Hut Lae Departmet of Computer Sciece ad Electrical Egieerig, West Virgiia Uiversity, Morgatow, WV William.Hut@mail.wvu.edu 1 Itroductio Imagie you are a matchmaker,
More informationLECTURE 13: Crossvalidation
LECTURE 3: Crossvalidatio Resampli methods Cross Validatio Bootstrap Bias ad variace estimatio with the Bootstrap Threeway data partitioi Itroductio to Patter Aalysis Ricardo GutierrezOsua Texas A&M
More information1. MATHEMATICAL INDUCTION
1. MATHEMATICAL INDUCTION EXAMPLE 1: Prove that for ay iteger 1. Proof: 1 + 2 + 3 +... + ( + 1 2 (1.1 STEP 1: For 1 (1.1 is true, sice 1 1(1 + 1. 2 STEP 2: Suppose (1.1 is true for some k 1, that is 1
More information1 The Gaussian channel
ECE 77 Lecture 0 The Gaussia chael Objective: I this lecture we will lear about commuicatio over a chael of practical iterest, i which the trasmitted sigal is subjected to additive white Gaussia oise.
More informationConfidence Intervals. CI for a population mean (σ is known and n > 30 or the variable is normally distributed in the.
Cofidece Itervals A cofidece iterval is a iterval whose purpose is to estimate a parameter (a umber that could, i theory, be calculated from the populatio, if measuremets were available for the whole populatio).
More informationDetermining the sample size
Determiig the sample size Oe of the most commo questios ay statisticia gets asked is How large a sample size do I eed? Researchers are ofte surprised to fid out that the aswer depeds o a umber of factors
More informationTHE REGRESSION MODEL IN MATRIX FORM. For simple linear regression, meaning one predictor, the model is. for i = 1, 2, 3,, n
We will cosider the liear regressio model i matrix form. For simple liear regressio, meaig oe predictor, the model is i = + x i + ε i for i =,,,, This model icludes the assumptio that the ε i s are a sample
More informationLesson 17 Pearson s Correlation Coefficient
Outlie Measures of Relatioships Pearso s Correlatio Coefficiet (r) types of data scatter plots measure of directio measure of stregth Computatio covariatio of X ad Y uique variatio i X ad Y measurig
More informationRunning Time ( 3.1) Analysis of Algorithms. Experimental Studies ( 3.1.1) Limitations of Experiments. Pseudocode ( 3.1.2) Theoretical Analysis
Ruig Time ( 3.) Aalysis of Algorithms Iput Algorithm Output A algorithm is a stepbystep procedure for solvig a problem i a fiite amout of time. Most algorithms trasform iput objects ito output objects.
More informationCHAPTER 7: Central Limit Theorem: CLT for Averages (Means)
CHAPTER 7: Cetral Limit Theorem: CLT for Averages (Meas) X = the umber obtaied whe rollig oe six sided die oce. If we roll a six sided die oce, the mea of the probability distributio is X P(X = x) Simulatio:
More information3. Greatest Common Divisor  Least Common Multiple
3 Greatest Commo Divisor  Least Commo Multiple Defiitio 31: The greatest commo divisor of two atural umbers a ad b is the largest atural umber c which divides both a ad b We deote the greatest commo gcd
More informationSolutions to Selected Problems In: Pattern Classification by Duda, Hart, Stork
Solutios to Selected Problems I: Patter Classificatio by Duda, Hart, Stork Joh L. Weatherwax February 4, 008 Problem Solutios Chapter Bayesia Decisio Theory Problem radomized rules Part a: Let Rx be the
More informationTHE ARITHMETIC OF INTEGERS.  multiplication, exponentiation, division, addition, and subtraction
THE ARITHMETIC OF INTEGERS  multiplicatio, expoetiatio, divisio, additio, ad subtractio What to do ad what ot to do. THE INTEGERS Recall that a iteger is oe of the whole umbers, which may be either positive,
More informationMath C067 Sampling Distributions
Math C067 Samplig Distributios Sample Mea ad Sample Proportio Richard Beigel Some time betwee April 16, 2007 ad April 16, 2007 Examples of Samplig A pollster may try to estimate the proportio of voters
More informationUC Berkeley Department of Electrical Engineering and Computer Science. EE 126: Probablity and Random Processes. Solutions 9 Spring 2006
Exam format UC Bereley Departmet of Electrical Egieerig ad Computer Sciece EE 6: Probablity ad Radom Processes Solutios 9 Sprig 006 The secod midterm will be held o Wedesday May 7; CHECK the fial exam
More informationCase Study. Normal and t Distributions. Density Plot. Normal Distributions
Case Study Normal ad t Distributios Bret Halo ad Bret Larget Departmet of Statistics Uiversity of Wiscosi Madiso October 11 13, 2011 Case Study Body temperature varies withi idividuals over time (it ca
More informationHow To Solve An Old Japanese Geometry Problem
116 Taget circles i the ratio 2 : 1 Hiroshi Okumura ad Masayuki Wataabe I this article we cosider the followig old Japaese geometry problem (see Figure 1), whose statemet i [1, p. 39] is missig the coditio
More informationMARTINGALES AND A BASIC APPLICATION
MARTINGALES AND A BASIC APPLICATION TURNER SMITH Abstract. This paper will develop the measuretheoretic approach to probability i order to preset the defiitio of martigales. From there we will apply this
More informationTaking DCOP to the Real World: Efficient Complete Solutions for Distributed MultiEvent Scheduling
Taig DCOP to the Real World: Efficiet Complete Solutios for Distributed MultiEvet Schedulig Rajiv T. Maheswara, Milid Tambe, Emma Bowrig, Joatha P. Pearce, ad Pradeep araatham Uiversity of Souther Califoria
More informationModified Line Search Method for Global Optimization
Modified Lie Search Method for Global Optimizatio Cria Grosa ad Ajith Abraham Ceter of Excellece for Quatifiable Quality of Service Norwegia Uiversity of Sciece ad Techology Trodheim, Norway {cria, ajith}@q2s.tu.o
More informationDescriptive Statistics
Descriptive Statistics We leared to describe data sets graphically. We ca also describe a data set umerically. Measures of Locatio Defiitio The sample mea is the arithmetic average of values. We deote
More informationYour organization has a Class B IP address of 166.144.0.0 Before you implement subnetting, the Network ID and Host ID are divided as follows:
Subettig Subettig is used to subdivide a sigle class of etwork i to multiple smaller etworks. Example: Your orgaizatio has a Class B IP address of 166.144.0.0 Before you implemet subettig, the Network
More informationDefinition. A variable X that takes on values X 1, X 2, X 3,...X k with respective frequencies f 1, f 2, f 3,...f k has mean
1 Social Studies 201 October 13, 2004 Note: The examples i these otes may be differet tha used i class. However, the examples are similar ad the methods used are idetical to what was preseted i class.
More informationTHE ABRACADABRA PROBLEM
THE ABRACADABRA PROBLEM FRANCESCO CARAVENNA Abstract. We preset a detailed solutio of Exercise E0.6 i [Wil9]: i a radom sequece of letters, draw idepedetly ad uiformly from the Eglish alphabet, the expected
More informationTheorems About Power Series
Physics 6A Witer 20 Theorems About Power Series Cosider a power series, f(x) = a x, () where the a are real coefficiets ad x is a real variable. There exists a real oegative umber R, called the radius
More informationPresent Value Factor To bring one dollar in the future back to present, one uses the Present Value Factor (PVF): Concept 9: Present Value
Cocept 9: Preset Value Is the value of a dollar received today the same as received a year from today? A dollar today is worth more tha a dollar tomorrow because of iflatio, opportuity cost, ad risk Brigig
More informationWeek 3 Conditional probabilities, Bayes formula, WEEK 3 page 1 Expected value of a random variable
Week 3 Coditioal probabilities, Bayes formula, WEEK 3 page 1 Expected value of a radom variable We recall our discussio of 5 card poker hads. Example 13 : a) What is the probability of evet A that a 5
More informationCHAPTER 3 DIGITAL CODING OF SIGNALS
CHAPTER 3 DIGITAL CODING OF SIGNALS Computers are ofte used to automate the recordig of measuremets. The trasducers ad sigal coditioig circuits produce a voltage sigal that is proportioal to a quatity
More informationNormal Distribution.
Normal Distributio www.icrf.l Normal distributio I probability theory, the ormal or Gaussia distributio, is a cotiuous probability distributio that is ofte used as a first approimatio to describe realvalued
More informationA Recursive Formula for Moments of a Binomial Distribution
A Recursive Formula for Momets of a Biomial Distributio Árpád Béyi beyi@mathumassedu, Uiversity of Massachusetts, Amherst, MA 01003 ad Saverio M Maago smmaago@psavymil Naval Postgraduate School, Moterey,
More informationConfidence Intervals for One Mean
Chapter 420 Cofidece Itervals for Oe Mea Itroductio This routie calculates the sample size ecessary to achieve a specified distace from the mea to the cofidece limit(s) at a stated cofidece level for a
More informationOutput Analysis (2, Chapters 10 &11 Law)
B. Maddah ENMG 6 Simulatio 05/0/07 Output Aalysis (, Chapters 10 &11 Law) Comparig alterative system cofiguratio Sice the output of a simulatio is radom, the comparig differet systems via simulatio should
More informationGCSE STATISTICS. 4) How to calculate the range: The difference between the biggest number and the smallest number.
GCSE STATISTICS You should kow: 1) How to draw a frequecy diagram: e.g. NUMBER TALLY FREQUENCY 1 3 5 ) How to draw a bar chart, a pictogram, ad a pie chart. 3) How to use averages: a) Mea  add up all
More informationMeasures of Spread and Boxplots Discrete Math, Section 9.4
Measures of Spread ad Boxplots Discrete Math, Sectio 9.4 We start with a example: Example 1: Comparig Mea ad Media Compute the mea ad media of each data set: S 1 = {4, 6, 8, 10, 1, 14, 16} S = {4, 7, 9,
More informationBasic Elements of Arithmetic Sequences and Series
MA40S PRECALCULUS UNIT G GEOMETRIC SEQUENCES CLASS NOTES (COMPLETED NO NEED TO COPY NOTES FROM OVERHEAD) Basic Elemets of Arithmetic Sequeces ad Series Objective: To establish basic elemets of arithmetic
More informationChapter 14 Nonparametric Statistics
Chapter 14 Noparametric Statistics A.K.A. distributiofree statistics! Does ot deped o the populatio fittig ay particular type of distributio (e.g, ormal). Sice these methods make fewer assumptios, they
More informationLecture 2: Karger s Min Cut Algorithm
priceto uiv. F 3 cos 5: Advaced Algorithm Desig Lecture : Karger s Mi Cut Algorithm Lecturer: Sajeev Arora Scribe:Sajeev Today s topic is simple but gorgeous: Karger s mi cut algorithm ad its extesio.
More informationHow To Solve The Homewor Problem Beautifully
Egieerig 33 eautiful Homewor et 3 of 7 Kuszmar roblem.5.5 large departmet store sells sport shirts i three sizes small, medium, ad large, three patters plaid, prit, ad stripe, ad two sleeve legths log
More informationWHEN IS THE (CO)SINE OF A RATIONAL ANGLE EQUAL TO A RATIONAL NUMBER?
WHEN IS THE (CO)SINE OF A RATIONAL ANGLE EQUAL TO A RATIONAL NUMBER? JÖRG JAHNEL 1. My Motivatio Some Sort of a Itroductio Last term I tought Topological Groups at the Göttige Georg August Uiversity. This
More informationNotes on exponential generating functions and structures.
Notes o expoetial geeratig fuctios ad structures. 1. The cocept of a structure. Cosider the followig coutig problems: (1) to fid for each the umber of partitios of a elemet set, (2) to fid for each the
More informationTHIN SEQUENCES AND THE GRAM MATRIX PAMELA GORKIN, JOHN E. MCCARTHY, SANDRA POTT, AND BRETT D. WICK
THIN SEQUENCES AND THE GRAM MATRIX PAMELA GORKIN, JOHN E MCCARTHY, SANDRA POTT, AND BRETT D WICK Abstract We provide a ew proof of Volberg s Theorem characterizig thi iterpolatig sequeces as those for
More informationPerfect Packing Theorems and the AverageCase Behavior of Optimal and Online Bin Packing
SIAM REVIEW Vol. 44, No. 1, pp. 95 108 c 2002 Society for Idustrial ad Applied Mathematics Perfect Packig Theorems ad the AverageCase Behavior of Optimal ad Olie Bi Packig E. G. Coffma, Jr. C. Courcoubetis
More informationOverview. Learning Objectives. Point Estimate. Estimation. Estimating the Value of a Parameter Using Confidence Intervals
Overview Estimatig the Value of a Parameter Usig Cofidece Itervals We apply the results about the sample mea the problem of estimatio Estimatio is the process of usig sample data estimate the value of
More information. P. 4.3 Basic feasible solutions and vertices of polyhedra. x 1. x 2
4. Basic feasible solutios ad vertices of polyhedra Due to the fudametal theorem of Liear Programmig, to solve ay LP it suffices to cosider the vertices (fiitely may) of the polyhedro P of the feasible
More informationhp calculators HP 12C Statistics  average and standard deviation Average and standard deviation concepts HP12C average and standard deviation
HP 1C Statistics  average ad stadard deviatio Average ad stadard deviatio cocepts HP1C average ad stadard deviatio Practice calculatig averages ad stadard deviatios with oe or two variables HP 1C Statistics
More informationChapter 7: Confidence Interval and Sample Size
Chapter 7: Cofidece Iterval ad Sample Size Learig Objectives Upo successful completio of Chapter 7, you will be able to: Fid the cofidece iterval for the mea, proportio, ad variace. Determie the miimum
More informationChapter 7  Sampling Distributions. 1 Introduction. What is statistics? It consist of three major areas:
Chapter 7  Samplig Distributios 1 Itroductio What is statistics? It cosist of three major areas: Data Collectio: samplig plas ad experimetal desigs Descriptive Statistics: umerical ad graphical summaries
More informationTHE HEIGHT OF qbinary SEARCH TREES
THE HEIGHT OF qbinary SEARCH TREES MICHAEL DRMOTA AND HELMUT PRODINGER Abstract. q biary search trees are obtaied from words, equipped with the geometric distributio istead of permutatios. The average
More informationFactors of sums of powers of binomial coefficients
ACTA ARITHMETICA LXXXVI.1 (1998) Factors of sums of powers of biomial coefficiets by Neil J. Cali (Clemso, S.C.) Dedicated to the memory of Paul Erdős 1. Itroductio. It is well ow that if ( ) a f,a = the
More informationSolving Logarithms and Exponential Equations
Solvig Logarithms ad Epoetial Equatios Logarithmic Equatios There are two major ideas required whe solvig Logarithmic Equatios. The first is the Defiitio of a Logarithm. You may recall from a earlier topic:
More informationClass Meeting # 16: The Fourier Transform on R n
MATH 18.152 COUSE NOTES  CLASS MEETING # 16 18.152 Itroductio to PDEs, Fall 2011 Professor: Jared Speck Class Meetig # 16: The Fourier Trasform o 1. Itroductio to the Fourier Trasform Earlier i the course,
More informationFast Fourier Transform
18.310 lecture otes November 18, 2013 Fast Fourier Trasform Lecturer: Michel Goemas I these otes we defie the Discrete Fourier Trasform, ad give a method for computig it fast: the Fast Fourier Trasform.
More informationMath 113 HW #11 Solutions
Math 3 HW # Solutios 5. 4. (a) Estimate the area uder the graph of f(x) = x from x = to x = 4 usig four approximatig rectagles ad right edpoits. Sketch the graph ad the rectagles. Is your estimate a uderestimate
More information