Supplementary Material for Spectral Clustering based on the graph p-laplacian

Size: px
Start display at page:

Download "Supplementary Material for Spectral Clustering based on the graph p-laplacian"

Transcription

1 Sulementary Materal for Sectral Clusterng based on the grah -Lalacan Thomas Bühler and Matthas Hen Saarland Unversty, Saarbrücken, Germany May 009 Corrected verson, June 00 Abstract Ths techncal reort s an aendx to the ICML 009 submsson Sectral Clusterng based on the grah -Lalacan [], contanng the roofs whch had to be omtted due to sace restrctons In ths verson, an error occurng n a revous verson has been corrected However, note that the error occurred n an addtonal statement whch was not used n any roof, thus the correctness of the other results s not affected Overvew Ths techncal reort s an aendx to the ICML 009 submsson Sectral Clusterng based on the grah -Lalacan [], contanng the roofs whch had to be omtted due to sace restrctons Our roosed method and some of the results are based on the recent work by Amghbech [] In hs very nterestng artcle, the author rooses the varatonal characterzaton of the second egenvector of the normalzed grah -Lalacan and derves the soermetrc nequalty n the normalzed case Due to the comressed form of the roof gven n [], some mortant lemmas whch lay a role n the roof of the varatonal characterzaton are not exlctely stated n the aer, hence we cover the roofs n more detal n the followng Moreover, we rovde basc roertes of the -Lalacan and related functonals and extend the results of Amghbech to the unnormalzed case However, our man result s to show that the Cheeger cuts obtaned by thresholdng the second egenvector converge to the otmal Cheeger cut as Ths aer s organzed as follows: We start wth some basc roertes of the grah -Lalacan and related functonals n Secton In Secton 3 we rove the varatonal characterzaton of the second egenvalue of the unnormalzed grah -Lalacan Theorem 3 n [], and Secton 4 contans the corresondng characterzatons for the frst and second egenvector n the normalzed case Secton 5 contans the roof of the soermetrc nequalty from Theorem 43 n [], and Secton 6 an outlne of the roof n the normalzed case Fnally,

2 Secton 7 establshes the connecton between the otmal Cheeger cut and the cut obtaned by thresholdng the second egenvector Theorem 44 n [] As n [], the number of onts s denoted by n = V and the comlement of a set A V s wrtten as A = V \A The degree functon d : V R of the grah s gven as d = n j= w j and the cut of A V and B V, wth A B =, s defned as cuta, B = A, j B w j Moreover, we denote by A the cardnalty of the set A and by vola = A d the volume of A The grah -Lalacan and related functonals The unnormalzed and normalzed grah -Lalacan u defned for any functon f : V R and V as u f = j V w j φ f f j, f = w j φ f f j, d n j V and n are where φ : R R wth φ x = x sgnx As shown n [], one can obtan the egenvalues of the unnormalzed -Lalacan u as local mnma of the functonal F : R V R, F f = Q f f where Q f = f, u f =,j V w j f f j, and each crtcal ont of F corresonds to an egenvector of the -Lalacan To obtan the second egenvalue, we consder the functonal F : R V R, F f = Q f var u f, n analogy to the functonal defned by Amghbech n [] The unnormalzed -varance var u f s defned as var u f = mn f m m R Furthermore, we defne the unnormalzed -mean of f as mean u f = arg mn f m m R In Theorem 3 n Secton 3 we show that the global mnmum of the functonal F s equal to the second egenvalue of the grah -Lalacan u

3 Analogously, n the case of the normalzed grah -Lalacan, one can defne functonals G : R V R and G : R V R, G f = Q f d f and G f = Q f var n f, wth the normalzed -varance defned as var n f = mn d f m m R, 3 and the normalzed -mean of f as mean n f = arg mn d f m m R Theorems 4 and 4 n Secton 4 establsh the connecton between these functonals and the egenvalues of the normalzed -Lalacan Basc roertes of -Lalacan and related functonals In the followng sectons we restrct ourselves n the roofs to the unnormalzed case Proofs n the normalzed case are smlar Prooston For any functon f : V R, and c R, the unnormalzed -Lalacan u has the followng roertes: u f + c = u f u c f = φ c u f For any functon f : V R, and c R, the normalzed -Lalacan n the followng roertes: has n f + c = n f n c f = φ c n f Proof: These roertes follow drectly from the defnton, as t holds V that u f + c = w j φ f + c f j c = u f j V and u c f = j V w j φ c f f j = j V w j c f f j sgn c f f j = c sgnc j V w j f f j sgn f f j = φ c u f 3

4 Prooston For any functon f : V R, and c R, the functonal Q f has the followng roertes: Q f + c = Q f Q c f = c Q f Proof: Agan the roertes follow drectly from the defnton Prooston 3 For any functon f : V R, and c R, the unnormalzed -varance var u f has the followng roertes: var u f + c = var u f var u c f = c var u f For any functon f : V R, and c R, the normalzed -varance var n f has the followng roertes: var n f + c = var n f var n c f = c var n f Proof: a Let the -means of f and f + c be gven by m = mean u f and m = mean u f + c Let now m := m + c Then t follows from the defnton of the -varance that var u f + c = mn f + c m m R = f + c m f m = var u f Analogously, for m := m c, we obtan var u var u f = var u f + c f var u f + c and hence b If c = 0, one easly sees that var u c f = 0 = c var u f Let now 4

5 c 0 Then var u c f = mn c f m m R = c mn f m m R c = c mn f m m R : m = m m R c = c var u f The followng roerty wll later be used to establsh a connecton between the non-constant egenvectors of the unnormalzed and normalzed -Lalacan and the mnmzers of the functonals F res G Prooston 4 Let f R V and m R Then f has unnormalzed -mean value m = mean u f f and only f the followng condton holds: φ f m = 0 Let f R V and m R Then f has normalzed -mean value m = mean n f f and only f the followng condton holds: d φ f m = 0 Proof: We have f m m = f m sgn f m = φ f m, whch mles that a necessary condton for any mnmzer m of the term f m s gven as φ f m = 0 Due to the convexty of the term f m for >, ths s also a suffcent condton Prooston 5 The dervatve of the unnormalzed varance var u f wth resect to f k s gven as var u f = φ 5 f k mean u f

6 The dervatve of the normalzed varance var n f wth resect to f k s gven as var n f = d k φ f k mean n f Proof: We have var u f = f mean u f = f mean u f sgnf mean u f f mean u f By alyng the defnton of φ and slttng the last term one obtans φ f mean u φ f mean u = φ f k mean u f f f f mean u f mean u f φ f mean u f Due to Pro 4 t holds that φ f mean u f = 0 Thus we obtan var u f = φ f k mean u f The followng rooston rovdes the lnk between the functonals F and F as well as G and G Note that the -mean nsde the -varance s a functon R V R, whch we have to take nto account when takng the dervatve Prooston 6 For any functon f : V R let f denote the unnormalzed -mean of f Then t holds that F F F f l f = F f f f = F f f f k f = f l F f f + F f Ωf k,l, 6

7 where f l f fk f Ωf k,l = f f f f For any functon f : V R let f denote the normalzed -mean of f Then t holds that where G G G f l f = G f f f = G f f f k f = f l F f f + F f Ωf k,l fl d l d k f fk f Ωf k,l = f f d f f d Proof: The frst statement can be seen drectly by the defntons of F and F and the fact that Q f = Q f f Usng Pro 5 and the defnton of u to f k can be wrtten as Q f var f = var f u, the dervatve of f k Q f var f φ f k f Q f var f wth resect By alyng Pro and Pro as well as the defnton of the -varance, the above exresson can be rewrtten as f f u f f k Q f f f f φ f k f Comarson wth the exresson for F now yelds the second statement For the statement for the second dervatves, one frst shows that f l f = f f l f l = n f and then roceeds analogously to the frst and second statement 3 Varatonal characterzaton of the second egenvalue - Unnormalzed case Theorem 3 The second egenvalue of the unnormalzed grah -Lalacan u s equal to the global mnmum of the functonal F The corresondng 7

