Eigenvalues of graphs are useful for controlling many graph


 Claude Gaines
 2 years ago
 Views:
Transcription
1 Spectra of radom graphs with give expected degrees Fa Chug, Liyua Lu, ad Va Vu Departmet of Mathematics, Uiversity of Califoria at Sa Diego, La Jolla, CA Edited by Richard V. Kadiso, Uiversity of Pesylvaia, Philadelphia, PA, ad approved February 20, 2003 (received for review December 9, 2002) I the study of the spectra of powerlaw graphs, there are basically two competig approaches. Oe is to prove aalogues of Wiger s semicircle law, whereas the other predicts that the eigevalues follow a powerlaw distributio. Although the semicircle law ad the power law have othig i commo, we will show that both approaches are essetially correct if oe cosiders the appropriate matrices. We will prove that (uder certai mild coditios) the eigevalues of the (ormalized) Laplacia of a radom powerlaw graph follow the semicircle law, whereas the spectrum of the adjacecy matrix of a powerlaw graph obeys the power law. Our results are based o the aalysis of radom graphs with give expected degrees ad their relatios to several ey ivariats. Of iterest are a umber of (ew) values for the expoet, where phase trasitios for eigevalue distributios occur. The spectrum distributios have direct implicatios to umerous graph algorithms such as, for example, radomized algorithms that ivolve rapidly mixig Marov chais. Eigevalues of graphs are useful for cotrollig may graph properties ad cosequetly have umerous algorithmic applicatios icludig low ra approximatios, iformatio retrieval (), ad computer visio. Of particular iterest is the study of eigevalues for graphs with powerlaw degree distributios (i.e., the umber of vertices of degree j is proportioal to j for some expoet ). It has bee observed by may research groups (2 8, ) that may realistic massive graphs icludig Iteret graphs, telephoecall graphs, ad various social ad biological etwors have powerlaw degree distributios. For the classical radom graphs based o the Erdös Réyi model, it has bee proved by Füredi ad Komlós that the spectrum of the adjacecy matrix follows the Wiger semicircle law (9). Wiger s theorem (0) ad its extesios have log bee used for the stochastic treatmet of complex quatum systems that lie beyod the reach of exact methods. The semicircle law has extesive applicatios i statistical ad solidstate physics (2, 22). I the 999 article by Faloutsos et al. (6) o Iteret topology, several powerlaw examples of Iteret topology are give, ad the eigevalues of the adjacecy matrices are plotted, which do ot follow the semicircle law. It is cojectured that the eigevalues of the adjacecy matrices have a powerlaw distributio with its ow expoet differet from the expoet of the graph. Faras et al. () looed beyod the semicircle law ad described a triagularlie shape distributio (see ref. 2). Recetly, M. Mihail ad C. H. Papadimitriou (upublished wor) showed that the eigevalues of the adjacecy matrix of powerlaw graphs with expoet are distributed accordig to a power law for 3. Here we ited to recocile these two schools of thought o eigevalue distributios. To begi with, there are i fact several ways to associate a matrix to a graph. The usual adjacecy matrix A associated with a (simple) graph has eigevalues quite sesitive to the maximum degree (which is a local property). The combiatorial Laplacia D A, with D deotig the diagoal degree matrix, is a major tool for eumeratig spaig trees ad has umerous applicatios (3, 4). Aother matrix associated with a graph is the (ormalized) Laplacia L I D /2 AD /2, which cotrols the expasioisoperimetrical properties (which are global) ad essetially determies the mixig rate of a radom wal o the graph. The traditioal radom matrices ad radom graphs are regular or almost regular, thus the spectra of all the above three matrices are basically the same (with possibly a scalig factor or a liear shift). However, for graphs with ueve degrees, the above three matrices ca have very differet distributios. I this article, we will cosider radom graphs with a geeral give expected degree distributio, ad we examie the spectra for both the adjacecy matrix ad the Laplacia. We first will establish bouds for eigevalues for graphs with a geeral degree distributio from which the results o radom powerlaw graphs the follow. The followig is a summary of our results.. The largest eigevalue of the adjacecy matrix of a radom graph with a give expected degree sequece is determied by m, the maximum degree, ad d, the weighted average of the squares of the expected degrees. We show that the largest eigevalue of the adjacecy matrix is almost surely ( o())max{d, m} provided some mior coditios are satisfied. I additio, suppose that the th largest expected degree m is sigificatly d 2. The the th largest eigevalue of the adjacecy matrix is almost surely ( o())m. 2. For a radom powerlaw graph with expoet 2.5, the largest eigevalue of a radom powerlaw graph is almost surely [ o()]m, where m is the maximum degree. Moreover, the largest eigevalues of a radom powerlaw graph with expoet have a powerlaw distributio with expoet 2 if the maximum degree is sufficietly large ad is bouded above by a fuctio depedig o, m, ad d, the average degree. Whe 2 2.5, the largest eigevalue is heavily cocetrated at cm 3 for some costat c depedig o ad the average degree. 3. We will show that the eigevalues of the Laplacia satisfy the semicircle law uder the coditio that the miimum expected degree is relatively large ( the square root of the expected average degree). This coditio cotais the basic case whe all degrees are equal (the Erdös Réyi model). If we weae the coditio o the miimum expected degree, we ca still have the followig strog boud for the eigevalues of the Laplacia, which implies strog expasio rates for rapidly mixig, 4 max i o i 0 w glog2, This paper was submitted directly (Trac II) to the PNAS office. To whom correspodece should be addressed. Achlioptas, D. & McSherry, F., ThirtyThird Aual ACM Symposium o Theory of Computig, July 6 8, 200, Crete, Greece. Fowles, C., Belogie, S., Chug, F. & Mali, J., Europea Coferece o Computer Visio, May 27 Jue 2, 2002, Copehage. Lu, L., Twelfth Aual ACMSIAM Symposium o Discrete Algorithms, Jauary 7 9, 200, Washigto, DC. MATHEMATICS PNAS May 27, 2003 vol. 00 o
2 where w is the expected average degree, is the miimum expected degree, ad g() is ay slowgrowig fuctio of. I applicatios, it usually suffices to have the i values (i 0) bouded away from 0. Our result shows that (uder some mild coditios) these eigevalues are actually very close to. The rest of the article has two parts. I the first part we preset our model ad the results cocerig the spectrum of the adjacecy matrix. The last part deals with the Laplacia. The Radom Graph Model The primary model for classical radom graphs is the Erdos Réyi model G p, i which each edge is idepedetly chose with the probability P for some give P 0 (see ref. 5). I such radom graphs the degrees (the umber of eighbors) of vertices all have the same expected value. Here we cosider the followig exteded radomgraph model for a geeral degree distributio (also see refs. 6 ad 7). For a sequece w (w, w 2,...,w ), we cosider radom graphs G(w) i which edges are idepedetly assiged to each pair of vertices (i, j) with probability w i w j, where w i. i Notice that we allow loops i our model (for computatioal coveiece), but their presece does ot play ay essetial role. It is easy to verify that the expected degree of i is w i. To this ed, we assume that max i w 2 i w such that p ij for all i ad j. This assumptio isures that the sequece w i is graphical [i the sese that it satisfies the ecessary ad sufficiet coditio for a sequece to be realized by a graph (8) except that we do ot require the w i values to be itegers]. We will use d i to deote the actual degree of v i i a radom graph G i G(w), where the weight w i deotes the expected degree. For a subset S of vertices, the volume Vol(S) is defied as the sum of weights i S ad vol(s) is the sum of the (actual) degrees of vertices i S. That is, Vol(S) is w i ad vol(s) is d i. I particular, we have Vol(G) i w i, ad we deote Vol(G). The iduced subgraph o S is a radom graph G(w), where the weight sequece is give by w i w i Vol(S) for all i S. The expected average degree is w i w i (). The secodorder average degree of G(w) is d ( is w 2 i i w i ) is w 2 i. The maximum expected degree is deoted by m. The classical radom graph G(, p) ca be viewed as a special case of G(w) by taig w to be (p, p,...,p). I this special case, we have d w m p. It is well ow that the largest eigevalue of the adjacecy matrix of G(, p) is almost surely [ o()]p provided that p log. The asymptotic otatio is used uder the assumptio that, the umber of vertices, teds to ifiity. All logarithms have the atural base. Spectra of the Adjacecy Matrix of Radom Graphs with Give Degree Distributio For radom graphs with give expected degrees (w, w 2,..., w ), there are two easy lower bouds for the largest eigevalue A of the adjacecy matrix A, amely, [ o()]d ad [ o()]m. It has bee prove that the maximum of the above two lower bouds is essetially a upper boud (also see ref. 9). Chug, F., Lu, L. & Vu, V., Worshop o Algorithms ad Models for the WebGraph, November 6, 2002, Vacouver, BC, Caada. Theorem. If d m log, the the largest eigevalue of a radom graph i G(w) is almost surely [ o()]d. Theorem 2. If m d log 2, the almost surely the largest eigevalue of a radom graph i G(w) is [ o()]m. If the th largest expected degree m satisfies m d log 2, the almost surely the largest eigevalues of a radom graph i G(w) is [ o()]m. Theorem 3. The largest eigevalue of a radom graph i G(w) is almost surely at most 7log maxm, d. We remar that the largest eigevalue A of the adjacecy matrix of a radom graph is almost surely [ o()]m if m is d by a factor of log 2, ad A is almost surely [ o()]d if m is d by a factor of log. I other words, A is (asymptotically) the maximum of m ad d if the two values of m ad d are far apart (by a power of log ). Oe might be tempted to cojecture that A omaxm, d. This, however, is ot true as show by a couterexample give previously (0). We also ote that with a more careful aalysis the factor of log i Theorem 3 ca be replaced by (log()) /2 ad the factor of log 2 ca be replaced by (log()) 3/2 for ay positive provided that is sufficietly large. We remar that the costat 7 i Theorem 3 ca be improved. We made o effort to get the best costat coefficiet here. Eigevalues of the Adjacecy Matrix of PowerLaw Graphs I this sectio we cosider radom graphs with powerlaw degree distributio with expoet. We wat to show that the largest eigevalue of the adjacecy matrix of a radom powerlaw graph is almost surely approximately the square root of the maximum degree m if 2.5 ad is almost surely approximately cm 3 if A phase trasitio occurs at 2.5. This result for powerlaw graphs is a immediate cosequece of a geeral result for eigevalues of radom graphs with arbitrary degree sequeces. We choose the degree sequece w (w, w 2,..., w ) satisfyig w i ci /() for i 0 i i 0. Here c is determied by the average degree, ad i 0 depeds o the maximum degree m, amely, c 2 d/(), d 2 i 0. m It is easy to verify that the umber of vertices of degree is proportioal to. The secodorder average degree d ca be computed as follows. 2 2 o if 3. 3 d d 2 d l2m o if 3. d m d o if 2 3. d Chug et al.
3 We remar that for 3, the secodorder average degree is idepedet of the maximum degree. Cosequetly, the powerlaw graphs with 3 are much easier to deal with. However, may massive graphs are powerlaw graphs with 2 3, i particular, Iteret graphs (9) have expoets betwee 2. ad 2.4, whereas the Hollywood graph (6) has expoet 2.3. I these cases, it is d that determies the first eigevalue. Theorem 4 is a cosequece of Theorems ad 2. Whe 2.5, the ith largest eigevalue i is i m i i i 0 /[(2)], for i sufficietly large. These large eigevalues follow the powerlaw distributio with expoet 2. (The expoet is differet from oe i Mihail ad Papadimitriou s upublished wor, because they use a differet defiitio for power law.) Theorem 4.. For 3 ad m d 2 log 3, almost surely the largest eigevalue of the radom powerlaw graph G is [ o()]m. 2. For ad m d (2)/(2.5) log 3/(2.5), almost surely the largest eigevalue of the radom powerlaw graph G is [ o()]m. 3. For ad m log 3/2.5, almost surely the largest eigevalue is [ o()]d. 4. For (dm log ) ad 2.5, almost surely the largest eigevalues of the radom powerlaw graph G with expoet have powerlaw distributios with expoet 2, provided that m is large eough (satisfyig the iequalities i ad 2). Spectrum of the Laplacia Suppose G is a graph that does ot cotai ay isolated vertices. The Laplacia L is defied to be the matrix L I D /2 AD /2, where I is the idetity matrix, A is the adjacecy matrix of G, ad D deotes the diagoal degree matrix. The eigevalues of L are all oegative betwee 0 ad 2 (see ref. 20). We deote the eigevalues of L by For each i, let i deote a orthoormal eigevector associated with i. We ca write L as L i i P i, where P i deotes the i projectio ito the eigespace associated with eigevalue i. We cosider M I L P 0 ( i )P i. i0 For ay positive iteger, we have TraceM 2 ( i ) 2. i0 Lemma. For ay positive iteger, we have max i M TraceM 2 /2. i 0 The matrix M ca be writte as M D /2 AD /2 P 0 D /2 AD /2 * 0 0 D /2 AD /2 volg D/2 KD /2, where 0 is regarded as a row vector (d vol(g),..., d vol(g)), * 0 is the traspose of 0, ad K is the all s matrix. Let W deote the diagoal matrix with the (i, i) etry havig value w i, the expected degree of the ith vertex. We will approximate M by C W /2 AW /2 VolG W/2 KW /2 W /2 AW /2 *, where is a row vector (w,...,w ). We ote that * * is strogly cocetrated at 0 for radom graphs with give expected degree w i. C ca be see as the expectatio of M, ad we shall cosider the spectrum of C carefully. A Sharp Boud for Radom Graphs with Relatively Large Miimum Expected Degree I this sectio we cosider the case whe the miimum of the expected degrees is ot too small compared to the mea. I this case, we are able to prove a sharp boud o the largest eigevalue of C. Theorem 5. For a radom graph with give expected degrees w,..., w where w log 3, we have almost surely C o 2 w. Proof: We rely o the Wiger highmomet method. For ay positive iteger ad ay symmetric matrix C which implies TraceC 2 C 2 C 2, E C 2 ETraceC 2, where is the eigevalue with maximum absolute value: C. If we ca boud E(Trace(C 2 )) from above, the we have a upper boud for E( (C) 2 ). The latter would imply a upper boud (almost surely) o (C) via Marov s iequality provided that is sufficietly large. Let us ow tae a closer loo at Trace(C 2 ). This is a sum where a typical term is c i i 2 c i2 i 3,...,c i2 i 2 c i2 i. I other words, each term correspods to a closed wal of legth 2 (cotaiig 2, ot ecessarily differet, edges) of the complete graph K o {,..., } (K has a loop at every vertex). O the other had, the etries c ij of C are idepedet radom variables with mea zero. Thus, the expectatio of a term is ozero if ad oly if each edge of K appears i the wal at least twice. To this ed, we call such a wal a good wal. Cosider a closed good wal that uses l differet edges e,...,e l with correspodig multiplicities m,..., m l (the m h values are positive itegers at least 2 summig up to 2). The (expected) cotributio of the term defied by this wal i E(Trace(C 2 )) is l m Ec h eh. [] h I order to compute E(c ij m ), let us first describe the distributio of c ij : c ij w i w j w i wj q ij w i w j with probability p ij w i w j ad c ij w i w j p ij w i w j with probability q ij p ij. This implies that for ay m 2, MATHEMATICS Chug et al. PNAS May 27, 2003 vol. 00 o. 635
4 Ec m ij q ij m p ij p ij m q ij w i w j m/2 p ij w i w j m/2 w i w j m/2 m2. [2] Here we used the fact that q m ij p ij (p ij ) m q ij p ij i the first iequality (the reader ca cosider this fact a easy exercise) ad the defiitio p ij w i w j i the secod equality. Let W l, deote the set of closed good wals o K of legth 2 usig exactly l differet vertices. Notice that each wal i W l, must have at least l differet edges. By Eqs. ad 2, the cotributio of a term correspodig to such a wal toward E(Trace(C 2 )) is at most l w 22l mi. It follows that ETraceC 2 W l, l0 22l. [3] I order to boud the last sum, we eed the followig result of Füredi ad Komlós (9). Lemma 2. For all l, W l,... l 2l 2 2l l l l 4l. I order to prove Theorem 5, it is more coveiet to use the followig cleaer boud, which is a direct corollary of Eq W l, l 4l 2ll 4l [5] Substitutig Eq. 5 ito 3 yields l 2 22l l 4l ETraceC 2 l0 2ll 4l l0 s l,. [4] [6] Now fix g()log, where g() teds to ifiity (with ) arbitrarily slowly. With this ad the assumptio about the degree sequece, the last sum i Eq. 6 is domiated by its highest term. To see this, let us cosider the ratio s, s l, for some l : s, 4 s l, 2 2ll 4l 2 l 4w 2 mi l 2 2l 4l 2 4w 2 mi 6 where i the first iequality we used the simple fact that 2l 2 22l 2 l! 22l. l, ETraceC 2 s l, os, l 0 o 4 o4. Because E( (C) 2 ) E(Trace(C 2 )) ad w, we have E C 2 o w 2 2. [7] By Eq. 7 ad Marov s equality P C w 2 2 P C 2 w 2 2 E C 2 2 w 2 2 o w w 2 2 o 2. Because (log ), we ca fid a () tedig to 0 with such that ( ) 2 o(), which implies that almost surely (C) [ o()](2w ) as desired. The lower boud o (C) follows from the semicircle law proved i the ext sectio. The Semicircle Law We show that if the miimum expected degree is relatively large, the the eigevalues of C satisfy the semicircle law with respect to the circle of radius r 2w cetered at 0. Let W be a absolute cotiuous distributio fuctio with (semicircle) desity w(x) (2) x 2 for x ad w(x) 0 for x. For the purpose of ormalizatio, cosider C or (2w ) C. Let N(x) be the umber of eigevalues of C or x ad W (x) N(x). Theorem 6. For radom graphs with a degree sequece satisfyig w, W (x) teds to W(x) i probability as teds to ifiity. Remar: The assumptio here is weaer tha that of Theorem 5 due to the fact that we oly eed to cosider momets of costat order. Proof: Because covergece i probability is etailed by the covergece of momets, to prove this Theorem 6 we eed to show that for ay fixed s, the sth momet of W (x) (with tedig to ifiity) is asymptotically the sth momet of s W(x). The sth momet of W (x) equals ()E(Trace(C or )). For s eve, s 2, the sth momet of W x is (2)!2 2!( )! (see ref. 0). For s odd, the sth momet of W x is 0 by symmetry. I order to verify Theorem 6, we eed to show that for ay fixed ETraceC or 2 o 2! 2 2!! [8] With a proper choice of g(), the assumptio (log 3 2 )w guaratees that (4 6 ) (), where () teds to ifiity with, which implies s, s l, [()] l. Cosequetly, ad ETraceC or 2 )) o. [9] 636 Chug et al.
5 Fig.. The large eigevalues of the adjacecy matrix follow the power law. Fig. 2. The Laplacia spectrum follows the semicircle law. We first cosider Eq. 8. Let us go bac to Eq. 3. Now we eed to use the more accurate estimate of W l, give by Eq. 4 istead of the weaer but cleaer oe i Eq. 5. Defie s l, l 22l... l 2 2l l 2l l l 4l. Oe ca chec, with a more tedious computatio, that the sum s l, l0 is still domiated by the last term, amely s l, os,. l0 It follows that E(Trace(C 2 )) [ o()]s,. O the other had, E(Trace(C 2 )) W,. Now comes the importat poit, for l, W l, is ot oly upperbouded by but i fact equals the righthad side of Eq. 4. Therefore, It follows that ETraceC 2 os,. ETraceC 2 or ow2 2 s, 2! o 2 2!!, which implies Eq. 8. Now we tur to Eq. 9. Cosider a term i Trace(C 2 ). If the closed wal correspodig to this term has at least differet edges, the there should be a edge with multiplicity oe, ad the expectatio of the term is 0. Therefore, we oly have to loo at terms with wals that have at most differet edges (ad at most differet vertices). It is easy to see that the umber of closed good wals of legth 2 with exactly l differet vertices is at most O( l ). The costat i O depeds o ad l (recall that ow is a costat), but for the curret tas we do ot eed to estimate this costat. The cotributio of a term correspodig to a wal with at most l differet edges is bouded by l w 22l mi. Thus E(Trace(C 2 )) is upperbouded by l0 c l 22l l [0] for some costat c. To compute the (2 )th momet of W (x), we eed to multiply E(Trace(C 2 )) by the ormalizig factor 2 2. It follows from Eq. 4 that the absolute value of the (2 )th momet of W (x) is upperbouded by l 22l l. 2 2 l0 l0 22l 2 [] Uder the assumptio of the theorem (2 ) o(). Thus, the last sum i Eq. is o(), completig the proof. Summary I this article we prove that the Laplacia spectrum of radom graphs with give expected degrees follows the semicircle law, provided some mild coditios are satisfied. We also show that the spectrum of the adjacecy matrix is essetially determied by its degree distributio. I particular, the largest eigevalues of the adjacecy matrix of a radom powerlaw graph follow a powerlaw distributio, provided that the largest degrees are large i terms of the secodorder average degree. Here we compute the spectra of a subgraph G of a simulated radom powerlaw graph with expoet 2.2. The graph G has 588 vertices with the average degree w ad the secod average degree d The largest eigevalue of its adjacecy matrix is 6.78, which is very close to the secodorder average degree d, as asserted by Theorem (see Fig. ). All the otrivial eigevalues of the Laplacia are withi 0.3 (2w ) from, as predicted by Theorems 5 ad 6 (see Fig. 2). This research was supported i part by Natioal Sciece Foudatio Grats DMS ad ITR (to F.C. ad L.L.) ad DMS (to V.V.) ad a A. Sloa fellowship (to V.V.). MATHEMATICS Chug et al. PNAS May 27, 2003 vol. 00 o. 637
6 . Kleiberg, J. (999) J. Assoc. Comput. Mach. 46, Aiello, W., Chug, F. & Lu, L. (200) Exp. Math. 0, Aiello, W., Chug, F. & Lu, L. (2002) i Hadboo of Massive Data Sets, eds. Abello, J., Pardalos, P. M. & Resede, M. G. C. (Kluwer, Dordrecht, The Netherlads), pp Albert, R., Jeog, H. & Barabási, A.L. (999) Nature 40, Barabási, A.L. & Albert, R. (999) Sciece 286, Faloutsos, M., Faloutsos, P. & Faloutsos, C. (999) ACM SIGCOMM 99 29, Jeog, H., Tomber, B., Albert, R., Oltvai, Z. & Barábasi, A.L. (2000) Nature, 407, Kleiberg, J., Kumar, R., Raghava, P., Rajagopala, S. & Tomis, A. (999) i Computig ad Combiatorics, Proceedigs of the 5th Aual Iteratioal Coferece, COCOON 99, eds. Asao, T., Imai, H., Lee, D. T., Naao, S.I. & Tooyama, T. (Spriger, Berli), pp Füredi, Z. & Komlós, J. (98) Combiatorica, Wiger, E.P. (958) A. Math. 67, Faras, I. J., Deréyi, I., Barabási, A.L. & Vicse, T. (200) Phys. Rev. E Stat. Phys. Plasmas Fluids Relat. Iterdiscip. Top. 64, , codmat Goh, K.I., Kahg, B. & Kim, D. (200) Phys. Rev. E Stat. Phys. Plasmas Fluids Relat. Iterdiscip. Top. 64, 05903, codmat Biggs, N. (993) Algebraic Graph Theory (Cambridge Uiv. Press, Cambridge, U.K.). 4. Kirchhoff, F. (847) A. Phys. Chem. 72, Erdos, P. & Réyi, A. (959) Publ. Math. 6, Chug, F. & Lu, L. (2003) A. Comb. 6, Chug, F. & Lu, L. (2002) Proc. Natl. Acad. Sci. USA 99, Erdos, P. & Gallai, T. (96) Mat. Lapo, Chug, F., Lu, L. & Vu, V. (2003) A. Comb. 7, Chug, F. (997) Spectral Graph Theory (Am. Math. Soc., Providece, RI). 2. Crisati, A., Paladi, G. & Vulpiai, A. (993) Products of Radom Matrices i Statistical Physics, Spriger Series i SolidState Scieces (Spriger, Berli), Vol Guhr, T., MüllerGroelig, A. & Weidemüller, H. A. (998) Phys. Rep. 299, Chug et al.
Asymptotic 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 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 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 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 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 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 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 informationLecture 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 information4.1 Sigma Notation and Riemann Sums
0 the itegral. Sigma Notatio ad Riema Sums Oe strategy for calculatig the area of a regio is to cut the regio ito simple shapes, calculate the area of each simple shape, ad the add these smaller areas
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 informationORDERS OF GROWTH KEITH CONRAD
ORDERS OF GROWTH KEITH CONRAD Itroductio Gaiig a ituitive feel for the relative growth of fuctios is importat if you really wat to uderstad their behavior It also helps you better grasp topics i calculus
More informationModule 4: Mathematical Induction
Module 4: Mathematical Iductio Theme 1: Priciple of Mathematical Iductio Mathematical iductio is used to prove statemets about atural umbers. As studets may remember, we ca write such a statemet as a predicate
More information7. Sample Covariance and Correlation
1 of 8 7/16/2009 6:06 AM Virtual Laboratories > 6. Radom Samples > 1 2 3 4 5 6 7 7. Sample Covariace ad Correlatio The Bivariate Model Suppose agai that we have a basic radom experimet, ad that X ad Y
More informationThe Diameter of Sparse Random Graphs
Advaces i Applied Mathematics 26, 257 279 (200 doi:0.006/aama.200.0720, available olie at http://www.idealibrary.com o The Diameter of Sparse Radom Graphs Fa Chug ad Liyua Lu Departmet of Mathematics,
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 informationIrreducible polynomials with consecutive zero coefficients
Irreducible polyomials with cosecutive zero coefficiets Theodoulos Garefalakis Departmet of Mathematics, Uiversity of Crete, 71409 Heraklio, Greece Abstract Let q be a prime power. We cosider the problem
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 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 informationSection IV.5: Recurrence Relations from Algorithms
Sectio IV.5: Recurrece Relatios from Algorithms Give a recursive algorithm with iput size, we wish to fid a Θ (best big O) estimate for its ru time T() either by obtaiig a explicit formula for T() or by
More informationRiemann Sums y = f (x)
Riema Sums Recall that we have previously discussed the area problem I its simplest form we ca state it this way: The Area Problem Let f be a cotiuous, oegative fuctio o the closed iterval [a, b] Fid
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 informationB1. Fourier Analysis of Discrete Time Signals
B. Fourier Aalysis of Discrete Time Sigals Objectives Itroduce discrete time periodic sigals Defie the Discrete Fourier Series (DFS) expasio of periodic sigals Defie the Discrete Fourier Trasform (DFT)
More informationA Faster ClauseShortening Algorithm for SAT with No Restriction on Clause Length
Joural o Satisfiability, Boolea Modelig ad Computatio 1 2005) 4960 A Faster ClauseShorteig Algorithm for SAT with No Restrictio o Clause Legth Evgey Datsi Alexader Wolpert Departmet of Computer Sciece
More informationPROCEEDINGS OF THE YEREVAN STATE UNIVERSITY AN ALTERNATIVE MODEL FOR BONUSMALUS SYSTEM
PROCEEDINGS OF THE YEREVAN STATE UNIVERSITY Physical ad Mathematical Scieces 2015, 1, p. 15 19 M a t h e m a t i c s AN ALTERNATIVE MODEL FOR BONUSMALUS SYSTEM A. G. GULYAN Chair of Actuarial Mathematics
More informationThe second difference is the sequence of differences of the first difference sequence, 2
Differece Equatios I differetial equatios, you look for a fuctio that satisfies ad equatio ivolvig derivatives. I differece equatios, istead of a fuctio of a cotiuous variable (such as time), we look for
More informationNPTEL STRUCTURAL RELIABILITY
NPTEL Course O STRUCTURAL RELIABILITY Module # 0 Lecture 1 Course Format: Web Istructor: Dr. Aruasis Chakraborty Departmet of Civil Egieerig Idia Istitute of Techology Guwahati 1. Lecture 01: Basic Statistics
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 informationLecture 7: Borel Sets and Lebesgue Measure
EE50: Probability Foudatios for Electrical Egieers JulyNovember 205 Lecture 7: Borel Sets ad Lebesgue Measure Lecturer: Dr. Krisha Jagaatha Scribes: Ravi Kolla, Aseem Sharma, Vishakh Hegde I this lecture,
More informationLecture 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.
18.409 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
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 informationThe Field Q of Rational Numbers
Chapter 3 The Field Q of Ratioal Numbers I this chapter we are goig to costruct the ratioal umber from the itegers. Historically, the positive ratioal umbers came first: the Babyloias, Egyptias ad Grees
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 informationOverview of some probability distributions.
Lecture Overview of some probability distributios. I this lecture we will review several commo distributios that will be used ofte throughtout the class. Each distributio is usually described by its probability
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 informationReview for College Algebra Final Exam
Review for College Algebra Fial Exam (Please remember that half of the fial exam will cover chapters 14. This review sheet covers oly the ew material, from chapters 5 ad 7.) 5.1 Systems of equatios i
More information{{1}, {2, 4}, {3}} {{1, 3, 4}, {2}} {{1}, {2}, {3, 4}} 5.4 Stirling Numbers
. Stirlig Numbers Whe coutig various types of fuctios from., we quicly discovered that eumeratig the umber of oto fuctios was a difficult problem. For a domai of five elemets ad a rage of four elemets,
More informationThe spectra of random graphs with given expected degrees
Classification: Physical Sciences, Mathematics The spectra of random graphs with given expected degrees by Fan Chung Linyuan Lu Van Vu Department of Mathematics University of California at San Diego La
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 informationif A S, then X \ A S, and if (A n ) n is a sequence of sets in S, then n A n S,
Lecture 5: Borel Sets Topologically, the Borel sets i a topological space are the σalgebra geerated by the ope sets. Oe ca build up the Borel sets from the ope sets by iteratig the operatios of complemetatio
More informationSequences II. Chapter 3. 3.1 Convergent Sequences
Chapter 3 Sequeces II 3. Coverget Sequeces Plot a graph of the sequece a ) = 2, 3 2, 4 3, 5 + 4,...,,... To what limit do you thik this sequece teds? What ca you say about the sequece a )? For ǫ = 0.,
More informationBrief Review of Linear System Theory
Brief Review of Liear System heory he followig iformatio is typically covered i a course o liear system theory. At ISU, EE 577 is oe such course ad is highly recommeded for power system egieerig studets.
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 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 informationAdvanced Probability Theory
Advaced Probability Theory Math5411 HKUST Kai Che (Istructor) Chapter 1. Law of Large Numbers 1.1. σalgebra, measure, probability space ad radom variables. This sectio lays the ecessary rigorous foudatio
More informationMath 475, Problem Set #6: Solutions
Math 475, Problem Set #6: Solutios A (a) For each poit (a, b) with a, b oegative itegers satisfyig ab 8, cout the paths from (0,0) to (a, b) where the legal steps from (i, j) are to (i 2, j), (i, j 2),
More informationAn example of nonquenched convergence in the conditional central limit theorem for partial sums of a linear process
A example of oqueched covergece i the coditioal cetral limit theorem for partial sums of a liear process Dalibor Volý ad Michael Woodroofe Abstract A causal liear processes X,X 0,X is costructed for which
More informationA Gentle Introduction to Algorithms: Part II
A Getle Itroductio to Algorithms: Part II Cotets of Part I:. Merge: (to merge two sorted lists ito a sigle sorted list.) 2. Bubble Sort 3. Merge Sort: 4. The BigO, BigΘ, BigΩ otatios: asymptotic bouds
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 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 informationAnnuities Under Random Rates of Interest II By Abraham Zaks. Technion I.I.T. Haifa ISRAEL and Haifa University Haifa ISRAEL.
Auities Uder Radom Rates of Iterest II By Abraham Zas Techio I.I.T. Haifa ISRAEL ad Haifa Uiversity Haifa ISRAEL Departmet of Mathematics, Techio  Israel Istitute of Techology, 3000, Haifa, Israel I memory
More informationDivide and Conquer, Solving Recurrences, Integer Multiplication Scribe: Juliana Cook (2015), V. Williams Date: April 6, 2016
CS 6, Lecture 3 Divide ad Coquer, Solvig Recurreces, Iteger Multiplicatio Scribe: Juliaa Cook (05, V Williams Date: April 6, 06 Itroductio Today we will cotiue to talk about divide ad coquer, ad go ito
More information1 The Binomial Theorem: Another Approach
The Biomial Theorem: Aother Approach Pascal s Triagle I class (ad i our text we saw that, for iteger, the biomial theorem ca be stated (a + b = c a + c a b + c a b + + c ab + c b, where the coefficiets
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 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 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 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 informationx(x 1)(x 2)... (x k + 1) = [x] k n+m 1
1 Coutig mappigs For every real x ad positive iteger k, let [x] k deote the fallig factorial ad x(x 1)(x 2)... (x k + 1) ( ) x = [x] k k k!, ( ) k = 1. 0 I the sequel, X = {x 1,..., x m }, Y = {y 1,...,
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 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 information3. Covariance and Correlation
Virtual Laboratories > 3. Expected Value > 1 2 3 4 5 6 3. Covariace ad Correlatio Recall that by takig the expected value of various trasformatios of a radom variable, we ca measure may iterestig characteristics
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. 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 informationLearning outcomes. Algorithms and Data Structures. Time Complexity Analysis. Time Complexity Analysis How fast is the algorithm? Prof. Dr.
Algorithms ad Data Structures Algorithm efficiecy Learig outcomes Able to carry out simple asymptotic aalysisof algorithms Prof. Dr. Qi Xi 2 Time Complexity Aalysis How fast is the algorithm? Code the
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 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 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 informationSUMS OF GENERALIZED HARMONIC SERIES. Michael E. Ho man Department of Mathematics, U. S. Naval Academy, Annapolis, Maryland
#A46 INTEGERS 4 (204) SUMS OF GENERALIZED HARMONIC SERIES Michael E. Ho ma Departmet of Mathematics, U. S. Naval Academy, Aapolis, Marylad meh@usa.edu Courtey Moe Departmet of Mathematics, U. S. Naval
More informationA CHARACTERIZATION OF MINIMAL ZEROSEQUENCES OF INDEX ONE IN FINITE CYCLIC GROUPS
INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 5(1) (2005), #A27 A CHARACTERIZATION OF MINIMAL ZEROSEQUENCES OF INDEX ONE IN FINITE CYCLIC GROUPS Scott T. Chapma 1 Triity Uiversity, Departmet
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 informationLinear Algebra II. 4 Determinants. Notes 4 1st November Definition of determinant
MTH6140 Liear Algebra II Notes 4 1st November 2010 4 Determiats The determiat is a fuctio defied o square matrices; its value is a scalar. It has some very importat properties: perhaps most importat is
More informationDefinition. Definition. 72 Estimating a Population Proportion. Definition. Definition
7 stimatig a Populatio Proportio I this sectio we preset methods for usig a sample proportio to estimate the value of a populatio proportio. The sample proportio is the best poit estimate of the populatio
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 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 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 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 informationThe Diameter of Sparse Random Graphs
The Diameter of Sparse Radom Graphs Fa Chug Liyua Lu This paper is dedicated to the memory of Paul Erdős. Abstract We cosider the diameter of a radom graph G(, p) for various rages of p close to the phase
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 information1 Introduction to reducing variance in Monte Carlo simulations
Copyright c 007 by Karl Sigma 1 Itroductio to reducig variace i Mote Carlo simulatios 11 Review of cofidece itervals for estimatig a mea I statistics, we estimate a uow mea µ = E(X) of a distributio by
More informationVladimir N. Burkov, Dmitri A. Novikov MODELS AND METHODS OF MULTIPROJECTS MANAGEMENT
Keywords: project maagemet, resource allocatio, etwork plaig Vladimir N Burkov, Dmitri A Novikov MODELS AND METHODS OF MULTIPROJECTS MANAGEMENT The paper deals with the problems of resource allocatio betwee
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 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 informationThe Euler Totient, the Möbius and the Divisor Functions
The Euler Totiet, the Möbius ad the Divisor Fuctios Rosica Dieva July 29, 2005 Mout Holyoke College South Hadley, MA 01075 1 Ackowledgemets This work was supported by the Mout Holyoke College fellowship
More informationMeasurable Functions
Measurable Fuctios Dug Le 1 1 Defiitio It is ecessary to determie the class of fuctios that will be cosidered for the Lebesgue itegratio. We wat to guaratee that the sets which arise whe workig with these
More information13 Fast Fourier Transform (FFT)
13 Fast Fourier Trasform FFT) The fast Fourier trasform FFT) is a algorithm for the efficiet implemetatio of the discrete Fourier trasform. We begi our discussio oce more with the cotiuous Fourier trasform.
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 informationConfidence Intervals for One Mean with Tolerance Probability
Chapter 421 Cofidece Itervals for Oe Mea with Tolerace Probability Itroductio This procedure calculates the sample size ecessary to achieve a specified distace from the mea to the cofidece limit(s) with
More informationMath Discrete Math Combinatorics MULTIPLICATION PRINCIPLE:
Math 355  Discrete Math 4.14.4 Combiatorics Notes MULTIPLICATION PRINCIPLE: If there m ways to do somethig ad ways to do aother thig the there are m ways to do both. I the laguage of set theory: Let
More information4 n. n 1. You shold think of the Ratio Test as a generalization of the Geometric Series Test. For example, if a n ar n is a geometric sequence then
SECTION 2.6 THE RATIO TEST 79 2.6. THE RATIO TEST We ow kow how to hadle series which we ca itegrate (the Itegral Test), ad series which are similar to geometric or pseries (the Compariso Test), but of
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 informationA Study for the (μ,s) n Relation for Tent Map
Applied Mathematical Scieces, Vol. 8, 04, o. 60, 3009305 HIKARI Ltd, www.mhikari.com http://dx.doi.org/0.988/ams.04.4437 A Study for the (μ,s) Relatio for Tet Map Saba Noori Majeed Departmet of Mathematics
More informationAlternatives To Pearson s and Spearman s Correlation Coefficients
Alteratives To Pearso s ad Spearma s Correlatio Coefficiets Floreti Smaradache Chair of Math & Scieces Departmet Uiversity of New Mexico Gallup, NM 8730, USA Abstract. This article presets several alteratives
More informationMatrix Transforms of Astatistically Convergent Sequences with Speed
Filomat 27:8 2013, 1385 1392 DOI 10.2298/FIL1308385 Published by Faculty of Scieces ad Mathematics, Uiversity of Niš, Serbia vailable at: http://www.pmf.i.ac.rs/filomat Matrix Trasforms of statistically
More informationChapter 5 O A Cojecture Of Erdíos Proceedigs NCUR VIII è1994è, Vol II, pp 794í798 Jeærey F Gold Departmet of Mathematics, Departmet of Physics Uiversity of Utah Do H Tucker Departmet of Mathematics Uiversity
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 informationwhen n = 1, 2, 3, 4, 5, 6, This list represents the amount of dollars you have after n days. Note: The use of is read as and so on.
Geometric eries Before we defie what is meat by a series, we eed to itroduce a related topic, that of sequeces. Formally, a sequece is a fuctio that computes a ordered list. uppose that o day 1, you have
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 informationN04/5/MATHL/HP2/ENG/TZ0/XX MATHEMATICS HIGHER LEVEL PAPER 2. Thursday 4 November 2004 (morning) 3 hours INSTRUCTIONS TO CANDIDATES
c IB MATHEMATICS HIGHER LEVEL PAPER DIPLOMA PROGRAMME PROGRAMME DU DIPLÔME DU BI PROGRAMA DEL DIPLOMA DEL BI N/5/MATHL/HP/ENG/TZ/XX 887 Thursday November (morig) hours INSTRUCTIONS TO CANDIDATES! Do ot
More information1 n. n > dt. t < n 1 + n=1
Math 05 otes C. Pomerace The harmoic sum The harmoic sum is the sum of recirocals of the ositive itegers. We kow from calculus that it diverges, this is usually doe by the itegral test. There s a more
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 informationLecture Notes CMSC 251
We have this messy summatio to solve though First observe that the value remais costat throughout the sum, ad so we ca pull it out frot Also ote that we ca write 3 i / i ad (3/) i T () = log 3 (log ) 1
More information