THE HEIGHT OF qbinary SEARCH TREES


 Bruno Barber
 4 years ago
 Views:
Transcription
1 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 ad variace of the height are computed, based o radom words of legth, as well as a Gaussia limit law.. Itroductio The paper [8] itroduces for the first time a meaigful q model of biary search trees: istead of biary search trees, oe cosiders touramet trees, which differ oly margially from biary search trees; if oe starts from a permutatio ( π 2 π 2 π ), the oe iserts the umber i istead of the umber π i. Thus, traversig the tree i iorder, we might thi of the associated permutatio as ρσ, where goes ito the root, ad ρ resp. σ form (recursively) the left resp. right subtree. We could have called this paper The Height of qtouramet Trees; however we decided ot to do so sice biary search trees are by far better ow, both, i the commuity of theoretical computer scietists, ad combiatorialists. A ice referece for touramet trees ad icreasig trees i geeral is [2]. Now istead of cosiderig permutatios π π 2 π, we cosider words over the alphabet {, 2, 3,... }, ad (geometric) probabilities attached to the letters, i. e., the probability of letter i is pq i, with p+q =. The biary search tree is the costructed by writig a oempty word w as w = xay, where a is the smallest letter occurrig, ad x {a +, a + 2,... } ad y {a, a +,... }. The letter a goes ito the root ad x resp. y form the left resp. right subtree. The paper [8] dealt with the path legth; here we cosider the height. The height of a biary search tree (ad thus of the trees i our model) is defied to be the largest umber of odes i a path from the root to a leaf; the empty tree (related to the empty word) has height 0. We will prove that the expected height, whe cosiderig radom words of legth, is asymptotic to p; the variace will also be computed as well as a Gaussia limit law. (The letter p will always deote q i this paper.) Recall that the result for traditioal biary search trees is c log with c = 4.307, see [3]; ufortuately we do ot get that result as the limit q as it so happeed for the path legth. However, othig is wrog here, sice the limit q i p simply tells us that the average height should be less tha liear. Although this origial hope of gettig the Key words ad phrases. Biary search tree, q aalog, height.
2 2 MICHAEL DRMOTA AND HELMUT PRODINGER classical result as a corollary did ot wor out, we evertheless thi that the results preseted here are of idepedet iterest. Note also that p is the expected umber of letters i a (radom) strig of legth. I our asymmetric model, they must all lie o oe path. I more detail, we will obtai the followig results: Let H deote the height of q biary search trees with (iteral) odes (this is a radom variable, defied o words of legth ). Theorem. For every positive q < the height H of q biary search trees with (iteral) odes satifies a cetral limit theorem of the form x p Pr{H x} Φ = O( /2 ), () pq sup x R where Φ(x) deotes the ormal distributio fuctio The expected value is give by Φ(x) = 2π x E H = p + O e t2 /2 dt., (2) p i which the Ocostat is uiform for 0 < q <. The variace ca be estimated by V H = pq + O q ( /2 log 2 ). (3) The Ocostat i the error term of the variace is ot uiform for 0 < q <. The depedecy o q has ot bee wored out sice the order of magitude of the error term is surely ot optimal. However, although the error term for the expected value is uiform, this theorem caot be used to cover the case q where it is ow that the expected value is give by E H = c log + O (log log ) (with c = 4.307, see [3]) ad the variace is bouded: V H = O() (see [5, 6]). Ituitively, this result (ad its proof) says that the height is domiated by the umber of s i the sequece. This seems to be due to the fact that most s appear cosecutively i the sequece, producig rather sew subtrees. The cotributio from 2 s is asymptotically egligible sice there are much fewer of them, etc. Studyig the combiatorics (of words) of geometrically distributed radom variables has bee a log term project of oe of us (H. P.), ad further papers ca be foud o this author s webpage. We do ot wat to give more details here, but i all previous
3 THE HEIGHT OF qbinary SEARCH TREES 3 cases the correspodece betwee the model of words ad its limit (permutatios) led to very satisfactory results. We would lie to cite the paper [] which is of geeral iterest i this cotext. 2. Wea Covergece Lemma. Let y (x) deote the geeratig fuctio The we have y 0 (x) 0, y (0) = ad for 0. y (x) = 0 Pr{H }x. y + (x) = y (x)y (qx) + y + (qx) (4) Proof. The proof is a straightforward traslatio of the basic decompositio w = xay: If a = (described by ), the the left subtree cosists oly of letters i {2, 3,... }, described by y (qx), but the right subtree ca have ay letters, which is described by y (x). However, if a >, we get the term y + (qx) (we might the thi of all letters beig reduced by ). If we write this i the form the the limit q gives y + (x) y + (qx) ( q)x y +(x) = y 2 (x), = y (qx)y (x), the usual recursio i the istace of biary search trees. (Recall that f(x) f(qx) =: ( q)x (D q f)(x), ad D q is called the q differece operator.) Also, if we write y (x) = a,j x j, 0 j<2 the we get, by comparig coefficiets, a +,j = p q j a,i a,j i q i for j, 0 i<j ad a,0 = for all 0. Thus, Theorem may be reformulated i terms of a,j. However, i this paper we will ot mae use of this otio. Lemma 2. The geeratig fuctios y (x) ( 0, 0 x < ) are bouded above by y (x) x x (. (5) x
4 4 MICHAEL DRMOTA AND HELMUT PRODINGER Furthermore, this iequality is also true o the level of coefficiets, i. e. for ad Pr{H } = [x ]y (x) ( [x x ] x = p l q l. l l=0 (6) Note that this upper boud is a exact biomial distributio fuctio which is asymptotically ormal with mea p( ) + = p + q ad variace pq( ). Proof. Sice y (x) /( x) we get from (4) that y + (x) y (x) +. Thus, (5) follows by iductio. Note that ay step i these calculatios is also true o the level of coefficiets. Thus, Set ad Pr{H } [x x ] x (. Y (x) = x x ( x (x) = Y (x) Y (x) = p (. Sice [x ] (x) = p q, (6) follows immediately.
5 THE HEIGHT OF qbinary SEARCH TREES 5 Lemma 3. The geeratig fuctios y (x) ( 0, 0 x < ) are bouded below by y (x) x x ( x (qx)2 ( (qx) qx qx (qx) x qx ( + qx2 (qx x. Furthermore, this iequality is also true o the level of coefficiets. Proof. First we use the trivial lower boud (7) y (x) x+ x ad the upper boud (5) to obtai the iequality y + (x) = y (x)y (qx) + y + (qx) x( q)y (x) (qx)+ y (x) + (qx)+ x x x + (qx)+2 (qx)+2. Now (7) follows by iductio. As i the proof of Lemma 2 it ca be observed that (7) is also true o the level of coefficiets. I order to obtai proper error terms for the lower boud for Pr{H } which may derived from Lemma 3 we mae use of the followig lemma. Lemma 4. Let 0 < q < be give ad let F (x) be a fuctio which is aalytic for x < + ε for some ε > 0. The there exist c > 0 ad η > 0 (depedig o q) such that ( ( ( [x ]F (x) = O /2 exp c )) 2 p (8) ad [x ]F (x) ( (qx) qx ( ( = O /2 exp c )) 2 p + O(q ) (9)
6 6 MICHAEL DRMOTA AND HELMUT PRODINGER uiformly for p η as. Proof. By usig stadard saddle poit asymptotics (compare with [4]) it follows that [x ]F (x) ( = 2πi = O z =x 0 F (z) /2 x 0 ( qz z + ( 0 0, where the saddle poit x = x 0 = ( ) /q is determied by the equatio x d dx =. I particular we have x 0 = if / = p. Fially a local expasio of x 0 ( 0 0 = q p ( ( ) completes the proof of (8). The proof of (9) rus alog similar lies. However, we have to be a little bit more careful. The reaso is that the deomiator qz qz is sigular for z = 0 ad for z 2 = ( + 2q)/q 2. Nevertheless the whole part ( (qz) qz
7 THE HEIGHT OF qbinary SEARCH TREES 7 is regular for z < /q. Note that z 2 > for 0 < q < 2 ad that z 2 < for 2 < q <. Thus, if q 2 we get similarly to the above [x ]F (x) = 2πi = 2πi = O ( (qx) qx = 2πi z =x 0 z =x 0 /2 x 0 F (z) qz F (z) qz ( 0 0 z =x 0 F (z) z + 2πi z + 2πi + O(q ). ( z =x 0 z = (qz) qz z + (qz F (z) qz (qz F (z) qz z + z + Note that we just shifted the paths of itegratio i regios of aalyticity if η is chose sufficietly small such that x 0 < z 2. If q = 2 the there are polar sigularities at z 2 = after splittig the itegral. However, the residues of the fuctios ivolved (at z = ) are both of order O ( ( 2 ) = O(q ), which implies that we get the same error term as i the case q 2. Note further that (with a little bit more effort) we could have bee much more precise. However, the boud give by Lemma 4 is sufficiet for our purposes. Lemma 5. For every 0 < q < there exist c > 0 ad η > 0 (depedig o q) such that ( ( Pr{H } p l q l = O /2 exp c )) 2 p l=0 l (0) uiformly for p η ad Pr{ H p m} = O uiformly for m η as. ( ) exp c m2 () Proof. First we ote that (9) of Lemma 4 applies to the fuctio (qx) 2 (qx) qx.
8 8 MICHAEL DRMOTA AND HELMUT PRODINGER Thus we obtai [x ] (qx)2 ( (qx) qx ( ( = O /2 exp c )) 2 p + O(q ) uiformly for p η as. The remaiig terms will ow be treated i the same way as i the proof of Lemma 4: [x ] qx (qx) x qx + qx2 (qx x = qz (qz) 2πi z qz qz qz2 (qz z qz qz z z = ε + = qz ( qz2 2πi z qz qz z qz qz z + 2πi + 2πi = O z =x 0 z = z = /2 x 0 qz (qz) z qz qz qz 2 ( (qz z qz qz ( O(q ). z + z + For the first itegral we use the fact that the fuctio F (z) = qz qz2 z qz qz z qz is regular at z = ud thus bouded i a viciity of z = (compare with the proof of Lemma 4). The secod ad third itegrals are easy to estimate. We oly have to apply the trivial bouds max z = z =, ad max z = z max = O() z = = ( + O( ) qz = O().
9 THE HEIGHT OF qbinary SEARCH TREES 9 Fially observe that i the rage p η we surely have ( ( q = O /2 exp c )) 2 p which completes the proof of (0). The proof of () is ow easy. We just have to combie a proper tail estimate for the biomial distributio, i. e. ( ) p l q l = O exp c m2, l with (0). l p m We are ow able to complete the first part of Theorem. It is well ow that the distributio fuctio of the biomial distributio ca be estimated by the distributio fuctio of the ormal distributio up to a uiform error of order O( /2 ), i. e., as, sup x R p l q l Φ l x l ( x p pq ) = O( /2 ), (2) compare with [7, p. 542]. Furthermore, by (0) we get a similar result for the distributio of H : sup Pr{H x} p l q l x R l x l = O( /2 ). (3) Note that (0) provides (3) just for x with x p η. However, by () we ow that Pr{ H p η} ( ( = O exp cη 2 )). By the mootoicity of the distributio fuctio this implies that for x with x p η we also have Pr{ H p x} = O ( exp ( cη 2 )). Thus (3) follows. The first part of Theorem, i. e. (), is ow a trivial cosequece of (2) ad (3). 3. Covergece of Momets Lemmata 2 ad 3 ca be easily used to get quite tight bouds for the expected value. Note that E H x = 0 0 x y (x). (4)
10 0 MICHAEL DRMOTA AND HELMUT PRODINGER Lemma 6. The expected value of H ca be bouded by p + q E H p + O. (5) p Proof. Set The by (5) we obtai E(x) E(x) = 0 x y (x). x = x 0 x() ( x) 2, which is also true o the level of coefficiets. Thus, we have Similarly we get the upper boud. From E(x) we directly obtai x() ( x) + (qx)2 2 + qx x qx2 x E H p + q. ( ( ) qx ) qx 2 ( q) x() = ( x) + (qx) 2 2 ( x)() pqx 2 + ( x) 2 () qx2 ( x) + qx 2 2 ( x) pqx2 x() = ( x) + qx 2 () 2 ( x) ( pqx 2 ) This completes the proof of Lemma 6. E H p + O. p Ufortuately it seems that we caot prove similarly tight estimates for the variace. However, we ca obtai a o trivial result: Lemma 7. The variace of H ca be bouded by V H = pq + O q ( /2 log 2 ). (6)
11 THE HEIGHT OF qbinary SEARCH TREES Proof. If F (x) = Pr{X x} deotes the distributio fuctio of a radom variable X (of compact support) the the variace of X ca be represeted by V X = 2 EX (EX y)f (y) dy + 2 EX (y EX)( F (y)) dy. We apply this formula for the height H where we have very precise estimates for EH ad its distributio fuctio F (x) = Pr{H x}, compare with Lemma 5 ad Lemma 6. Let u η be a parameter to be defied later. By applyig Lemma 5 ad Lemma 6 we get EH u 2 (EH y)f (y) dy = O ( e cu2), ad EH EH u EH u EH (EH y)f (y) dy = pq 2 + O ( u 2 ), (y EH )( F (y)) dy = pq 2 + O ( u 2 ), 2 EH (y EH )( F (y)) dy = O ( e cu2). u Choosig u = log 2 gives the result. It should be further metioed that it is quite easy to get asymptotic relatios for all cetral momets of the form E(H E H c (pq/2 ( ) by the method as described i Lemma 7, where c 2 = (2)!/(2!) ad c 2+ = 0. Thus we have ot oly a wea covergece result for H (properly ormalized) but covergece of momets, too. Refereces [] M. Barlow, R. Pematle ad E. Peris, Diffusio limited aggregatio o a homogeeous tree, Prob. Theory ad Related Fields 07 (997), 60. [2] F. Bergero, P. Flajolet ad B. Salvy, Varieties of icreasig trees, Lecture Notes i Computer Sciece 58 (992), [3] L. Devroye ad B. Reed, O the variace of the height of radom biary search trees, SIAM J. Comput. 24 (995), [4] M. Drmota, A bivariate asymptotic expasio of coefficiets of powers of geeratig fuctios, Europ. J. Combiatorics 5 (994), [5] M. Drmota, The variace of the height of biary search trees, Theoret. Comput. Sci. 270 (2002), [6] B. Reed, The height of a radom biary search tree, J. Assoc. Comput. Mach., to appear. [7] W. Feller, A Itroductio to Probability Theory ad Its Applicatios, Vol. II, 2 d ed., J. Wiley, New Yor, 97.
12 2 MICHAEL DRMOTA AND HELMUT PRODINGER [8] H. Prodiger, A q aalogue of the path legth of biary search trees, Algorithmica 3 (200), Departmet of Geometry, Techical Uiversity of Viea, Wieder Hauptstrasse 8 0, A040 Viea, Austria address: The Joh Kopfmacher Cetre for Applicable Aalysis ad Number Theory, School of Mathematics, Uiversity of the Witwatersrad, P. O. Wits, 2050 Johaesburg, South Africa address: WWWaddress:
A 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 informationAsymptotic Growth of Functions
CMPS Itroductio to Aalysis of Algorithms Fall 3 Asymptotic Growth of Fuctios We itroduce several types of asymptotic otatio which are used to compare the performace ad efficiecy of algorithms As we ll
More 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 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 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 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 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 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 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 informationInfinite Sequences and Series
CHAPTER 4 Ifiite Sequeces ad Series 4.1. Sequeces A sequece is a ifiite ordered list of umbers, for example the sequece of odd positive itegers: 1, 3, 5, 7, 9, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29...
More 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 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 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 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 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 informationConfidence Intervals for One Mean
Chapter 420 Cofidece Itervals for Oe Mea Itroductio This routie calculates the sample size ecessary to achieve a specified distace from the mea to the cofidece limit(s) at a stated cofidece level for a
More 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 informationClass Meeting # 16: The Fourier Transform on R n
MATH 18.152 COUSE NOTES  CLASS MEETING # 16 18.152 Itroductio to PDEs, Fall 2011 Professor: Jared Speck Class Meetig # 16: The Fourier Trasform o 1. Itroductio to the Fourier Trasform Earlier i the course,
More 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 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 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 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 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 informationNotes on exponential generating functions and structures.
Notes o expoetial geeratig fuctios ad structures. 1. The cocept of a structure. Cosider the followig coutig problems: (1) to fid for each the umber of partitios of a elemet set, (2) to fid for each the
More 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 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 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 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 informationOutput Analysis (2, Chapters 10 &11 Law)
B. Maddah ENMG 6 Simulatio 05/0/07 Output Aalysis (, Chapters 10 &11 Law) Comparig alterative system cofiguratio Sice the output of a simulatio is radom, the comparig differet systems via simulatio should
More informationThe following example will help us understand The Sampling Distribution of the Mean. C1 C2 C3 C4 C5 50 miles 84 miles 38 miles 120 miles 48 miles
The followig eample will help us uderstad The Samplig Distributio of the Mea Review: The populatio is the etire collectio of all idividuals or objects of iterest The sample is the portio of the populatio
More 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 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 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 informationEntropy of bicapacities
Etropy of bicapacities Iva Kojadiovic LINA CNRS FRE 2729 Site école polytechique de l uiv. de Nates Rue Christia Pauc 44306 Nates, Frace iva.kojadiovic@uivates.fr JeaLuc Marichal Applied Mathematics
More informationUniversal coding for classes of sources
Coexios module: m46228 Uiversal codig for classes of sources Dever Greee This work is produced by The Coexios Project ad licesed uder the Creative Commos Attributio Licese We have discussed several parametric
More informationCHAPTER 7: Central Limit Theorem: CLT for Averages (Means)
CHAPTER 7: Cetral Limit Theorem: CLT for Averages (Meas) X = the umber obtaied whe rollig oe six sided die oce. If we roll a six sided die oce, the mea of the probability distributio is X P(X = x) Simulatio:
More informationYour organization has a Class B IP address of 166.144.0.0 Before you implement subnetting, the Network ID and Host ID are divided as follows:
Subettig Subettig is used to subdivide a sigle class of etwork i to multiple smaller etworks. Example: Your orgaizatio has a Class B IP address of 166.144.0.0 Before you implemet subettig, the Network
More 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 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 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 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 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 informationThe analysis of the Cournot oligopoly model considering the subjective motive in the strategy selection
The aalysis of the Courot oligopoly model cosiderig the subjective motive i the strategy selectio Shigehito Furuyama Teruhisa Nakai Departmet of Systems Maagemet Egieerig Faculty of Egieerig Kasai Uiversity
More informationDoktori értekezés Katona Zsolt 2006
Doktori értekezés Katoa Zsolt 2006 Radom Graph Models Doktori értekezés Iformatika Doktori Iskola, Az Iformatika Alapjai program, vezető: Demetrovics Jáos Katoa Zsolt Témavezető: Móri Tamás, doces Eötvös
More informationEfficient tree methods for pricing digital barrier options
Efficiet tree methods for pricig digital barrier optios arxiv:1401.900v [qfi.cp] 7 Ja 014 Elisa Appolloi Sapieza Uiversità di Roma MEMOTEF elisa.appolloi@uiroma1.it Abstract Adrea igori Uiversità di Roma
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 informationAn Efficient Polynomial Approximation of the Normal Distribution Function & Its Inverse Function
A Efficiet Polyomial Approximatio of the Normal Distributio Fuctio & Its Iverse Fuctio Wisto A. Richards, 1 Robi Atoie, * 1 Asho Sahai, ad 3 M. Raghuadh Acharya 1 Departmet of Mathematics & Computer Sciece;
More informationA Mathematical Perspective on Gambling
A Mathematical Perspective o Gamblig Molly Maxwell Abstract. This paper presets some basic topics i probability ad statistics, icludig sample spaces, probabilistic evets, expectatios, the biomial ad ormal
More informationThe Stable Marriage Problem
The Stable Marriage Problem William Hut Lae Departmet of Computer Sciece ad Electrical Egieerig, West Virgiia Uiversity, Morgatow, WV William.Hut@mail.wvu.edu 1 Itroductio Imagie you are a matchmaker,
More informationLecture 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 informationApproximating Area under a curve with rectangles. To find the area under a curve we approximate the area using rectangles and then use limits to find
1.8 Approximatig Area uder a curve with rectagles 1.6 To fid the area uder a curve we approximate the area usig rectagles ad the use limits to fid 1.4 the area. Example 1 Suppose we wat to estimate 1.
More informationNormal Distribution.
Normal Distributio www.icrf.l Normal distributio I probability theory, the ormal or Gaussia distributio, is a cotiuous probability distributio that is ofte used as a first approimatio to describe realvalued
More 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 informationWHEN IS THE (CO)SINE OF A RATIONAL ANGLE EQUAL TO A RATIONAL NUMBER?
WHEN IS THE (CO)SINE OF A RATIONAL ANGLE EQUAL TO A RATIONAL NUMBER? JÖRG JAHNEL 1. My Motivatio Some Sort of a Itroductio Last term I tought Topological Groups at the Göttige Georg August Uiversity. This
More 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 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 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 informationTheorems About Power Series
Physics 6A Witer 20 Theorems About Power Series Cosider a power series, f(x) = a x, () where the a are real coefficiets ad x is a real variable. There exists a real oegative umber R, called the radius
More informationLecture 2: Karger s Min Cut Algorithm
priceto uiv. F 3 cos 5: Advaced Algorithm Desig Lecture : Karger s Mi Cut Algorithm Lecturer: Sajeev Arora Scribe:Sajeev Today s topic is simple but gorgeous: Karger s mi cut algorithm ad its extesio.
More informationMARTINGALES AND A BASIC APPLICATION
MARTINGALES AND A BASIC APPLICATION TURNER SMITH Abstract. This paper will develop the measuretheoretic approach to probability i order to preset the defiitio of martigales. From there we will apply this
More information5: Introduction to Estimation
5: Itroductio to Estimatio Cotets Acroyms ad symbols... 1 Statistical iferece... Estimatig µ with cofidece... 3 Samplig distributio of the mea... 3 Cofidece Iterval for μ whe σ is kow before had... 4 Sample
More 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 informationGCSE STATISTICS. 4) How to calculate the range: The difference between the biggest number and the smallest number.
GCSE STATISTICS You should kow: 1) How to draw a frequecy diagram: e.g. NUMBER TALLY FREQUENCY 1 3 5 ) How to draw a bar chart, a pictogram, ad a pie chart. 3) How to use averages: a) Mea  add up all
More informationA note on the boundary behavior for a modiﬁed Green function in the upperhalf space
Zhag ad Pisarev Boudary Value Problems (015) 015:114 DOI 10.1186/s136610150363z RESEARCH Ope Access A ote o the boudary behavior for a modiﬁed Gree fuctio i the upperhalf space Yulia Zhag1 ad Valery
More informationNATIONAL SENIOR CERTIFICATE GRADE 12
NATIONAL SENIOR CERTIFICATE GRADE MATHEMATICS P EXEMPLAR 04 MARKS: 50 TIME: 3 hours This questio paper cosists of 8 pages ad iformatio sheet. Please tur over Mathematics/P DBE/04 NSC Grade Eemplar INSTRUCTIONS
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 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 informationA RANDOM PERMUTATION MODEL ARISING IN CHEMISTRY
J. Appl. Prob. 45, 060 070 2008 Prited i Eglad Applied Probability Trust 2008 A RANDOM PERMUTATION MODEL ARISING IN CHEMISTRY MARK BROWN, The City College of New York EROL A. PEKÖZ, Bosto Uiversity SHELDON
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 information5.3. Generalized Permutations and Combinations
53 GENERALIZED PERMUTATIONS AND COMBINATIONS 73 53 Geeralized Permutatios ad Combiatios 53 Permutatios with Repeated Elemets Assume that we have a alphabet with letters ad we wat to write all possible
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 informationTO: Users of the ACTEX Review Seminar on DVD for SOA Exam MLC
TO: Users of the ACTEX Review Semiar o DVD for SOA Eam MLC FROM: Richard L. (Dick) Lodo, FSA Dear Studets, Thak you for purchasig the DVD recordig of the ACTEX Review Semiar for SOA Eam M, Life Cotigecies
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 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 information23 The Remainder and Factor Theorems
 The Remaider ad Factor Theorems Factor each polyomial completely usig the give factor ad log divisio 1 x + x x 60; x + So, x + x x 60 = (x + )(x x 15) Factorig the quadratic expressio yields x + x x
More informationMath C067 Sampling Distributions
Math C067 Samplig Distributios Sample Mea ad Sample Proportio Richard Beigel Some time betwee April 16, 2007 ad April 16, 2007 Examples of Samplig A pollster may try to estimate the proportio of voters
More informationCenter, Spread, and Shape in Inference: Claims, Caveats, and Insights
Ceter, Spread, ad Shape i Iferece: Claims, Caveats, ad Isights Dr. Nacy Pfeig (Uiversity of Pittsburgh) AMATYC November 2008 Prelimiary Activities 1. I would like to produce a iterval estimate for the
More informationResearch Article Sign Data Derivative Recovery
Iteratioal Scholarly Research Network ISRN Applied Mathematics Volume 0, Article ID 63070, 7 pages doi:0.540/0/63070 Research Article Sig Data Derivative Recovery L. M. Housto, G. A. Glass, ad A. D. Dymikov
More informationA Note on Sums of Greatest (Least) Prime Factors
It. J. Cotemp. Math. Scieces, Vol. 8, 203, o. 9, 423432 HIKARI Ltd, www.mhikari.com A Note o Sums of Greatest (Least Prime Factors Rafael Jakimczuk Divisio Matemática, Uiversidad Nacioal de Luá Bueos
More informationMEI Structured Mathematics. Module Summary Sheets. Statistics 2 (Version B: reference to new book)
MEI Mathematics i Educatio ad Idustry MEI Structured Mathematics Module Summary Sheets Statistics (Versio B: referece to ew book) Topic : The Poisso Distributio Topic : The Normal Distributio Topic 3:
More informationZTEST / ZSTATISTIC: used to test hypotheses about. µ when the population standard deviation is unknown
ZTEST / ZSTATISTIC: used to test hypotheses about µ whe the populatio stadard deviatio is kow ad populatio distributio is ormal or sample size is large TTEST / TSTATISTIC: used to test hypotheses about
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 informationCS103X: Discrete Structures Homework 4 Solutions
CS103X: Discrete Structures Homewor 4 Solutios Due February 22, 2008 Exercise 1 10 poits. Silico Valley questios: a How may possible sixfigure salaries i whole dollar amouts are there that cotai at least
More informationSampling Distribution And Central Limit Theorem
() Samplig Distributio & Cetral Limit Samplig Distributio Ad Cetral Limit Samplig distributio of the sample mea If we sample a umber of samples (say k samples where k is very large umber) each of size,
More informationNEW HIGH PERFORMANCE COMPUTATIONAL METHODS FOR MORTGAGES AND ANNUITIES. Yuri Shestopaloff,
NEW HIGH PERFORMNCE COMPUTTIONL METHODS FOR MORTGGES ND NNUITIES Yuri Shestopaloff, Geerally, mortgage ad auity equatios do ot have aalytical solutios for ukow iterest rate, which has to be foud usig umerical
More informationData Analysis and Statistical Behaviors of Stock Market Fluctuations
44 JOURNAL OF COMPUTERS, VOL. 3, NO. 0, OCTOBER 2008 Data Aalysis ad Statistical Behaviors of Stock Market Fluctuatios Ju Wag Departmet of Mathematics, Beijig Jiaotog Uiversity, Beijig 00044, Chia Email:
More informationwhere: T = number of years of cash flow in investment's life n = the year in which the cash flow X n i = IRR = the internal rate of return
EVALUATING ALTERNATIVE CAPITAL INVESTMENT PROGRAMS By Ke D. Duft, Extesio Ecoomist I the March 98 issue of this publicatio we reviewed the procedure by which a capital ivestmet project was assessed. The
More informationINFINITE SERIES KEITH CONRAD
INFINITE SERIES KEITH CONRAD. Itroductio The two basic cocepts of calculus, differetiatio ad itegratio, are defied i terms of limits (Newto quotiets ad Riema sums). I additio to these is a third fudametal
More informationWeek 3 Conditional probabilities, Bayes formula, WEEK 3 page 1 Expected value of a random variable
Week 3 Coditioal probabilities, Bayes formula, WEEK 3 page 1 Expected value of a radom variable We recall our discussio of 5 card poker hads. Example 13 : a) What is the probability of evet A that a 5
More informationON AN INTEGRAL OPERATOR WHICH PRESERVE THE UNIVALENCE
Proceedigs of the Iteratioal Coferece o Theory ad Applicatios of Mathematics ad Iformatics ICTAMI 3, Alba Iulia ON AN INTEGRAL OPERATOR WHICH PRESERVE THE UNIVALENCE by Maria E Gageoea ad Silvia Moldoveau
More informationSolutions to Selected Problems In: Pattern Classification by Duda, Hart, Stork
Solutios to Selected Problems I: Patter Classificatio by Duda, Hart, Stork Joh L. Weatherwax February 4, 008 Problem Solutios Chapter Bayesia Decisio Theory Problem radomized rules Part a: Let Rx be the
More 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 information, a Wishart distribution with n 1 degrees of freedom and scale matrix.
UMEÅ UNIVERSITET Matematiskstatistiska istitutioe Multivariat dataaalys D MSTD79 PA TENTAMEN 00409 LÖSNINGSFÖRSLAG TILL TENTAMEN I MATEMATISK STATISTIK Multivariat dataaalys D, 5 poäg.. Assume that
More informationBuilding Blocks Problem Related to Harmonic Series
TMME, vol3, o, p.76 Buildig Blocks Problem Related to Harmoic Series Yutaka Nishiyama Osaka Uiversity of Ecoomics, Japa Abstract: I this discussio I give a eplaatio of the divergece ad covergece of ifiite
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 informationS. Tanny MAT 344 Spring 1999. be the minimum number of moves required.
S. Tay MAT 344 Sprig 999 Recurrece Relatios Tower of Haoi Let T be the miimum umber of moves required. T 0 = 0, T = 7 Iitial Coditios * T = T + $ T is a sequece (f. o itegers). Solve for T? * is a recurrece,
More informationChapter 7: Confidence Interval and Sample Size
Chapter 7: Cofidece Iterval ad Sample Size Learig Objectives Upo successful completio of Chapter 7, you will be able to: Fid the cofidece iterval for the mea, proportio, ad variace. Determie the miimum
More informationarxiv:1506.03481v1 [stat.me] 10 Jun 2015
BEHAVIOUR OF ABC FOR BIG DATA By Wetao Li ad Paul Fearhead Lacaster Uiversity arxiv:1506.03481v1 [stat.me] 10 Ju 2015 May statistical applicatios ivolve models that it is difficult to evaluate the likelihood,
More informationSolutions to Exercises Chapter 4: Recurrence relations and generating functions
Solutios to Exercises Chapter 4: Recurrece relatios ad geeratig fuctios 1 (a) There are seatig positios arraged i a lie. Prove that the umber of ways of choosig a subset of these positios, with o two chose
More informationStatistical inference: example 1. Inferential Statistics
Statistical iferece: example 1 Iferetial Statistics POPULATION SAMPLE A clothig store chai regularly buys from a supplier large quatities of a certai piece of clothig. Each item ca be classified either
More information