8 egenvector v u of F of u s then gven as v = u c for any global mnmzer n = u c, where c = arg mn c R Furthermore, the functonal F satsfes F tu + c = F u t, c R Lemma 3 Let f be a crtcal ont of the functonal F Then the vector v = f mean u f s an egenfuncton of u wth egenvalue λ = F f Proof: Let f be a crtcal ont of F wth mnmum λ Then F f = 0 By Pro 6 ths mles F f mean u f = 0 as well as λ = F f = F f mean u f It follows that f mean u f s a crtcal ont of F, and by Theorem 3 n [] an egenvector of u wth egenvalue λ Before rovng the other drecton, let us frst derve an mortant roerty of the non-constant egenvectors of the -Lalacan Lemma 3 Let v be a non-constant egenvector of Then φ v = 0 Proof: Let v be a non-constant egenvector of u for all V the equaton v λ φ v = 0 wth egenvalue λ Hence holds As v s not the constant vector, we know that λ 0 and hence V, It follows that φ v = v λ φ v = v λ = w j φ v v j λ j V = w j v v j w j v v j λ λ,j V,v >v j,j V,v <v j = w j v v j w j v j v λ λ,j V,v >v j j,,v j<v = 0, 8

9 where n the enultmate ste we have erformed a change of the varable names n the second term and n the last ste exloted the fact that w j = w j The above roerty can be seen as a generalzaton of the fact that the larger egenvectors of the unnormalzed standard grah Lalacan are orthogonal to the frst egenvector Lemma 33 Let v be a non-constant egenvector of the -Lalacan u wth egenvalue λ Then there exsts a functon f whch s a crtcal ont of F wth λ = F f and t holds that v = f mean u f Proof: By Theorem 3 n [] we know that v s a crtcal ont of F wth λ = F v Consder now for k R the functon f : V R defned by f = v + k By Lemma 3 t holds that φ v = 0 It follows that k: φ f k = φ f k = φ v = 0 By Pro 4 ths mles that k = mean u f, and hence Pro 6 now mles that F f = F v = f mean u f f mean u f = F v = λ and F f = F f mean u = F v = 0 f Hence t follows that f s a mnmzer of F wth mnmum λ Proof of Theorem 3: Lemma 3 shows the forward drecton of the frst statement of Theorem 3 The reverse drecton follows from Lemma 33 The second statement follows from Pro and 3 9

