Inequalities for Entropies of Sets of Subsets of Random Variables
|
|
- Della Willis
- 5 years ago
- Views:
Transcription
1 Iequalities for Etropies of Sets of Subsets of Radom Variables Chao Tia AT&T Labs-Research Florham Par, NJ 0792, USA. Abstract Ha s iequality o the etropy rates of subsets of radom variables is a classic result i iformatio theory, which ofte fids its applicatio i multiuser iformatio theoretic problems. I this ote, we geeralize Ha s iequality to allow commo compoets amog the radom variables, or, i a equivalet maer, to replace the simple radom variables i Ha s iequality by subsets of radom variables. This additioal igrediet sigificatly complicates the matter ad the form of the resultat iequalities are rather differet from the origial Ha s iequality. Our proof oly relies o the sub-modularity property of the etropy fuctio ad the super-modularity property of the coditioal etropy fuctio. This ew set of iequalities also provides a ew li betwee Ha s iequality ad the -way sub-modularity iequality. I. INTRODUCTION Ha s iequality [1 o the etropy rates of subsets of radom variables is a classic result i iformatio theory. It essetially states that the average etropy rates of subsets decrease as the size of subset icreases [2 (p. 490). This iequality has foud applicatios i multi-user iformatio theoretic problems; e.g. [ [5. Ha s iequality, however, does ot aturally deal with commo compoets amog radom variables efficietly. For example, cosider two radom variables 1 V 1 = {W 1, W 12 } ad V 2 = {W 2, W 12 }, W 12 is the commo compoet betwee them. The a simple applicatio of Ha s iequality to the radom variables V 1 ad V 2, which i this case is equivalet to the o-egativity of mutual iformatio, gives H(V 1 ) + H(V 2 ) H(V 1, V 2 ). (1) This is ot a good lower boud for H(V 1 ) + H(V 2 ) for the radom variable uder cosideratio, as ca be see easily H(V 1 ) + H(V 2 ) H(V 1, V 2 ) + H(W 12 ). (2) I fact, (2) is simply the sub-modularity property of the etropy fuctio [6. The iequality (2) ca ideed be reached by applyig Ha s iequality i its coditioal form, yet a atural questio arises from this simple example: what is the form of the geeralized Ha s iequality which taes ito accout of the commo compoets? I this ote, we provide exactly such a ew set of iequalities. 1 Throughout this ote, { } is used to deote the collectios of radom variables, ad the resultig radom variable, such as V 1 ad V 2, is defied o the product of the alphabet of each of its elemets. The same questio ca be cosidered from aother perspective, that is: what is Ha s iequality whe the radom variables are i fact subsets of radom variables, istead of simple radom variables? I the above example, V 1 ad V 2 are themselves subsets of the set {W 1, W 2, W 12 }. Sice both perspectives may be of iterest, we will preset the mai theorem i two equivalet forms. The proof of this ew set of iequalities higes oly o the sub-modular property of the etropy fuctio, ad it relies o aother iequality previously discovered i [7, amely, the - way sub-modularity iequality. As a cosequece, this ew set of iequalities provides a coectio betwee Ha s iequality ad the -way sub-modularity iequality, as they are special cases of a wider spectrum of iequalities regardig subsets of radom variables. I additio to the well-ow Ha s iequalities, iequalities o the etropies of subsets of radom variables have bee cosidered i other wors, e.g. [8, [9. The ew iequalities we preset i this wor do ot appear to be icluded i these existig iequalities, though the itersectio-cover problem cosidered i those wor is ideed closely related to the proof idea of our mai result. This coectio is hardly surprisig, sice all these results are directly related to sub-modularity fuctios, which aturally appear i the itersectio-cover ad related coutig problems. The rest of this ote is orgaized as follows. I Sectio II, we first preset the mai results o the ew set of iequalities, ad the discuss its relatioship with Ha s iequality ad the -way sub-modular iequality. The proofs are give i Sectio III, ad Sectio IV gives a few cocludig remars. II. MAIN RESULT The set {1, 2,..., } is writte as I, ad its power set (i.e., the collectio of all its subsets) is writte as P(I ). Defie ˆP(I ) = P(I ) \ { }, i.e., ˆP(I ) is the collectio of all subsets of I excludig the empty set. For a set A, we write its cardiality as A. For simplicity, we state the results oly for discrete radom variables with fiite alphabets for which the etropy fuctios are always well-defied, however, they ca be exteded to cotiuous radom variables (or mixed radom variables) with well-defied differetial etropy fuctios. Theorem 1: Let {W A, A ˆP(I )} be a set of 2 1 discrete radom variables joitly distributed accordig to some
2 W 1 Fig. 1. W 1 W 12 W12 W2 W 2 W Subsets ad their relatio. probability mass fuctio o some fiite alphabets. Defie The h () = 1 ( ) A ˆP(I ): A = H(W A (j)), () W A (j) {W B : B A j} (4) h () 1 h () 2 h (). (5) We ca uderstad the set of radom variables {W B : i B}, i = 1, 2,...,, (6) as radom variables with certai commo compoets, or as subsets of radom variables istead of simple radom variables; see. Fig. 1 for a illustratio whe =. To mae this more explicit, it is beeficial to preset a alterative statemet of Theorem 1. Theorem 1 : Let {W i, i = 1, 2,..., N} be a set of radom variables joitly distributed accordig to some probability mass fuctio o some fiite alphabets. Let C i, i = 1, 2,..., be subsets of I N. Defie h () = 1 ( ) W A(j) W, the A ˆP(I ): A = {i 1,i 2,...,i j} A H(W A(j)) (7) (C i1 C i2 C ij ), (8) h () 1 h () 2 h (). (9) It is straightforward to verify that Theorem 1 ad Theorem 1 are equivalet. This result essetially provides the relatio amog the average etropy rates of the fixed cardiality itersectios of subsets of radom variables, however with special cosideratio of the specified commo parts. It should be oted that there is a layered structure i W A (j), which is geerated by taig itersectio of differet umber of subsets of a set. The followig results are complemetary to Theorem 1, i a similar maer as those to Ha s iequality [2 (pp ). Theorem 2: Let {W A, A ˆP(I )} be a set of 2 1 discrete radom variables joitly distributed accordig to some probability mass fuctio. Defie g () = 1 ( ) A ˆP(I ): A = W c A (j) = W I (1) \ W A (j). The H(W A (j) WA(j)), c (10) g () 1 g () 2 g (). (11) Combiig Theorem 1 ad Theorem 2, we have the followig theorem. Theorem : Let {W A, A ˆP(I )} be a set of 2 1 discrete radom variables joitly distributed accordig to some probability mass fuctio. Defie The f () = 1 ( ) A ˆP(I ): A = I(W A (j); WA(j)) c (12) f () 1 f () 2 f (). (1) As a special case to Theorem 1, we ca recover Ha s iequality o subsets, by lettig W A be a costat for all A > 1, for which W {i} ca be coveietly writte as W i. Propositio 4: Let {W i } be a set of discrete radom variables joitly distributed accordig to some probability mass fuctio. Defie h () = 1 ( ) H({W i : i A}). (14) The A ˆP(I ): A = h () 1 h () 2 h (). (15) As aother special case to Theorem 1, we ca recover the -way sub-modularity iequality [7, which is the followig propositio. Propositio 5: Let {W A, A ˆP(I )} be a set of 2 1 discrete radom variables joitly distributed accordig to some probability mass fuctio. The H({W B : i B}) H({W B : B j}). (16) The left had side of (16) is simply h () 1 ad the right had side is simply h (). For this reaso, it is temptig to state Propositio 5 as a corollary of Theorem 1. However, we refrai from doig so because Propositio 5 i fact plays a istrumetal role i our proof of Theorem 1. The proof of Propositio 5 ca be foud i [7. It should be oted that though Ha s iequality ad the -way sub-modularity iequality ca be recovered this way, this does ot mea Theorem 1 is stroger. Ideed the ew
3 [ 1 H(W 1, W 12, W 1, W 12 ) + H(W 2, W 12, W 2, W 12 ) + H(W, W 1, W 2, W 12 ) H(W 1, W 2, W 12, W 1, W 2, W 12 ) + H(W 12, W 12 ) + H(W 1, W, W 12, W 1, W 2, W 12 ) + H(W 1, W 12 ) 6 + H(W 2, W, W 12, W 1, W 2, W 12 ) + H(W 2, W 12 ) H(W 1, W 2, W, W 12, W 1, W 2, W 12 ) + H(W 12, W 1, W 2, W 12 ) + H(W 12 ) (17) [ 1 H(W 1, W 12, W 1, W 12 ) + H(W 2, W 12, W 2, W 12 ) + H(W, W 1, W 2, W 12 ) H(W 1, W 2, W 12, W 1, W 2, W 12 ) + H(W 1, W, W 12, W 1, W 2, W 12 ) + H(W 2, W, W 12, W 1, W 2, W 12 ) 6 1 H(W 1, W 2, W, W 12, W 1, W 2, W 12 ) (18) set of iequalities, or rather its geeral form o sub-modular fuctios (give i the ext sectio) ca be specialized to the -way sub-modularity iequality, however, sice the - way sub-modularity iequality is sufficiet to prove the ew set of iequalities, they are completely equivalet for geeral sub-modular fuctios. The ew set of iequalities o etropy fuctio ca be specialized to Ha s equality, yet the coditioal versio of Ha s iequality implies the sub-modularity of the etropy fuctio, ad thus the ew set of iequalities i its etropy form ad the coditioal versio of Ha s iequality are equivalet. I the laguage of classificatio of iformatio iequalities, these iequalities are all Shao type iequalities [10. Despite this relatioship, it is our hope that this ew set of iequalities may fid its applicatios i the future, just as Ha s iequality fids applicatios i [ [5 some 20 or 0 years after its discovery. Example: Cosider =, ad the radom variables i Theorem 1 are {W 1, W 2, W, W 12, W 1, W 2, W 12 }, for simplicity we have writte W {1,2,} as W 12, ad similarly for W {i,j} ad W {i} ; see Fig. 1. Theorem 1 the gives (17) o the top of this page. We ca also aively apply Ha s iequality o the three sets of radom variables, ad treat each of them as a radom variable, T 1 = {W 1, W 12, W 1, W 12 } T 2 = {W 2, W 12, W 2, W 12 } T = {W, W 1, W 2, W 12 }, which gives (18) o the top of this page. Note that whe all the radom variables are idepedet, (17) becomes equalities, however, (18) will ot give equalities i geeral. The form of (17) is ot obvious, particularly the coefficiets of the etropies are ot easy to determie a priori. III. PROOFS OF THE THEOREMS It is well ow that the etropy fuctio is sub-modular, thus the followig theorem regardig sub-modular fuctios suffices for the proof of Theorem 1. For otatioal simplicity, we reserve the calligraphic letters A, A ad B for o-empty subset of I, i.e., A ˆP(I ) (ad similarly for A ad B), ad will ot explicitly iclude this coditio from here o. Theorem 6: Let θ be a submodular fuctio o sets, i.e., for ay two sets C 1 ad C 2, Defie the θ(c 1 ) + θ(c 2 ) θ(c 1 C 2 ) + θ(c 1 C 2 ). (19) θ () 1 ( ) A: A = θ({b : B A j}), (20) θ () 1 θ () 2 θ (), (21) Note here C 1 ad C 2 should be uderstood as sets of subsets i the cotext of Theorem 1. We will eed the followig lemma from [7 to prove Theorem 6. It is clear that Propositio 5 follows directly from this lemma. Lemma 1 ([7 -way sub-modularity): Let θ be a submodular fuctio, the θ(c i ) θ(c, ), (22) C, =1 {j 1,j 2,...,j } I (C j1 C j2 C j ). (2) Proof of Theorem 6:
4 We first prove that θ () θ () 1. For otatioal simplicity, A i is used to deote I \ {i} for i = 1, 2,...,. By Lemma 1 we ca write for a fixed j that θ({b : B A i j}) We claim that C (j) i C (j) i = A =i θ(c (j) i ), (24) m A {B : B A m j}. (25) { {B : B j} i + j {B : B j + 1} i + j > (26) To see this, observe that due to its complete symmetry, C (j) i must be i the form {B : B v} for some iteger v. Clearly v j because of the special form of C (j) i. Furthermore, sice ay B that has at least j + 1 elemets i I, it must have at least j elemets i A i for i = 1, 2,...,, i.e., {B : B A i j} {B : B j + 1}, (27) it is clear that v j + 1. Next we show that v = j if ad oly if i + j. If i + j, the let us cosider a special choice of A A = {, 1,..., i + 1}, (28) ad thus for this choice I j {B : B A m j} (29) m A because I j {B : B A m j}, m =, 1,..., i + 1. (0) Thus v = j for this case. Next we show that if i + j >, the there does ot exist a set A such that (29) ca hold, ad it will follow that I j / C (j) i, ad thus v = j+1 for this case. We prove this by cotradictio. For (29) to hold, it must be true that This implies that I j {B : B A m j}, m A. (1) I j A m, m A. (2) However there are oly a total of j possible choices of A m such that I j A m, but at the same time A = i > j by assumptio. Thus a cotradictio arises by the pigeohole priciple. Thus (26) is ideed true. We ca ow write ( 1)θ () 1 = = 1 θ({b : B A i j}) 1 θ({b : B A i j}) 1 ( j)θ({b : B j}) + jθ({b : B j + 1}) = ( 1) θ({b : B j}) = ( 1)θ (), () which completes the proof for θ () θ () 1. To prove θ () θ () 1 for, we tae a similar approach as used i [2 (p. 491). We first limit the choice of A ad B to a -elemet subset of I, ad the taig a uiform choice over its ( 1)-elemet subsets. For each such -elemet subset, θ () θ () 1, ad the iequality remais true after taig the expectatio over all -elemet subset chose uiformly from I. This completes the proof. Theorem 1 ow directly follows from Theorem 6. Clearly, if the sub-modular fuctios i Theorem 6 are replaced by supermodular fuctios, the directio of the iequalities are simply reversed. With this observatio, Theorem 2 follows directly from the super-modularity of the coditioal etropy fuctio H(C C c ), C c = Ω \ C is the complemet of set C. This ca be see as follows. H(C 1 C c 1) + H(C 2 C c 2) = 2H(Ω) H(C c 1) H(C c 2) 2H(Ω) H((C 1 C 2 ) c ) H((C 1 C 2 ) c ) = H(C 1 C 2 (C 1 C 2 ) c ) + H(C 1 C 2 (C 1 C 2 ) c ), (4) the iequality is by the sub-modularity of the etropy fuctio ad the fact C c 1 C c 2 = (C 1 C 2 ) c C c 1 C c 2 = (C 1 C 2 ) c. The proofs of Theorem, Propositio 4 ad Propositio 5 are trivial, ad thus omitted here. IV. CONCLUDING REMARKS We provided a ew set of iequalities, which geeralizes the classic Ha s iequality o etropy rates of subsets of radom variables to iclude commo compoets. These iequalities provide a li betwee Ha s iequality ad the -way submodularity iequality, both of which belog to this ew set of iequalities as special cases. Admittedly, this ew set of iequality has yet to fid applicatios i iformatio theoretical problems. These iequalities, however, are ideed motivated by oe of author s recet wors [11, ad the cosideratio to iclude commo compoets comes from the commo message requiremet i broadcast chael. It appears possible to simplify the rather legthy proof give i [11 with the help of this ew set of iformatio
5 iequalities. It remais to be see whether this ew set of iequalities ca fid its applicatio else. REFERENCES [1 T. S. Ha, Noegative etropy measures of multivariate symmetric correlatios, Iform. Cotr., vol. 6, o. 2, pp , [2 T. M. Cover ad J. A. Thomas, Elemets of Iformatio Theory, New Yor: Wiley, [ A. Albaese, J. Blomer, J. Edmods, M. Luby, ad M. Suda, Priority ecodig trasmissio, IEEE Tras. Iformatio Theory, vol. 42, o. 6, pp , Nov [4 H. Wag ad P. Viswaath, Vector Gaussia multiple descriptio with two levels of receivers, IEEE Tras. Iformatio Theory, vol. 55, o. 1, pp , Ja [5 C. Tia, S. Mohajer, ad S. Diggavi, Approximatig the Gaussia multiple descriptio rate regio uder symmetric distortio costraits, IEEE Tras. Iformatio Theory, vol. 55, o. 8, pp , Aug [6 S. Fujishige, Polymatroidal depedece structure of a set of radom variables, Iform. Cotr., vol. 9, o. 1, pp , Oct [7 H. J. A. Harvey, R. Kleiberg, ad A. R. Lehma, O the capacity of iformatio etwors, IEEE Tras. Iformatio Theory, vol. 52, o. 6, pp , Ju [8 F. R. K. Chug, R. L. Graham, P. Fral, ad J. B. Shearer, Some itersectio theorems for ordered sets ad graphs, J. Combiatorial Theory, Ser. A, vol. 52, pp. 27, [9 M. Madima ad P. Tetali, Iformatio iequalities for joit distributios, with iterpretatios ad applicatios, IEEE Tras. Iformatio Theory, vol. 56, o. 6, pp , Ju [10 R. Yeug, A First Course i Iformatio Theory, Kluwer Academic/Pleum Publishers, New Yor, [11 C. Tia, Latet capacity regio: a case study o symmetric broadcast with commo messages, IEEE Tras. Iformatio Theory, vol. 57, o. 6, pp , Ju
Lecture 2. The Lovász Local Lemma
Staford Uiversity Sprig 208 Math 233A: No-costructive methods i combiatorics Istructor: Ja Vodrák Lecture date: Jauary 0, 208 Origial scribe: Apoorva Khare Lecture 2. The Lovász Local Lemma 2. Itroductio
More informationConvergence of random variables. (telegram style notes) P.J.C. Spreij
Covergece of radom variables (telegram style otes).j.c. Spreij this versio: September 6, 2005 Itroductio As we kow, radom variables are by defiitio measurable fuctios o some uderlyig measurable space
More informationMath 155 (Lecture 3)
Math 55 (Lecture 3) September 8, I this lecture, we ll cosider the aswer to oe of the most basic coutig problems i combiatorics Questio How may ways are there to choose a -elemet subset of the set {,,,
More informationDefinition 4.2. (a) A sequence {x n } in a Banach space X is a basis for X if. unique scalars a n (x) such that x = n. a n (x) x n. (4.
4. BASES I BAACH SPACES 39 4. BASES I BAACH SPACES Sice a Baach space X is a vector space, it must possess a Hamel, or vector space, basis, i.e., a subset {x γ } γ Γ whose fiite liear spa is all of X ad
More informationEntropy and Ergodic Theory Lecture 5: Joint typicality and conditional AEP
Etropy ad Ergodic Theory Lecture 5: Joit typicality ad coditioal AEP 1 Notatio: from RVs back to distributios Let (Ω, F, P) be a probability space, ad let X ad Y be A- ad B-valued discrete RVs, respectively.
More informationLecture Overview. 2 Permutations and Combinations. n(n 1) (n (k 1)) = n(n 1) (n k + 1) =
COMPSCI 230: Discrete Mathematics for Computer Sciece April 8, 2019 Lecturer: Debmalya Paigrahi Lecture 22 Scribe: Kevi Su 1 Overview I this lecture, we begi studyig the fudametals of coutig discrete objects.
More informationDisjoint Systems. Abstract
Disjoit Systems Noga Alo ad Bey Sudaov Departmet of Mathematics Raymod ad Beverly Sacler Faculty of Exact Scieces Tel Aviv Uiversity, Tel Aviv, Israel Abstract A disjoit system of type (,,, ) is a collectio
More informationProduct measures, Tonelli s and Fubini s theorems For use in MAT3400/4400, autumn 2014 Nadia S. Larsen. Version of 13 October 2014.
Product measures, Toelli s ad Fubii s theorems For use i MAT3400/4400, autum 2014 Nadia S. Larse Versio of 13 October 2014. 1. Costructio of the product measure The purpose of these otes is to preset the
More informationInfinite Sequences and Series
Chapter 6 Ifiite Sequeces ad Series 6.1 Ifiite Sequeces 6.1.1 Elemetary Cocepts Simply speakig, a sequece is a ordered list of umbers writte: {a 1, a 2, a 3,...a, a +1,...} where the elemets a i represet
More informationLecture Notes for Analysis Class
Lecture Notes for Aalysis Class Topological Spaces A topology for a set X is a collectio T of subsets of X such that: (a) X ad the empty set are i T (b) Uios of elemets of T are i T (c) Fiite itersectios
More informationLecture 27. Capacity of additive Gaussian noise channel and the sphere packing bound
Lecture 7 Ageda for the lecture Gaussia chael with average power costraits Capacity of additive Gaussia oise chael ad the sphere packig boud 7. Additive Gaussia oise chael Up to this poit, we have bee
More informationChapter 3. Strong convergence. 3.1 Definition of almost sure convergence
Chapter 3 Strog covergece As poited out i the Chapter 2, there are multiple ways to defie the otio of covergece of a sequece of radom variables. That chapter defied covergece i probability, covergece i
More informationLaw of the sum of Bernoulli random variables
Law of the sum of Beroulli radom variables Nicolas Chevallier Uiversité de Haute Alsace, 4, rue des frères Lumière 68093 Mulhouse icolas.chevallier@uha.fr December 006 Abstract Let be the set of all possible
More informationAxioms of Measure Theory
MATH 532 Axioms of Measure Theory Dr. Neal, WKU I. The Space Throughout the course, we shall let X deote a geeric o-empty set. I geeral, we shall ot assume that ay algebraic structure exists o X so that
More information62. Power series Definition 16. (Power series) Given a sequence {c n }, the series. c n x n = c 0 + c 1 x + c 2 x 2 + c 3 x 3 +
62. Power series Defiitio 16. (Power series) Give a sequece {c }, the series c x = c 0 + c 1 x + c 2 x 2 + c 3 x 3 + is called a power series i the variable x. The umbers c are called the coefficiets of
More informationSymmetric Two-User Gaussian Interference Channel with Common Messages
Symmetric Two-User Gaussia Iterferece Chael with Commo Messages Qua Geg CSL ad Dept. of ECE UIUC, IL 680 Email: geg5@illiois.edu Tie Liu Dept. of Electrical ad Computer Egieerig Texas A&M Uiversity, TX
More informationLecture 14: Graph Entropy
15-859: Iformatio Theory ad Applicatios i TCS Sprig 2013 Lecture 14: Graph Etropy March 19, 2013 Lecturer: Mahdi Cheraghchi Scribe: Euiwoog Lee 1 Recap Bergma s boud o the permaet Shearer s Lemma Number
More informationAdvanced Stochastic Processes.
Advaced Stochastic Processes. David Gamarik LECTURE 2 Radom variables ad measurable fuctios. Strog Law of Large Numbers (SLLN). Scary stuff cotiued... Outlie of Lecture Radom variables ad measurable fuctios.
More informationAn Introduction to Randomized Algorithms
A Itroductio to Radomized Algorithms The focus of this lecture is to study a radomized algorithm for quick sort, aalyze it usig probabilistic recurrece relatios, ad also provide more geeral tools for aalysis
More informationApplication to Random Graphs
A Applicatio to Radom Graphs Brachig processes have a umber of iterestig ad importat applicatios. We shall cosider oe of the most famous of them, the Erdős-Réyi radom graph theory. 1 Defiitio A.1. Let
More informationIf a subset E of R contains no open interval, is it of zero measure? For instance, is the set of irrationals in [0, 1] is of measure zero?
2 Lebesgue Measure I Chapter 1 we defied the cocept of a set of measure zero, ad we have observed that every coutable set is of measure zero. Here are some atural questios: If a subset E of R cotais a
More informationExercises 1 Sets and functions
Exercises 1 Sets ad fuctios HU Wei September 6, 018 1 Basics Set theory ca be made much more rigorous ad built upo a set of Axioms. But we will cover oly some heuristic ideas. For those iterested studets,
More informationw (1) ˆx w (1) x (1) /ρ and w (2) ˆx w (2) x (2) /ρ.
2 5. Weighted umber of late jobs 5.1. Release dates ad due dates: maximimizig the weight of o-time jobs Oce we add release dates, miimizig the umber of late jobs becomes a sigificatly harder problem. For
More informationLecture 11: Channel Coding Theorem: Converse Part
EE376A/STATS376A Iformatio Theory Lecture - 02/3/208 Lecture : Chael Codig Theorem: Coverse Part Lecturer: Tsachy Weissma Scribe: Erdem Bıyık I this lecture, we will cotiue our discussio o chael codig
More informationThe multiplicative structure of finite field and a construction of LRC
IERG6120 Codig for Distributed Storage Systems Lecture 8-06/10/2016 The multiplicative structure of fiite field ad a costructio of LRC Lecturer: Keeth Shum Scribe: Zhouyi Hu Notatios: We use the otatio
More informationSquare-Congruence Modulo n
Square-Cogruece Modulo Abstract This paper is a ivestigatio of a equivalece relatio o the itegers that was itroduced as a exercise i our Discrete Math class. Part I - Itro Defiitio Two itegers are Square-Cogruet
More informationCEE 522 Autumn Uncertainty Concepts for Geotechnical Engineering
CEE 5 Autum 005 Ucertaity Cocepts for Geotechical Egieerig Basic Termiology Set A set is a collectio of (mutually exclusive) objects or evets. The sample space is the (collectively exhaustive) collectio
More informationGoodness-of-Fit Tests and Categorical Data Analysis (Devore Chapter Fourteen)
Goodess-of-Fit Tests ad Categorical Data Aalysis (Devore Chapter Fourtee) MATH-252-01: Probability ad Statistics II Sprig 2019 Cotets 1 Chi-Squared Tests with Kow Probabilities 1 1.1 Chi-Squared Testig................
More informationThe random version of Dvoretzky s theorem in l n
The radom versio of Dvoretzky s theorem i l Gideo Schechtma Abstract We show that with high probability a sectio of the l ball of dimesio k cε log c > 0 a uiversal costat) is ε close to a multiple of the
More informationCommutativity in Permutation Groups
Commutativity i Permutatio Groups Richard Wito, PhD Abstract I the group Sym(S) of permutatios o a oempty set S, fixed poits ad trasiet poits are defied Prelimiary results o fixed ad trasiet poits are
More informationCHAPTER 5 SOME MINIMAX AND SADDLE POINT THEOREMS
CHAPTR 5 SOM MINIMA AND SADDL POINT THORMS 5. INTRODUCTION Fied poit theorems provide importat tools i game theory which are used to prove the equilibrium ad eistece theorems. For istace, the fied poit
More informationSequences and Series of Functions
Chapter 6 Sequeces ad Series of Fuctios 6.1. Covergece of a Sequece of Fuctios Poitwise Covergece. Defiitio 6.1. Let, for each N, fuctio f : A R be defied. If, for each x A, the sequece (f (x)) coverges
More informationDiscrete Mathematics for CS Spring 2007 Luca Trevisan Lecture 22
CS 70 Discrete Mathematics for CS Sprig 2007 Luca Trevisa Lecture 22 Aother Importat Distributio The Geometric Distributio Questio: A biased coi with Heads probability p is tossed repeatedly util the first
More informationIt is often useful to approximate complicated functions using simpler ones. We consider the task of approximating a function by a polynomial.
Taylor Polyomials ad Taylor Series It is ofte useful to approximate complicated fuctios usig simpler oes We cosider the task of approximatig a fuctio by a polyomial If f is at least -times differetiable
More informationMeasure and Measurable Functions
3 Measure ad Measurable Fuctios 3.1 Measure o a Arbitrary σ-algebra Recall from Chapter 2 that the set M of all Lebesgue measurable sets has the followig properties: R M, E M implies E c M, E M for N implies
More informationRandom Variables, Sampling and Estimation
Chapter 1 Radom Variables, Samplig ad Estimatio 1.1 Itroductio This chapter will cover the most importat basic statistical theory you eed i order to uderstad the ecoometric material that will be comig
More informationOptimally Sparse SVMs
A. Proof of Lemma 3. We here prove a lower boud o the umber of support vectors to achieve geeralizatio bouds of the form which we cosider. Importatly, this result holds ot oly for liear classifiers, but
More informationLecture 12: November 13, 2018
Mathematical Toolkit Autum 2018 Lecturer: Madhur Tulsiai Lecture 12: November 13, 2018 1 Radomized polyomial idetity testig We will use our kowledge of coditioal probability to prove the followig lemma,
More informationRecurrence Relations
Recurrece Relatios Aalysis of recursive algorithms, such as: it factorial (it ) { if (==0) retur ; else retur ( * factorial(-)); } Let t be the umber of multiplicatios eeded to calculate factorial(). The
More informationOn Random Line Segments in the Unit Square
O Radom Lie Segmets i the Uit Square Thomas A. Courtade Departmet of Electrical Egieerig Uiversity of Califoria Los Ageles, Califoria 90095 Email: tacourta@ee.ucla.edu I. INTRODUCTION Let Q = [0, 1] [0,
More informationSTAT Homework 1 - Solutions
STAT-36700 Homework 1 - Solutios Fall 018 September 11, 018 This cotais solutios for Homework 1. Please ote that we have icluded several additioal commets ad approaches to the problems to give you better
More informationThe Borel hierarchy classifies subsets of the reals by their topological complexity. Another approach is to classify them by size.
Lecture 7: Measure ad Category The Borel hierarchy classifies subsets of the reals by their topological complexity. Aother approach is to classify them by size. Filters ad Ideals The most commo measure
More informationChapter IV Integration Theory
Chapter IV Itegratio Theory Lectures 32-33 1. Costructio of the itegral I this sectio we costruct the abstract itegral. As a matter of termiology, we defie a measure space as beig a triple (, A, µ), where
More information(A sequence also can be thought of as the list of function values attained for a function f :ℵ X, where f (n) = x n for n 1.) x 1 x N +k x N +4 x 3
MATH 337 Sequeces Dr. Neal, WKU Let X be a metric space with distace fuctio d. We shall defie the geeral cocept of sequece ad limit i a metric space, the apply the results i particular to some special
More informationChapter 6 Infinite Series
Chapter 6 Ifiite Series I the previous chapter we cosidered itegrals which were improper i the sese that the iterval of itegratio was ubouded. I this chapter we are goig to discuss a topic which is somewhat
More informationAn analog of the arithmetic triangle obtained by replacing the products by the least common multiples
arxiv:10021383v2 [mathnt] 9 Feb 2010 A aalog of the arithmetic triagle obtaied by replacig the products by the least commo multiples Bair FARHI bairfarhi@gmailcom MSC: 11A05 Keywords: Al-Karaji s triagle;
More information4.3 Growth Rates of Solutions to Recurrences
4.3. GROWTH RATES OF SOLUTIONS TO RECURRENCES 81 4.3 Growth Rates of Solutios to Recurreces 4.3.1 Divide ad Coquer Algorithms Oe of the most basic ad powerful algorithmic techiques is divide ad coquer.
More informationRandom Walks on Discrete and Continuous Circles. by Jeffrey S. Rosenthal School of Mathematics, University of Minnesota, Minneapolis, MN, U.S.A.
Radom Walks o Discrete ad Cotiuous Circles by Jeffrey S. Rosethal School of Mathematics, Uiversity of Miesota, Mieapolis, MN, U.S.A. 55455 (Appeared i Joural of Applied Probability 30 (1993), 780 789.)
More informationIt is always the case that unions, intersections, complements, and set differences are preserved by the inverse image of a function.
MATH 532 Measurable Fuctios Dr. Neal, WKU Throughout, let ( X, F, µ) be a measure space ad let (!, F, P ) deote the special case of a probability space. We shall ow begi to study real-valued fuctios defied
More informationLecture 7: October 18, 2017
Iformatio ad Codig Theory Autum 207 Lecturer: Madhur Tulsiai Lecture 7: October 8, 207 Biary hypothesis testig I this lecture, we apply the tools developed i the past few lectures to uderstad the problem
More informationDiscrete Mathematics for CS Spring 2008 David Wagner Note 22
CS 70 Discrete Mathematics for CS Sprig 2008 David Wager Note 22 I.I.D. Radom Variables Estimatig the bias of a coi Questio: We wat to estimate the proportio p of Democrats i the US populatio, by takig
More informationPolynomials with Rational Roots that Differ by a Non-zero Constant. Generalities
Polyomials with Ratioal Roots that Differ by a No-zero Costat Philip Gibbs The problem of fidig two polyomials P(x) ad Q(x) of a give degree i a sigle variable x that have all ratioal roots ad differ by
More informationInformation Theory Tutorial Communication over Channels with memory. Chi Zhang Department of Electrical Engineering University of Notre Dame
Iformatio Theory Tutorial Commuicatio over Chaels with memory Chi Zhag Departmet of Electrical Egieerig Uiversity of Notre Dame Abstract A geeral capacity formula C = sup I(; Y ), which is correct for
More informationInjections, Surjections, and the Pigeonhole Principle
Ijectios, Surjectios, ad the Pigeohole Priciple 1 (10 poits Here we will come up with a sloppy boud o the umber of parethesisestigs (a (5 poits Describe a ijectio from the set of possible ways to est pairs
More informationNotes for Lecture 11
U.C. Berkeley CS78: Computatioal Complexity Hadout N Professor Luca Trevisa 3/4/008 Notes for Lecture Eigevalues, Expasio, ad Radom Walks As usual by ow, let G = (V, E) be a udirected d-regular graph with
More informationSummary and Discussion on Simultaneous Analysis of Lasso and Dantzig Selector
Summary ad Discussio o Simultaeous Aalysis of Lasso ad Datzig Selector STAT732, Sprig 28 Duzhe Wag May 4, 28 Abstract This is a discussio o the work i Bickel, Ritov ad Tsybakov (29). We begi with a short
More information2.4 Sequences, Sequences of Sets
72 CHAPTER 2. IMPORTANT PROPERTIES OF R 2.4 Sequeces, Sequeces of Sets 2.4.1 Sequeces Defiitio 2.4.1 (sequece Let S R. 1. A sequece i S is a fuctio f : K S where K = { N : 0 for some 0 N}. 2. For each
More informationLecture 3 The Lebesgue Integral
Lecture 3: The Lebesgue Itegral 1 of 14 Course: Theory of Probability I Term: Fall 2013 Istructor: Gorda Zitkovic Lecture 3 The Lebesgue Itegral The costructio of the itegral Uless expressly specified
More informationTopic 5: Basics of Probability
Topic 5: Jue 1, 2011 1 Itroductio Mathematical structures lie Euclidea geometry or algebraic fields are defied by a set of axioms. Mathematical reality is the developed through the itroductio of cocepts
More informationLargest families without an r-fork
Largest families without a r-for Aalisa De Bois Uiversity of Salero Salero, Italy debois@math.it Gyula O.H. Katoa Réyi Istitute Budapest, Hugary ohatoa@reyi.hu Itroductio Let [] = {,,..., } be a fiite
More informationMASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.265/15.070J Fall 2013 Lecture 21 11/27/2013
MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.265/15.070J Fall 2013 Lecture 21 11/27/2013 Fuctioal Law of Large Numbers. Costructio of the Wieer Measure Cotet. 1. Additioal techical results o weak covergece
More informationSOME THEORY AND PRACTICE OF STATISTICS by Howard G. Tucker
SOME THEORY AND PRACTICE OF STATISTICS by Howard G. Tucker CHAPTER 9. POINT ESTIMATION 9. Covergece i Probability. The bases of poit estimatio have already bee laid out i previous chapters. I chapter 5
More informationLecture 1: Basic problems of coding theory
Lecture 1: Basic problems of codig theory Error-Correctig Codes (Sprig 016) Rutgers Uiversity Swastik Kopparty Scribes: Abhishek Bhrushudi & Aditya Potukuchi Admiistrivia was discussed at the begiig of
More information1 Convergence in Probability and the Weak Law of Large Numbers
36-752 Advaced Probability Overview Sprig 2018 8. Covergece Cocepts: i Probability, i L p ad Almost Surely Istructor: Alessadro Rialdo Associated readig: Sec 2.4, 2.5, ad 4.11 of Ash ad Doléas-Dade; Sec
More informationMachine Learning Theory Tübingen University, WS 2016/2017 Lecture 12
Machie Learig Theory Tübige Uiversity, WS 06/07 Lecture Tolstikhi Ilya Abstract I this lecture we derive risk bouds for kerel methods. We will start by showig that Soft Margi kerel SVM correspods to miimizig
More informationSequences A sequence of numbers is a function whose domain is the positive integers. We can see that the sequence
Sequeces A sequece of umbers is a fuctio whose domai is the positive itegers. We ca see that the sequece 1, 1, 2, 2, 3, 3,... is a fuctio from the positive itegers whe we write the first sequece elemet
More informationLecture 2: April 3, 2013
TTIC/CMSC 350 Mathematical Toolkit Sprig 203 Madhur Tulsiai Lecture 2: April 3, 203 Scribe: Shubhedu Trivedi Coi tosses cotiued We retur to the coi tossig example from the last lecture agai: Example. Give,
More informationA statistical method to determine sample size to estimate characteristic value of soil parameters
A statistical method to determie sample size to estimate characteristic value of soil parameters Y. Hojo, B. Setiawa 2 ad M. Suzuki 3 Abstract Sample size is a importat factor to be cosidered i determiig
More informationFirst Year Quantitative Comp Exam Spring, Part I - 203A. f X (x) = 0 otherwise
First Year Quatitative Comp Exam Sprig, 2012 Istructio: There are three parts. Aswer every questio i every part. Questio I-1 Part I - 203A A radom variable X is distributed with the margial desity: >
More informationA sequence of numbers is a function whose domain is the positive integers. We can see that the sequence
Sequeces A sequece of umbers is a fuctio whose domai is the positive itegers. We ca see that the sequece,, 2, 2, 3, 3,... is a fuctio from the positive itegers whe we write the first sequece elemet as
More informationLecture 6: Source coding, Typicality, and Noisy channels and capacity
15-859: Iformatio Theory ad Applicatios i TCS CMU: Sprig 2013 Lecture 6: Source codig, Typicality, ad Noisy chaels ad capacity Jauary 31, 2013 Lecturer: Mahdi Cheraghchi Scribe: Togbo Huag 1 Recap Uiversal
More informationSets. Sets. Operations on Sets Laws of Algebra of Sets Cardinal Number of a Finite and Infinite Set. Representation of Sets Power Set Venn Diagram
Sets MILESTONE Sets Represetatio of Sets Power Set Ve Diagram Operatios o Sets Laws of lgebra of Sets ardial Number of a Fiite ad Ifiite Set I Mathematical laguage all livig ad o-livig thigs i uiverse
More informationMath 220A Fall 2007 Homework #2. Will Garner A
Math 0A Fall 007 Homewor # Will Garer Pg 3 #: Show that {cis : a o-egative iteger} is dese i T = {z œ : z = }. For which values of q is {cis(q): a o-egative iteger} dese i T? To show that {cis : a o-egative
More informationHoggatt and King [lo] defined a complete sequence of natural numbers
REPRESENTATIONS OF N AS A SUM OF DISTINCT ELEMENTS FROM SPECIAL SEQUENCES DAVID A. KLARNER, Uiversity of Alberta, Edmoto, Caada 1. INTRODUCTION Let a, I deote a sequece of atural umbers which satisfies
More informationIP Reference guide for integer programming formulations.
IP Referece guide for iteger programmig formulatios. by James B. Orli for 15.053 ad 15.058 This documet is iteded as a compact (or relatively compact) guide to the formulatio of iteger programs. For more
More informationCS284A: Representations and Algorithms in Molecular Biology
CS284A: Represetatios ad Algorithms i Molecular Biology Scribe Notes o Lectures 3 & 4: Motif Discovery via Eumeratio & Motif Represetatio Usig Positio Weight Matrix Joshua Gervi Based o presetatios by
More informationSummary: Congruences. j=1. 1 Here we use the Mathematica syntax for the function. In Maple worksheets, the function
Summary: Cogrueces j whe divided by, ad determiig the additive order of a iteger mod. As described i the Prelab sectio, cogrueces ca be thought of i terms of coutig with rows, ad for some questios this
More informationON POINTWISE BINOMIAL APPROXIMATION
Iteratioal Joural of Pure ad Applied Mathematics Volume 71 No. 1 2011, 57-66 ON POINTWISE BINOMIAL APPROXIMATION BY w-functions K. Teerapabolar 1, P. Wogkasem 2 Departmet of Mathematics Faculty of Sciece
More informationTHE ASYMPTOTIC COMPLEXITY OF MATRIX REDUCTION OVER FINITE FIELDS
THE ASYMPTOTIC COMPLEXITY OF MATRIX REDUCTION OVER FINITE FIELDS DEMETRES CHRISTOFIDES Abstract. Cosider a ivertible matrix over some field. The Gauss-Jorda elimiatio reduces this matrix to the idetity
More informationThe Maximum-Likelihood Decoding Performance of Error-Correcting Codes
The Maximum-Lielihood Decodig Performace of Error-Correctig Codes Hery D. Pfister ECE Departmet Texas A&M Uiversity August 27th, 2007 (rev. 0) November 2st, 203 (rev. ) Performace of Codes. Notatio X,
More informationOutput Analysis and Run-Length Control
IEOR E4703: Mote Carlo Simulatio Columbia Uiversity c 2017 by Marti Haugh Output Aalysis ad Ru-Legth Cotrol I these otes we describe how the Cetral Limit Theorem ca be used to costruct approximate (1 α%
More informationRademacher Complexity
EECS 598: Statistical Learig Theory, Witer 204 Topic 0 Rademacher Complexity Lecturer: Clayto Scott Scribe: Ya Deg, Kevi Moo Disclaimer: These otes have ot bee subjected to the usual scrutiy reserved for
More informationMASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 19 11/17/2008 LAWS OF LARGE NUMBERS II THE STRONG LAW OF LARGE NUMBERS
MASSACHUSTTS INSTITUT OF TCHNOLOGY 6.436J/5.085J Fall 2008 Lecture 9 /7/2008 LAWS OF LARG NUMBRS II Cotets. The strog law of large umbers 2. The Cheroff boud TH STRONG LAW OF LARG NUMBRS While the weak
More informationChapter 0. Review of set theory. 0.1 Sets
Chapter 0 Review of set theory Set theory plays a cetral role i the theory of probability. Thus, we will ope this course with a quick review of those otios of set theory which will be used repeatedly.
More informationLecture 8: Convergence of transformations and law of large numbers
Lecture 8: Covergece of trasformatios ad law of large umbers Trasformatio ad covergece Trasformatio is a importat tool i statistics. If X coverges to X i some sese, we ofte eed to check whether g(x ) coverges
More informationRiesz-Fischer Sequences and Lower Frame Bounds
Zeitschrift für Aalysis ud ihre Aweduge Joural for Aalysis ad its Applicatios Volume 1 (00), No., 305 314 Riesz-Fischer Sequeces ad Lower Frame Bouds P. Casazza, O. Christese, S. Li ad A. Lider Abstract.
More informationLarge holes in quasi-random graphs
Large holes i quasi-radom graphs Joaa Polcy Departmet of Discrete Mathematics Adam Mickiewicz Uiversity Pozań, Polad joaska@amuedupl Submitted: Nov 23, 2006; Accepted: Apr 10, 2008; Published: Apr 18,
More informationShannon s noiseless coding theorem
18.310 lecture otes May 4, 2015 Shao s oiseless codig theorem Lecturer: Michel Goemas I these otes we discuss Shao s oiseless codig theorem, which is oe of the foudig results of the field of iformatio
More information6 Integers Modulo n. integer k can be written as k = qn + r, with q,r, 0 r b. So any integer.
6 Itegers Modulo I Example 2.3(e), we have defied the cogruece of two itegers a,b with respect to a modulus. Let us recall that a b (mod ) meas a b. We have proved that cogruece is a equivalece relatio
More informationFall 2013 MTH431/531 Real analysis Section Notes
Fall 013 MTH431/531 Real aalysis Sectio 8.1-8. Notes Yi Su 013.11.1 1. Defiitio of uiform covergece. We look at a sequece of fuctios f (x) ad study the coverget property. Notice we have two parameters
More informationMultiterminal source coding with complementary delivery
Iteratioal Symposium o Iformatio Theory ad its Applicatios, ISITA2006 Seoul, Korea, October 29 November 1, 2006 Multitermial source codig with complemetary delivery Akisato Kimura ad Tomohiko Uyematsu
More informationLecture 9: Expanders Part 2, Extractors
Lecture 9: Expaders Part, Extractors Topics i Complexity Theory ad Pseudoradomess Sprig 013 Rutgers Uiversity Swastik Kopparty Scribes: Jaso Perry, Joh Kim I this lecture, we will discuss further the pseudoradomess
More informationTopic 9: Sampling Distributions of Estimators
Topic 9: Samplig Distributios of Estimators Course 003, 2018 Page 0 Samplig distributios of estimators Sice our estimators are statistics (particular fuctios of radom variables), their distributio ca be
More informationMa 530 Infinite Series I
Ma 50 Ifiite Series I Please ote that i additio to the material below this lecture icorporated material from the Visual Calculus web site. The material o sequeces is at Visual Sequeces. (To use this li
More information1 Introduction to reducing variance in Monte Carlo simulations
Copyright c 010 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 ukow mea µ = E(X) of a distributio by
More informationOnline hypergraph matching: hiring teams of secretaries
Olie hypergraph matchig: hirig teams of secretaries Rafael M. Frogillo Advisor: Robert Kleiberg May 29, 2008 Itroductio The goal of this paper is to fid a competitive algorithm for the followig problem.
More informationLecture 6 Simple alternatives and the Neyman-Pearson lemma
STATS 00: Itroductio to Statistical Iferece Autum 06 Lecture 6 Simple alteratives ad the Neyma-Pearso lemma Last lecture, we discussed a umber of ways to costruct test statistics for testig a simple ull
More informationResampling Methods. X (1/2), i.e., Pr (X i m) = 1/2. We order the data: X (1) X (2) X (n). Define the sample median: ( n.
Jauary 1, 2019 Resamplig Methods Motivatio We have so may estimators with the property θ θ d N 0, σ 2 We ca also write θ a N θ, σ 2 /, where a meas approximately distributed as Oce we have a cosistet estimator
More information1 The Haar functions and the Brownian motion
1 The Haar fuctios ad the Browia motio 1.1 The Haar fuctios ad their completeess The Haar fuctios The basic Haar fuctio is 1 if x < 1/2, ψx) = 1 if 1/2 x < 1, otherwise. 1.1) It has mea zero 1 ψx)dx =,
More informationBasics of Probability Theory (for Theory of Computation courses)
Basics of Probability Theory (for Theory of Computatio courses) Oded Goldreich Departmet of Computer Sciece Weizma Istitute of Sciece Rehovot, Israel. oded.goldreich@weizma.ac.il November 24, 2008 Preface.
More information