10 4 Varatonal characterzaton of the second egenvalue - Normalzed case The followng theorems are the normalzed varants of Theorem 3 and Theorem 3 n [] Theorem 4 The functonal G has a crtcal ont at v R V f and only f v s a -egenfuncton of the normalzed grah -Lalacan n The corresondng egenvalue λ s gven as λ = G v Moreover, we have G αf = G f for all f R V and α R Theorem 4 The second egenvalue of the normalzed grah -Lalacan n s equal to the global mnmum of the functonal G The corresondng egenvector v of n s then gven as v = u c for any global mnmzer u of G n = d u c, where c = arg mn c R Furthermore, the functonal G satsfes G tu + c = G u t, c R The roofs of the above theorems are smlar to the unnormalzed case We just want to sketch the roof of Theorem 4 by gvng the corresondng lemmas wthout roof Lemma 4 Let f be a crtcal ont of the functonal G Then the vector v = f mean n f s an egenfuncton of n wth egenvalue λ = G f Lemma 4 Let v be a non-constant egenvector of n Then d φ v = 0 wth egenvalue λ Then there exsts a functon f whch s a crtcal ont of G Lemma 43 Let v be a non-constant egenvector of the -Lalacan n wth λ = G f and t holds that v = f mean n f 5 Isoermetrc nequalty - Unnormalzed case As shown n [], for > and every artton of V nto C, C there exsts a functon f,c R V such that the functonal F assocated to the unnormalzed -Lalacan satsfes F f,c = cutc, C + 4 C C Exlctely, the functon f,c s gven as f,c = { / C, C, / C, C 5 0

11 The exresson 4 can be nterreted as a balanced grah cut crteron, and we have the secal cases F f,c = RCutC, C, lm F f,c = RCCC, C It follows that mnmzng the above balanced grah cut crteron s equvalent to mnmzng F wth the restrcton to functons that have the form gven n 5 As the second egenvalue of the -Lalacan s the mnmum of the functonal F taken over all ossble functons wthout the restrcton, the second egenvalue can be seen as a relaxaton of balanced grah cuts The queston s, can we make any statements about the qualty of ths relaxaton? The soermetrc nequalty gves uer and lower bounds on the second egenvalue n terms of the otmal Cheeger cut value defned as h RCC = nf RCCC, C C Theorem 5 Denote by λ the second egenvalue of the unnormalzed grah -Lalacan u For >, hrcc λ h RCC max d Proof of the uer bound n Theorem 5: Let for any > the second smallest egenvalue of the unnormalzed -Lalacan be gven by λ Theorem 3 mles that λ = mn F Q f f R V f = mn, f R V var u f where Q f and var u f are defned as n and Consder now for a artton C, C the functon f,c : V R whch we have defned n 5 Then, usng 4, we have λ F f,c = cutc, C + C C cutc, C { mn C, } C = cutc, C mn { C, C } = RCCC, C As ths nequalty holds for all arttons C, C, t follows that λ nf C RCCC, C = h RCC

12 For the roof of the lower bound we need to ntroduce some notaton In the followng let us for any functon f : V R denote by f + : V R the functon { f + f, f = 0, 6 0, else Furthermore, we use the notaton Cf t, Ct f V nto the sets for the arttonng of the vertex set C t f = { f > t} and C t f = V Ct f = { f t}, 7 where t R Fnally, for any functon f : V R, we denote by h f,rcc the quantty { } h cutc, C f,rcc = nf C mn { C, C } C = C t f for t 0 8 The value of h f,rcc s the smallest ossble RCC value obtaned by thresholdng f at some t 0 If Cf 0 =, we defne h f,rcc = To rove the lower bound, we roceed n analogy to [] Lemma 5 Suose there exsts a λ 0 such that t holds Cf 0 u f λf Then λ Q f + f + Proof: We have λ f + = λ f + = λ f = λ f f that C 0 f C 0 f Usng the assumton, t follows that λ f + f u f = f + u f C 0 f Alyng the defnton of u, ths can be rewrtten as = f + w j φ f f j j V = w j f + φ f f j + w j f + φ f f j =,j V,j V,j V w j f + f + j φ f f j Let us now have a closer look at the summands n the above sum If both and j are n Cf 0, we have f + f + j φ f f j = f + f + j φ f + f + j = f + f + j

13 If Cf 0 and j / C0 f, t holds that f + f + j φ f f j = f + f f j sgnf f j = f + f f j f + f, where we have used that f > 0 and f j 0 The last term can be rewrtten as f + = f + f + j Analogously, f / Cf 0 and j C0 f, we have f + f + j φ f f j = f + j f f j sgnf f j = f + j f f j f + j f j = f + j = f + f + j Fnally, n the case that both and j are not n Cf 0, t holds that f + f + j φ f f j = 0 = f + If we combne these results, we obtan that whch comletes our roof,j V,j V f + j w j f + f + j φ f f j w j f + f + j = Q f +, The followng nequalty, whch wll be used n the next lemma, has been shown by Amghbech [] Lemma 5 Amghbech, [] If a, b 0, > and + q =, then b a q b a a + b Lemma 53 For any functon f R V wth 0 < defned n 8 t holds that Q f + f + C 0 f h f,rcc max d V and h f,rcc as Proof: Consder the term w j f + j f + f + j >f + 3

14 On the one hand we have f + j >f + w j f + j f + = = f + j >f + f + j >f + w j [t ] f + j f + f + j w j f + t dt We can change the order of ntegraton and summaton and obtan f + j >f + f + j w j f + t dt = t 0 f + j >t f + w j dt Note that for t 0, w j = f + j >t f + f j>t f w j = whch leads us to the followng nequalty cutcf t, Cf t = cutct f, Ct f Cf t { nf C j C t f, Ct f C f t = w j = cutc t f, C t f, cutcf t, Ct f { } C mn t f, Cf t C f t } cutc, C mn { C, C } C = C t f for t 0 = h f,rcc C t f, where n the second ste we used the assumton that 0 < ths nequalty holds for all t 0, we obtan t 0 f + j >t f + w j dt 0 t h f,rcc C t f C 0 f dt C t f V As We now use that Cf t = f = >t f + >t for t 0, and change the order of summaton and ntegraton agan, whch leads us to 0 t h f,rcc f + >t dt = h f,rcc = h f,rcc = h f,rcc = h f,rcc f + j >0 f + j 0 [t ] f + j >0 f + j >0 f + j 0 f + j f + t dt 4

15 So we have just shown the nequalty f + j >f + w j f + j f + h f,rcc On the other hand we have w j f + j f + f + 9 = f + j >f + w j f + j f + + w j f + f + j = f + j >f +,j V w j f + j f +, f + >f + j where agan we exloted the symmetry of the weghts n the second ste Let q be the conjugate of, defned by the equaton + q = The sum can now be decomosed nto,j V = f + j f + f + j f + w j f + j f + / w j f + j f + w j f + j = Q f + / f + j f + f + /q w f + j f + j f + j f + / f + j f + w j f + w j f + q j f + j f + f + j f + q f + j f + where we used Hölder s nequalty n the second ste By alyng Lemma 5 /q, /q 5

16 we obtan for the second roduct term assumng that /q f + w f + q j j f + f + q w j f + j + f + j f + j f + f + j >f + 4 /q = 4 /q /q f + j f +,j V w j f + + f + j d f + /q max d f + /q / max d = f + Hence we have / f + j f + max d w j Q f + / f + 0 By combnng 9 and 0 we obtan /q /q h f,rcc / f + max d Q f + / f +, whch can be rewrtten as h f,rcc Q f + max d f + Proof of the lower bound n Theorem 5: Let f be the egenfuncton of u corresondng to the second egenvalue λ Let Cf 0 be the set of values where f > 0, as defned n 7 Wthout loss of generalty, we can assume that 0 < C f 0 V, otherwse we just relace f by f We know that u f = λ f on C 0 f, so our condton for Lemma 5 s fulflled Alyng Lemma 5 and 53 yelds λ Q f + h f,rcc f + max d Clearly, we have h f,rcc h RCC, whch comletes the roof 6

17 6 Isoermetrc nequalty - Normalzed case One can show that also n the normalzed case, for > and every artton of V nto C, C there exsts a functon g,c R V such that the functonal G assocated to the normalzed -Lalacan satsfes G g,c = cutc, C + volc volc Exlctely, the functon g,c s gven as { / volc, C, g,c = / volc, C As n the unnormalzed case, the exresson can be nterreted as a balanced grah cut crteron, and we have the secal cases lm G g,c = NCutC, C, G g,c = NCCC, C It follows that mnmzng the above balanced grah cut crteron s equvalent to mnmzng G wth the restrcton to functons that have the form gven n Wth the same argument as n the unnormalzed case, the second egenvector can be seen as a relaxaton of balanced grah cuts As n the unnormalzed case, the soermetrc nequalty gves uer and lower bounds on the second egenvalue n terms of the otmal Cheeger cut value defned as h NCC = nf NCCC, C C Theorem 6 Amghbech, [] Denote by λ normalzed grah -Lalacan n For >, hncc λ h NCC the second egenvalue of the The roof of the uer bound s smlar to the unnormalzed case For the roof of the lower bound, we use agan the notaton f + for the restrcton of the functon f to ostve values, as well as Cf t, Ct f for a arttonng of the vertex set by thresholdng, as ntroduced n 6 and 7 Furthermore, for any functon f : V R, we denote by h f,ncc the quantty { } h cutc, C f,ncc = nf C mn { volc, volc } C = C t f for t 0 Analogously to the unnormalzed case, the value of h f,ncc s the smallest ossble NCC value obtaned by thresholdng f at some t 0 Agan, we set h f,ncc = n the case C0 f = Lemma 6 Suose there exsts a λ 0 such that t holds Cf 0 n f λf Then Q f + λ f + d that 7

18 Lemma 6 For any functon f R V wth 0 < volcf 0 volv and h f,ncc as defned above t holds that Q f + h f,ncc f + d Usng the above lemmas the lower bound can now be roven n a smlar way to the unnormalzed case 7 Convergence to the otmal Cheeger cut In -sectral clusterng, a arttonng of the grah s obtaned by thresholdng the real-valued second egenvector v of the grah -Lalacan The otmal threshold s determned by mnmzng the corresondng Cheeger cut, e n the case of the unnormalzed grah -Lalacan u one determnes arg mn C t={ v >t} RCCC t, C t, 3 and smlarly for the second egenvector of the normalzed grah -Lalacan n one comutes arg mn NCCC t, C t 4 C t={ v >t} One can now establsh a connecton between the cut obtaned by thresholdng accordng to the above scheme and the otmal Cheeger cut Theorem 7 Denote by h RCC the rato Cheeger cut value obtaned by tresholdng the second egenvector v of the unnormalzed -Lalacan va 3 Then for >, h RCC h RCC max d h RCC Denote by h NCC the normalzed Cheeger cut value obtaned by tresholdng the second egenvector v of the normalzed -Lalacan va 4 Then for >, h NCC h NCC h NCC Interestngly, the nequaltes become tght for Ths mles that the cut found by thresholdng converges to the otmal Cheeger cut, whch rovdes the man motvaton for -sectral clusterng Proof of Theorem 7: Clearly, the lower bound holds Let now f be the egenfuncton of u corresondng to the second egenvalue λ Let Cf 0 be the set of values where f > 0, as defned n 7 Wthout loss of generalty, we can assume that 0 < C f 0 V, otherwse we just relace f by f We know that u f = λ f on C 0 f, 8

19 so our condton for Lemma 5 s fulflled Alyng Lemma 5 and 53 yelds λ Q f + f + max d Note that h f,rcc = h RCC, and hence we obtan max d h f,rcc h RCC λ Note that ths bound s tghter than the lower bound from Theorem 5 The above nequalty can be reformulated as h RCC max d λ Usng that λ h RCC, we obtan h RCC max d h RCC As shown by Amghbech [], n the normalzed case one has the nequalty λ hncc Analogously to the unnormalzed case one can show the stronger statement λ h NCC hncc The frst nequalty can be reformulated as h NCC λ, and wth λ h NCC one obtans the result n the normalzed case References [] S Amghbech Egenvalues of the dscrete -Lalacan for grahs Ars Combn, 67:83 30, 003 [] Thomas Bühler and Matthas Hen Sectral Clusterng based on the grah -Lalacan In Proceedngs of the 6th Internatonal Conference on Machne Learnng ICML To aear, 009 9

Not-for-Publication Appendix to Optimal Asymptotic Least Aquares Estimation in a Singular Set-up

Not-for-Publication Appendix to Optimal Asymptotic Least Aquares Estimation in a Singular Set-up Not-for-Publcaton Aendx to Otmal Asymtotc Least Aquares Estmaton n a Sngular Set-u Antono Dez de los Ros Bank of Canada dezbankofcanada.ca December 214 A Proof of Proostons A.1 Proof of Prooston 1 Ts roof

More information

Stanford University CS359G: Graph Partitioning and Expanders Handout 4 Luca Trevisan January 13, 2011

Stanford University CS359G: Graph Partitioning and Expanders Handout 4 Luca Trevisan January 13, 2011 Stanford Unversty CS359G: Graph Parttonng and Expanders Handout 4 Luca Trevsan January 3, 0 Lecture 4 In whch we prove the dffcult drecton of Cheeger s nequalty. As n the past lectures, consder an undrected

More information

Managing Capacity Through Reward Programs. on-line companion page. Byung-Do Kim Seoul National University College of Business Administration

Managing Capacity Through Reward Programs. on-line companion page. Byung-Do Kim Seoul National University College of Business Administration Managng Caacty Through eward Programs on-lne comanon age Byung-Do Km Seoul Natonal Unversty College of Busness Admnstraton Mengze Sh Unversty of Toronto otman School of Management Toronto ON M5S E6 Canada

More information

APPENDIX A Some Linear Algebra

APPENDIX A Some Linear Algebra APPENDIX A Some Lnear Algebra The collecton of m, n matrces A.1 Matrces a 1,1,..., a 1,n A = a m,1,..., a m,n wth real elements a,j s denoted by R m,n. If n = 1 then A s called a column vector. Smlarly,

More information

U.C. Berkeley CS294: Spectral Methods and Expanders Handout 8 Luca Trevisan February 17, 2016

U.C. Berkeley CS294: Spectral Methods and Expanders Handout 8 Luca Trevisan February 17, 2016 U.C. Berkeley CS94: Spectral Methods and Expanders Handout 8 Luca Trevsan February 7, 06 Lecture 8: Spectral Algorthms Wrap-up In whch we talk about even more generalzatons of Cheeger s nequaltes, and

More information

( ) 2 ( ) ( ) Problem Set 4 Suggested Solutions. Problem 1

( ) 2 ( ) ( ) Problem Set 4 Suggested Solutions. Problem 1 Problem Set 4 Suggested Solutons Problem (A) The market demand functon s the soluton to the followng utlty-maxmzaton roblem (UMP): The Lagrangean: ( x, x, x ) = + max U x, x, x x x x st.. x + x + x y x,

More information

MAT 578 Functional Analysis

MAT 578 Functional Analysis MAT 578 Functonal Analyss John Qugg Fall 2008 Locally convex spaces revsed September 6, 2008 Ths secton establshes the fundamental propertes of locally convex spaces. Acknowledgment: although I wrote these

More information

2-Adic Complexity of a Sequence Obtained from a Periodic Binary Sequence by Either Inserting or Deleting k Symbols within One Period

2-Adic Complexity of a Sequence Obtained from a Periodic Binary Sequence by Either Inserting or Deleting k Symbols within One Period -Adc Comlexty of a Seuence Obtaned from a Perodc Bnary Seuence by Ether Insertng or Deletng Symbols wthn One Perod ZHAO Lu, WEN Qao-yan (State Key Laboratory of Networng and Swtchng echnology, Bejng Unversty

More information

ANSWERS. Problem 1. and the moment generating function (mgf) by. defined for any real t. Use this to show that E( U) var( U)

ANSWERS. Problem 1. and the moment generating function (mgf) by. defined for any real t. Use this to show that E( U) var( U) Econ 413 Exam 13 H ANSWERS Settet er nndelt 9 deloppgaver, A,B,C, som alle anbefales å telle lkt for å gøre det ltt lettere å stå. Svar er gtt . Unfortunately, there s a prntng error n the hnt of

More information

An application of generalized Tsalli s-havrda-charvat entropy in coding theory through a generalization of Kraft inequality

An application of generalized Tsalli s-havrda-charvat entropy in coding theory through a generalization of Kraft inequality Internatonal Journal of Statstcs and Aled Mathematcs 206; (4): 0-05 ISS: 2456-452 Maths 206; (4): 0-05 206 Stats & Maths wwwmathsjournalcom Receved: 0-09-206 Acceted: 02-0-206 Maharsh Markendeshwar Unversty,

More information

On the Connectedness of the Solution Set for the Weak Vector Variational Inequality 1

On the Connectedness of the Solution Set for the Weak Vector Variational Inequality 1 Journal of Mathematcal Analyss and Alcatons 260, 15 2001 do:10.1006jmaa.2000.7389, avalable onlne at htt:.dealbrary.com on On the Connectedness of the Soluton Set for the Weak Vector Varatonal Inequalty

More information

Complete subgraphs in multipartite graphs

Complete subgraphs in multipartite graphs Complete subgraphs n multpartte graphs FLORIAN PFENDER Unverstät Rostock, Insttut für Mathematk D-18057 Rostock, Germany Floran.Pfender@un-rostock.de Abstract Turán s Theorem states that every graph G

More information

A NOTE ON THE DISCRETE FOURIER RESTRICTION PROBLEM

A NOTE ON THE DISCRETE FOURIER RESTRICTION PROBLEM A NOTE ON THE DISCRETE FOURIER RESTRICTION PROBLEM XUDONG LAI AND YONG DING arxv:171001481v1 [mathap] 4 Oct 017 Abstract In ths aer we establsh a general dscrete Fourer restrcton theorem As an alcaton

More information

The Order Relation and Trace Inequalities for. Hermitian Operators

The Order Relation and Trace Inequalities for. Hermitian Operators Internatonal Mathematcal Forum, Vol 3, 08, no, 507-57 HIKARI Ltd, wwwm-hkarcom https://doorg/0988/mf088055 The Order Relaton and Trace Inequaltes for Hermtan Operators Y Huang School of Informaton Scence

More information

Fuzzy approach to solve multi-objective capacitated transportation problem

Fuzzy approach to solve multi-objective capacitated transportation problem Internatonal Journal of Bonformatcs Research, ISSN: 0975 087, Volume, Issue, 00, -0-4 Fuzzy aroach to solve mult-objectve caactated transortaton roblem Lohgaonkar M. H. and Bajaj V. H.* * Deartment of

More information

PARTIAL QUOTIENTS AND DISTRIBUTION OF SEQUENCES. Department of Mathematics University of California Riverside, CA

PARTIAL QUOTIENTS AND DISTRIBUTION OF SEQUENCES. Department of Mathematics University of California Riverside, CA PARTIAL QUOTIETS AD DISTRIBUTIO OF SEQUECES 1 Me-Chu Chang Deartment of Mathematcs Unversty of Calforna Rversde, CA 92521 mcc@math.ucr.edu Abstract. In ths aer we establsh average bounds on the artal quotents

More information

Dr. Shalabh Department of Mathematics and Statistics Indian Institute of Technology Kanpur

Dr. Shalabh Department of Mathematics and Statistics Indian Institute of Technology Kanpur Analyss of Varance and Desgn of Exerments-I MODULE II LECTURE - GENERAL LINEAR HYPOTHESIS AND ANALYSIS OF VARIANCE Dr. Shalabh Deartment of Mathematcs and Statstcs Indan Insttute of Technology Kanur 3.

More information

e - c o m p a n i o n

e - c o m p a n i o n OPERATIONS RESEARCH http://dxdoorg/0287/opre007ec e - c o m p a n o n ONLY AVAILABLE IN ELECTRONIC FORM 202 INFORMS Electronc Companon Generalzed Quantty Competton for Multple Products and Loss of Effcency

More information

Supplementary material: Margin based PU Learning. Matrix Concentration Inequalities

Supplementary material: Margin based PU Learning. Matrix Concentration Inequalities Supplementary materal: Margn based PU Learnng We gve the complete proofs of Theorem and n Secton We frst ntroduce the well-known concentraton nequalty, so the covarance estmator can be bounded Then we

More information

On a Laplacian which acts on symmetric tensors

On a Laplacian which acts on symmetric tensors On a Lalacan whch acts on metrc tensors keš J. Deartment of Algebra and Geometry, Palacky Unversty, 7746 Olomouc, Lstoadu, Czech Reublc e-mal: osef.mkes@uol.cz Steanov S. E., Tsyganok I.I. Deartment of

More information

The Expectation-Maximization Algorithm

The Expectation-Maximization Algorithm The Expectaton-Maxmaton Algorthm Charles Elan elan@cs.ucsd.edu November 16, 2007 Ths chapter explans the EM algorthm at multple levels of generalty. Secton 1 gves the standard hgh-level verson of the algorthm.

More information

6. Hamilton s Equations

6. Hamilton s Equations 6. Hamlton s Equatons Mchael Fowler A Dynamcal System s Path n Confguraton Sace and n State Sace The story so far: For a mechancal system wth n degrees of freedom, the satal confguraton at some nstant

More information

U.C. Berkeley CS294: Beyond Worst-Case Analysis Luca Trevisan September 5, 2017

U.C. Berkeley CS294: Beyond Worst-Case Analysis Luca Trevisan September 5, 2017 U.C. Berkeley CS94: Beyond Worst-Case Analyss Handout 4s Luca Trevsan September 5, 07 Summary of Lecture 4 In whch we ntroduce semdefnte programmng and apply t to Max Cut. Semdefnte Programmng Recall that

More information

BOUNDEDNESS OF THE RIESZ TRANSFORM WITH MATRIX A 2 WEIGHTS

BOUNDEDNESS OF THE RIESZ TRANSFORM WITH MATRIX A 2 WEIGHTS BOUNDEDNESS OF THE IESZ TANSFOM WITH MATIX A WEIGHTS Introducton Let L = L ( n, be the functon space wth norm (ˆ f L = f(x C dx d < For a d d matrx valued functon W : wth W (x postve sem-defnte for all

More information

The Dirac Equation for a One-electron atom. In this section we will derive the Dirac equation for a one-electron atom.

The Dirac Equation for a One-electron atom. In this section we will derive the Dirac equation for a one-electron atom. The Drac Equaton for a One-electron atom In ths secton we wll derve the Drac equaton for a one-electron atom. Accordng to Ensten the energy of a artcle wth rest mass m movng wth a velocty V s gven by E

More information

Solutions HW #2. minimize. Ax = b. Give the dual problem, and make the implicit equality constraints explicit. Solution.

Solutions HW #2. minimize. Ax = b. Give the dual problem, and make the implicit equality constraints explicit. Solution. Solutons HW #2 Dual of general LP. Fnd the dual functon of the LP mnmze subject to c T x Gx h Ax = b. Gve the dual problem, and make the mplct equalty constrants explct. Soluton. 1. The Lagrangan s L(x,

More information

NECESSARY AND SUFFICIENT CONDITIONS FOR ALMOST REGULARITY OF UNIFORM BIRKHOFF INTERPOLATION SCHEMES. by Nicolae Crainic

NECESSARY AND SUFFICIENT CONDITIONS FOR ALMOST REGULARITY OF UNIFORM BIRKHOFF INTERPOLATION SCHEMES. by Nicolae Crainic NECESSARY AND SUFFICIENT CONDITIONS FOR ALMOST REGULARITY OF UNIFORM BIRKHOFF INTERPOLATION SCHEMES by Ncolae Cranc Abstract: In ths artcle usng a combnaton of the necessary and suffcent condtons for the

More information

KNOTS AND THEIR CURVATURES

KNOTS AND THEIR CURVATURES KNOTS AND THEIR CURVATURES LIVIU I. NICOLAESCU ABSTRACT. I dscuss an old result of John Mlnor statng roughly that f a closed curve n sace s not too curved then t cannot be knotted. CONTENTS. The total

More information

Edge Isoperimetric Inequalities

Edge Isoperimetric Inequalities November 7, 2005 Ross M. Rchardson Edge Isopermetrc Inequaltes 1 Four Questons Recall that n the last lecture we looked at the problem of sopermetrc nequaltes n the hypercube, Q n. Our noton of boundary

More information

Lecture 12: Discrete Laplacian

Lecture 12: Discrete Laplacian Lecture 12: Dscrete Laplacan Scrbe: Tanye Lu Our goal s to come up wth a dscrete verson of Laplacan operator for trangulated surfaces, so that we can use t n practce to solve related problems We are mostly

More information

Algorithms for factoring

Algorithms for factoring CSA E0 235: Crytograhy Arl 9,2015 Instructor: Arta Patra Algorthms for factorng Submtted by: Jay Oza, Nranjan Sngh Introducton Factorsaton of large ntegers has been a wdely studed toc manly because of

More information

2.3 Nilpotent endomorphisms

2.3 Nilpotent endomorphisms s a block dagonal matrx, wth A Mat dm U (C) In fact, we can assume that B = B 1 B k, wth B an ordered bass of U, and that A = [f U ] B, where f U : U U s the restrcton of f to U 40 23 Nlpotent endomorphsms

More information

Maximizing the number of nonnegative subsets

Maximizing the number of nonnegative subsets Maxmzng the number of nonnegatve subsets Noga Alon Hao Huang December 1, 213 Abstract Gven a set of n real numbers, f the sum of elements of every subset of sze larger than k s negatve, what s the maxmum

More information

Taylor series coefficients of the HP-polynomial as an invariant for links in the solid torus

Taylor series coefficients of the HP-polynomial as an invariant for links in the solid torus Al. Math. Inf. c. 7, No. 1, 23-28 (213) 23 Aled Mathematcs & Informaton cences An Internatonal Journal c 213 NP Natural cences Publshng Cor. aylor seres coeffcents of the HP-olynomal as an nvarant for

More information

MATH 241B FUNCTIONAL ANALYSIS - NOTES EXAMPLES OF C ALGEBRAS

MATH 241B FUNCTIONAL ANALYSIS - NOTES EXAMPLES OF C ALGEBRAS MATH 241B FUNCTIONAL ANALYSIS - NOTES EXAMPLES OF C ALGEBRAS These are nformal notes whch cover some of the materal whch s not n the course book. The man purpose s to gve a number of nontrval examples

More information

Affine transformations and convexity

Affine transformations and convexity Affne transformatons and convexty The purpose of ths document s to prove some basc propertes of affne transformatons nvolvng convex sets. Here are a few onlne references for background nformaton: http://math.ucr.edu/

More information

Appendix for Causal Interaction in Factorial Experiments: Application to Conjoint Analysis

Appendix for Causal Interaction in Factorial Experiments: Application to Conjoint Analysis A Appendx for Causal Interacton n Factoral Experments: Applcaton to Conjont Analyss Mathematcal Appendx: Proofs of Theorems A. Lemmas Below, we descrbe all the lemmas, whch are used to prove the man theorems

More information

Stochastic heat equation with white-noise drift

Stochastic heat equation with white-noise drift Stochastc heat equaton wth whte-nose drft by lsa Alos, Davd Nualart * Facultat de Matematques Unverstat de Barcelona Gran Va 585, 87 Barcelona, SPAIN Freder Vens Deartment of Mathematcs Unversty of North

More information

Lecture 10 Support Vector Machines II

Lecture 10 Support Vector Machines II Lecture 10 Support Vector Machnes II 22 February 2016 Taylor B. Arnold Yale Statstcs STAT 365/665 1/28 Notes: Problem 3 s posted and due ths upcomng Frday There was an early bug n the fake-test data; fxed

More information

The internal structure of natural numbers and one method for the definition of large prime numbers

The internal structure of natural numbers and one method for the definition of large prime numbers The nternal structure of natural numbers and one method for the defnton of large prme numbers Emmanul Manousos APM Insttute for the Advancement of Physcs and Mathematcs 3 Poulou str. 53 Athens Greece Abstract

More information

Some Notes on Consumer Theory

Some Notes on Consumer Theory Some Notes on Consumer Theory. Introducton In ths lecture we eamne the theory of dualty n the contet of consumer theory and ts use n the measurement of the benefts of rce and other changes. Dualty s not

More information

Randić Energy and Randić Estrada Index of a Graph

Randić Energy and Randić Estrada Index of a Graph EUROPEAN JOURNAL OF PURE AND APPLIED MATHEMATICS Vol. 5, No., 202, 88-96 ISSN 307-5543 www.ejpam.com SPECIAL ISSUE FOR THE INTERNATIONAL CONFERENCE ON APPLIED ANALYSIS AND ALGEBRA 29 JUNE -02JULY 20, ISTANBUL

More information

On New Selection Procedures for Unequal Probability Sampling

On New Selection Procedures for Unequal Probability Sampling Int. J. Oen Problems Comt. Math., Vol. 4, o. 1, March 011 ISS 1998-66; Coyrght ICSRS Publcaton, 011 www.-csrs.org On ew Selecton Procedures for Unequal Probablty Samlng Muhammad Qaser Shahbaz, Saman Shahbaz

More information

Some basic inequalities. Definition. Let V be a vector space over the complex numbers. An inner product is given by a function, V V C

Some basic inequalities. Definition. Let V be a vector space over the complex numbers. An inner product is given by a function, V V C Some basc nequaltes Defnton. Let V be a vector space over the complex numbers. An nner product s gven by a functon, V V C (x, y) x, y satsfyng the followng propertes (for all x V, y V and c C) (1) x +

More information

Learning Theory: Lecture Notes

Learning Theory: Lecture Notes Learnng Theory: Lecture Notes Lecturer: Kamalka Chaudhur Scrbe: Qush Wang October 27, 2012 1 The Agnostc PAC Model Recall that one of the constrants of the PAC model s that the data dstrbuton has to be

More information

Salmon: Lectures on partial differential equations. Consider the general linear, second-order PDE in the form. ,x 2

Salmon: Lectures on partial differential equations. Consider the general linear, second-order PDE in the form. ,x 2 Salmon: Lectures on partal dfferental equatons 5. Classfcaton of second-order equatons There are general methods for classfyng hgher-order partal dfferental equatons. One s very general (applyng even to

More information

Spectral Clustering based on the graph p-laplacian

Spectral Clustering based on the graph p-laplacian Sectral Clustering based on the grah -Lalacian Thomas Bühler tb@cs.uni-sb.de Matthias Hein hein@cs.uni-sb.de Saarland University Comuter Science Deartment Camus E 663 Saarbrücken Germany Abstract We resent

More information

Dynamic Systems on Graphs

Dynamic Systems on Graphs Prepared by F.L. Lews Updated: Saturday, February 06, 200 Dynamc Systems on Graphs Control Graphs and Consensus A network s a set of nodes that collaborates to acheve what each cannot acheve alone. A network,

More information

Power-sum problem, Bernoulli Numbers and Bernoulli Polynomials.

Power-sum problem, Bernoulli Numbers and Bernoulli Polynomials. Power-sum roblem, Bernoull Numbers and Bernoull Polynomals. Arady M. Alt Defnton 1 Power um Problem Fnd the sum n : 1... n where, n N or, usng sum notaton, n n n closed form. Recurrence for n Exercse Usng

More information

The Multiple Classical Linear Regression Model (CLRM): Specification and Assumptions. 1. Introduction

The Multiple Classical Linear Regression Model (CLRM): Specification and Assumptions. 1. Introduction ECONOMICS 5* -- NOTE (Summary) ECON 5* -- NOTE The Multple Classcal Lnear Regresson Model (CLRM): Specfcaton and Assumptons. Introducton CLRM stands for the Classcal Lnear Regresson Model. The CLRM s also

More information

princeton univ. F 17 cos 521: Advanced Algorithm Design Lecture 7: LP Duality Lecturer: Matt Weinberg

princeton univ. F 17 cos 521: Advanced Algorithm Design Lecture 7: LP Duality Lecturer: Matt Weinberg prnceton unv. F 17 cos 521: Advanced Algorthm Desgn Lecture 7: LP Dualty Lecturer: Matt Wenberg Scrbe: LP Dualty s an extremely useful tool for analyzng structural propertes of lnear programs. Whle there

More information

1 Convex Optimization

1 Convex Optimization Convex Optmzaton We wll consder convex optmzaton problems. Namely, mnmzaton problems where the objectve s convex (we assume no constrants for now). Such problems often arse n machne learnng. For example,

More information

Non-Ideality Through Fugacity and Activity

Non-Ideality Through Fugacity and Activity Non-Idealty Through Fugacty and Actvty S. Patel Deartment of Chemstry and Bochemstry, Unversty of Delaware, Newark, Delaware 19716, USA Corresondng author. E-mal: saatel@udel.edu 1 I. FUGACITY In ths dscusson,

More information

Submodular Maximization Over Multiple Matroids via Generalized Exchange Properties

Submodular Maximization Over Multiple Matroids via Generalized Exchange Properties Submodular Maxmzaton Over Multle Matrods va Generalzed Exchange Proertes Jon Lee Maxm Svrdenko Jan Vondrák June 25, 2009 Abstract Submodular-functon maxmzaton s a central roblem n combnatoral otmzaton,

More information

Lectures - Week 4 Matrix norms, Conditioning, Vector Spaces, Linear Independence, Spanning sets and Basis, Null space and Range of a Matrix

Lectures - Week 4 Matrix norms, Conditioning, Vector Spaces, Linear Independence, Spanning sets and Basis, Null space and Range of a Matrix Lectures - Week 4 Matrx norms, Condtonng, Vector Spaces, Lnear Independence, Spannng sets and Bass, Null space and Range of a Matrx Matrx Norms Now we turn to assocatng a number to each matrx. We could

More information

Lecture 10: May 6, 2013

Lecture 10: May 6, 2013 TTIC/CMSC 31150 Mathematcal Toolkt Sprng 013 Madhur Tulsan Lecture 10: May 6, 013 Scrbe: Wenje Luo In today s lecture, we manly talked about random walk on graphs and ntroduce the concept of graph expander,

More information

ECE559VV Project Report

ECE559VV Project Report ECE559VV Project Report (Supplementary Notes Loc Xuan Bu I. MAX SUM-RATE SCHEDULING: THE UPLINK CASE We have seen (n the presentaton that, for downlnk (broadcast channels, the strategy maxmzng the sum-rate

More information

arxiv: v1 [math.ca] 21 Nov 2012

arxiv: v1 [math.ca] 21 Nov 2012 SHARP WEIGHTED BOUNDS FOR MULTILINEAR MAXIMAL FUNCTIONS AND CALDERÓN-ZYGMUND OPERATORS arxv:2.55v [math.ca] 2 Nov 202 WENDOLÍN DAMIÁN, ANDREI K. LERNER, AND CARLOS PÉREZ Abstract. In ths aer we rove some

More information

College of Computer & Information Science Fall 2009 Northeastern University 20 October 2009

College of Computer & Information Science Fall 2009 Northeastern University 20 October 2009 College of Computer & Informaton Scence Fall 2009 Northeastern Unversty 20 October 2009 CS7880: Algorthmc Power Tools Scrbe: Jan Wen and Laura Poplawsk Lecture Outlne: Prmal-dual schema Network Desgn:

More information

Online Appendix. t=1 (p t w)q t. Then the first order condition shows that

Online Appendix. t=1 (p t w)q t. Then the first order condition shows that Artcle forthcomng to ; manuscrpt no (Please, provde the manuscrpt number!) 1 Onlne Appendx Appendx E: Proofs Proof of Proposton 1 Frst we derve the equlbrum when the manufacturer does not vertcally ntegrate

More information

COS 511: Theoretical Machine Learning. Lecturer: Rob Schapire Lecture # 15 Scribe: Jieming Mao April 1, 2013

COS 511: Theoretical Machine Learning. Lecturer: Rob Schapire Lecture # 15 Scribe: Jieming Mao April 1, 2013 COS 511: heoretcal Machne Learnng Lecturer: Rob Schapre Lecture # 15 Scrbe: Jemng Mao Aprl 1, 013 1 Bref revew 1.1 Learnng wth expert advce Last tme, we started to talk about learnng wth expert advce.

More information

TRACES AND SOBOLEV EXTENSION DOMAINS

TRACES AND SOBOLEV EXTENSION DOMAINS PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 134, Number 8, Pages 2373 2382 S 0002-9939(06)08228-1 Artcle electroncally ublshed on February 8, 2006 TRACES AND SOBOLEV EXTENSION DOMAINS PETTERI

More information

Supplement to Clustering with Statistical Error Control

Supplement to Clustering with Statistical Error Control Supplement to Clusterng wth Statstcal Error Control Mchael Vogt Unversty of Bonn Matthas Schmd Unversty of Bonn In ths supplement, we provde the proofs that are omtted n the paper. In partcular, we derve

More information

The Matrix Analogs of Firey s Extension of Minkowski Inequality and of Firey s Extension of Brunn-Minkowski Inequality

The Matrix Analogs of Firey s Extension of Minkowski Inequality and of Firey s Extension of Brunn-Minkowski Inequality Proceedngs of the 9th WSEAS Internatonal Conference on Aled Mathematcs, Istanbul, Turkey, May 27-29, 2006 (489-494) The Matrx Analogs of Frey s Extenson of Mnkowsk Inequalty and of Frey s Extenson of Brunn-Mnkowsk

More information

THE WEIGHTED WEAK TYPE INEQUALITY FOR THE STRONG MAXIMAL FUNCTION

THE WEIGHTED WEAK TYPE INEQUALITY FOR THE STRONG MAXIMAL FUNCTION THE WEIGHTED WEAK TYPE INEQUALITY FO THE STONG MAXIMAL FUNCTION THEMIS MITSIS Abstract. We prove the natural Fefferman-Sten weak type nequalty for the strong maxmal functon n the plane, under the assumpton

More information

n ). This is tight for all admissible values of t, k and n. k t + + n t

n ). This is tight for all admissible values of t, k and n. k t + + n t MAXIMIZING THE NUMBER OF NONNEGATIVE SUBSETS NOGA ALON, HAROUT AYDINIAN, AND HAO HUANG Abstract. Gven a set of n real numbers, f the sum of elements of every subset of sze larger than k s negatve, what

More information

The lower and upper bounds on Perron root of nonnegative irreducible matrices

The lower and upper bounds on Perron root of nonnegative irreducible matrices Journal of Computatonal Appled Mathematcs 217 (2008) 259 267 wwwelsevercom/locate/cam The lower upper bounds on Perron root of nonnegatve rreducble matrces Guang-Xn Huang a,, Feng Yn b,keguo a a College

More information

Mixture of Gaussians Expectation Maximization (EM) Part 2

Mixture of Gaussians Expectation Maximization (EM) Part 2 Mture of Gaussans Eectaton Mamaton EM Part 2 Most of the sldes are due to Chrstoher Bsho BCS Summer School Eeter 2003. The rest of the sldes are based on lecture notes by A. Ng Lmtatons of K-means Hard

More information

PHYS 705: Classical Mechanics. Calculus of Variations II

PHYS 705: Classical Mechanics. Calculus of Variations II 1 PHYS 705: Classcal Mechancs Calculus of Varatons II 2 Calculus of Varatons: Generalzaton (no constrant yet) Suppose now that F depends on several dependent varables : We need to fnd such that has a statonary

More information

Errors for Linear Systems

Errors for Linear Systems Errors for Lnear Systems When we solve a lnear system Ax b we often do not know A and b exactly, but have only approxmatons  and ˆb avalable. Then the best thng we can do s to solve ˆx ˆb exactly whch

More information

Linear convergence of an algorithm for computing the largest eigenvalue of a nonnegative tensor

Linear convergence of an algorithm for computing the largest eigenvalue of a nonnegative tensor NUMERICAL LINEAR ALGEBRA WITH APPLICATIONS Numer Lnear Algebra Al 22; 9:83 84 Publshed onlne 8 October 2 n Wley Onlne Lbrary (wleyonlnelbrarycom) OI: 2/nla822 Lnear convergence of an algorthm for comutng

More information

Lecture 9: Converse of Shannon s Capacity Theorem

Lecture 9: Converse of Shannon s Capacity Theorem Error Correctng Codes: Combnatorcs, Algorthms and Alcatons (Fall 2007) Lecture 9: Converse of Shannon s Caacty Theorem Setember 17, 2007 Lecturer: Atr Rudra Scrbe: Thanh-Nhan Nguyen & Atr Rudra In the

More information

Chapter Newton s Method

Chapter Newton s Method Chapter 9. Newton s Method After readng ths chapter, you should be able to:. Understand how Newton s method s dfferent from the Golden Secton Search method. Understand how Newton s method works 3. Solve

More information

Matching Dyadic Distributions to Channels

Matching Dyadic Distributions to Channels Matchng Dyadc Dstrbutons to Channels G. Böcherer and R. Mathar Insttute for Theoretcal Informaton Technology RWTH Aachen Unversty, 5256 Aachen, Germany Emal: {boecherer,mathar}@t.rwth-aachen.de Abstract

More information

Problem Set 9 Solutions

Problem Set 9 Solutions Desgn and Analyss of Algorthms May 4, 2015 Massachusetts Insttute of Technology 6.046J/18.410J Profs. Erk Demane, Srn Devadas, and Nancy Lynch Problem Set 9 Solutons Problem Set 9 Solutons Ths problem

More information

Physics 5153 Classical Mechanics. D Alembert s Principle and The Lagrangian-1

Physics 5153 Classical Mechanics. D Alembert s Principle and The Lagrangian-1 P. Guterrez Physcs 5153 Classcal Mechancs D Alembert s Prncple and The Lagrangan 1 Introducton The prncple of vrtual work provdes a method of solvng problems of statc equlbrum wthout havng to consder the

More information

Derivatives of Value at Risk and Expected Shortfall

Derivatives of Value at Risk and Expected Shortfall Dervatves of Value at Rsk and Exected Shortfall November 2003 Hans Rau-Bredow hans.rau-bredow@mal.un-wuerzburg.de Dr. Hans Rau-Bredow Unversty of Cologne; Unversty of Würzburg Leo Wesmantel Str. 4 D-97074

More information

3.1 Expectation of Functions of Several Random Variables. )' be a k-dimensional discrete or continuous random vector, with joint PMF p (, E X E X1 E X

3.1 Expectation of Functions of Several Random Variables. )' be a k-dimensional discrete or continuous random vector, with joint PMF p (, E X E X1 E X Statstcs 1: Probablty Theory II 37 3 EPECTATION OF SEVERAL RANDOM VARIABLES As n Probablty Theory I, the nterest n most stuatons les not on the actual dstrbuton of a random vector, but rather on a number

More information

Affine and Riemannian Connections

Affine and Riemannian Connections Affne and Remannan Connectons Semnar Remannan Geometry Summer Term 2015 Prof Dr Anna Wenhard and Dr Gye-Seon Lee Jakob Ullmann Notaton: X(M) space of smooth vector felds on M D(M) space of smooth functons

More information

8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS

8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS SECTION 8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS 493 8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS All the vector spaces you have studed thus far n the text are real vector spaces because the scalars

More information

Composite Hypotheses testing

Composite Hypotheses testing Composte ypotheses testng In many hypothess testng problems there are many possble dstrbutons that can occur under each of the hypotheses. The output of the source s a set of parameters (ponts n a parameter

More information

LECTURE 5: FIBRATIONS AND HOMOTOPY FIBERS

LECTURE 5: FIBRATIONS AND HOMOTOPY FIBERS LECTURE 5: FIBRATIONS AND HOMOTOPY FIBERS In ts lecture we wll ntroduce two mortant classes of mas of saces, namely te Hurewcz fbratons and te more general Serre fbratons, wc are bot obtaned by mosng certan

More information

STEINHAUS PROPERTY IN BANACH LATTICES

STEINHAUS PROPERTY IN BANACH LATTICES DEPARTMENT OF MATHEMATICS TECHNICAL REPORT STEINHAUS PROPERTY IN BANACH LATTICES DAMIAN KUBIAK AND DAVID TIDWELL SPRING 2015 No. 2015-1 TENNESSEE TECHNOLOGICAL UNIVERSITY Cookevlle, TN 38505 STEINHAUS

More information

Lecture 20: Lift and Project, SDP Duality. Today we will study the Lift and Project method. Then we will prove the SDP duality theorem.

Lecture 20: Lift and Project, SDP Duality. Today we will study the Lift and Project method. Then we will prove the SDP duality theorem. prnceton u. sp 02 cos 598B: algorthms and complexty Lecture 20: Lft and Project, SDP Dualty Lecturer: Sanjeev Arora Scrbe:Yury Makarychev Today we wll study the Lft and Project method. Then we wll prove

More information

Generalized Linear Methods

Generalized Linear Methods Generalzed Lnear Methods 1 Introducton In the Ensemble Methods the general dea s that usng a combnaton of several weak learner one could make a better learner. More formally, assume that we have a set

More information

Assortment Optimization under MNL

Assortment Optimization under MNL Assortment Optmzaton under MNL Haotan Song Aprl 30, 2017 1 Introducton The assortment optmzaton problem ams to fnd the revenue-maxmzng assortment of products to offer when the prces of products are fxed.

More information

Ballot Paths Avoiding Depth Zero Patterns

Ballot Paths Avoiding Depth Zero Patterns Ballot Paths Avodng Depth Zero Patterns Henrch Nederhausen and Shaun Sullvan Florda Atlantc Unversty, Boca Raton, Florda nederha@fauedu, ssull21@fauedu 1 Introducton In a paper by Sapounaks, Tasoulas,

More information

Malaya J. Mat. 2(1)(2014) 49 60

Malaya J. Mat. 2(1)(2014) 49 60 Malaya J. Mat. 2(1)(2014) 49 60 Functonal equaton orgnatng from sum of hgher owers of arthmetc rogresson usng dfference oerator s stable n Banach sace: drect and fxed ont methods M. Arunumar a, and G.

More information

The Second Anti-Mathima on Game Theory

The Second Anti-Mathima on Game Theory The Second Ant-Mathma on Game Theory Ath. Kehagas December 1 2006 1 Introducton In ths note we wll examne the noton of game equlbrum for three types of games 1. 2-player 2-acton zero-sum games 2. 2-player

More information

Graph Reconstruction by Permutations

Graph Reconstruction by Permutations Graph Reconstructon by Permutatons Perre Ille and Wllam Kocay* Insttut de Mathémathques de Lumny CNRS UMR 6206 163 avenue de Lumny, Case 907 13288 Marselle Cedex 9, France e-mal: lle@ml.unv-mrs.fr Computer

More information

Remarks on the Properties of a Quasi-Fibonacci-like Polynomial Sequence

Remarks on the Properties of a Quasi-Fibonacci-like Polynomial Sequence Remarks on the Propertes of a Quas-Fbonacc-lke Polynomal Sequence Brce Merwne LIU Brooklyn Ilan Wenschelbaum Wesleyan Unversty Abstract Consder the Quas-Fbonacc-lke Polynomal Sequence gven by F 0 = 1,

More information

GEOMETRIC INTERPRETATIONS OF CURVATURE. Contents 1. Notation and Summation Conventions 1

GEOMETRIC INTERPRETATIONS OF CURVATURE. Contents 1. Notation and Summation Conventions 1 GEOMETRIC INTERPRETATIONS OF CURVATURE ZHENGQU WAN Abstract. Ths s an exostory aer on geometrc meanng of varous knds of curvature on a Remann manfold. Contents 1. Notaton and Summaton Conventons 1 2. Affne

More information

VARIATION OF CONSTANT SUM CONSTRAINT FOR INTEGER MODEL WITH NON UNIFORM VARIABLES

VARIATION OF CONSTANT SUM CONSTRAINT FOR INTEGER MODEL WITH NON UNIFORM VARIABLES VARIATION OF CONSTANT SUM CONSTRAINT FOR INTEGER MODEL WITH NON UNIFORM VARIABLES BÂRZĂ, Slvu Faculty of Mathematcs-Informatcs Spru Haret Unversty barza_slvu@yahoo.com Abstract Ths paper wants to contnue

More information

1 Bref Introducton Ths memo reorts artal results regardng the task of testng whether a gven bounded-degree grah s an exander. The model s of testng gr

1 Bref Introducton Ths memo reorts artal results regardng the task of testng whether a gven bounded-degree grah s an exander. The model s of testng gr On Testng Exanson n Bounded-Degree Grahs Oded Goldrech Det. of Comuter Scence Wezmann Insttute of Scence Rehovot, Israel oded@wsdom.wezmann.ac.l Dana Ron Det. of EE { Systems Tel Avv Unversty Ramat Avv,

More information

Solutions for Tutorial 1

Solutions for Tutorial 1 Toc 1: Sem-drect roducts Solutons for Tutoral 1 1. Show that the tetrahedral grou s somorhc to the sem-drect roduct of the Klen four grou and a cyclc grou of order three: T = K 4 (Z/3Z). 2. Show further

More information

More metrics on cartesian products

More metrics on cartesian products More metrcs on cartesan products If (X, d ) are metrc spaces for 1 n, then n Secton II4 of the lecture notes we defned three metrcs on X whose underlyng topologes are the product topology The purpose of

More information

Some congruences related to harmonic numbers and the terms of the second order sequences

Some congruences related to harmonic numbers and the terms of the second order sequences Mathematca Moravca Vol. 0: 06, 3 37 Some congruences related to harmonc numbers the terms of the second order sequences Neşe Ömür Sbel Koaral Abstract. In ths aer, wth hels of some combnatoral denttes,

More information

APPROXIMATE PRICES OF BASKET AND ASIAN OPTIONS DUPONT OLIVIER. Premia 14

APPROXIMATE PRICES OF BASKET AND ASIAN OPTIONS DUPONT OLIVIER. Premia 14 APPROXIMAE PRICES OF BASKE AND ASIAN OPIONS DUPON OLIVIER Prema 14 Contents Introducton 1 1. Framewor 1 1.1. Baset optons 1.. Asan optons. Computng the prce 3. Lower bound 3.1. Closed formula for the prce

More information

For now, let us focus on a specific model of neurons. These are simplified from reality but can achieve remarkable results.

For now, let us focus on a specific model of neurons. These are simplified from reality but can achieve remarkable results. Neural Networks : Dervaton compled by Alvn Wan from Professor Jtendra Malk s lecture Ths type of computaton s called deep learnng and s the most popular method for many problems, such as computer vson

More information

Some Comments on Accelerating Convergence of Iterative Sequences Using Direct Inversion of the Iterative Subspace (DIIS)

Some Comments on Accelerating Convergence of Iterative Sequences Using Direct Inversion of the Iterative Subspace (DIIS) Some Comments on Acceleratng Convergence of Iteratve Sequences Usng Drect Inverson of the Iteratve Subspace (DIIS) C. Davd Sherrll School of Chemstry and Bochemstry Georga Insttute of Technology May 1998

More information