Order statistics and concentration of l r norms for log-concave vectors
|
|
- Morris Townsend
- 8 years ago
- Views:
Transcription
1 Order statistics and concentration of l r norms for log-concave vectors Rafa l Lata la Abstract We establish upper bounds for tails of order statistics of isotropic log-concave vectors and apply them to derive a concentration of l r norms of such vectors. 1 Introduction and notation An n dimensional random vector is called log-concave if it has a log-concave distribution, i.e. for any compact nonempty sets A, B R n and λ 0, 1, PX λa + 1 λb PX A λ PX B 1 λ, where λa+1 λb = {λx+1 λy : x A, y B}. By the result of Borell [3] a vector X with full dimensional support is log-concave if and only if it has a density of the form e f, where f : R n, ] is a convex function. Log-concave vectors are frequently studied in convex geometry, since by the Brunn-Minowsi inequality uniform distributions on convex sets as well as their lower dimensional marginals are log-concave. A random vector X = X 1,..., X n is isotropic if EX i = 0 and CovX i, X j = δ i,j for all i, j n. Equivalently, an n-dimensional random vector with mean zero is isotropic if E t, X 2 = t 2 for any t R n. For any nondegenerate AMS 2010 Mathematics Subject Classification: 60E15 52A38, 60B11. Key words and phrases: log-concave measures, order statistics, concentration of volume. Research partially supported by MNiSW Grant no. N N and the Foundation for Polish Science. Institute of Mathematics, University of Warsaw, Banacha 2, Warszawa, Poland and Institute of Mathematics, Polish Academy of Sciences, ul. Śniadecich 8, Warszawa, Poland, rlatala@mimuw.edu.pl. 1
2 log-concave vector X there exists an affine transformation T such that T X is isotropic. In recent years there were derived numerous important properties of logconcave vectors. One of such results is the Paouris concentration of mass [10] that states that for any isotropic log-concave vector X in R n, P X Ct n exp t n for t 1. 1 One of purposes of this paper is the extension of the Paouris result to l r norms, that is deriving upper bounds for P X r t, where x r = n x i r 1/r. For r [1, 2 this is an easy consequence of 1 and Hölder s inequality, however the case r > 2 requires in our opinion new ideas. We show that P X r Crtn 1/r exp tn 1/r for t 1, r > 2, where Cr is a constant depending only on r see Theorem 8. Our method is based on suitable tail estimates for order statistics of X. For an n dimensional random vector X by X1 X 2... X n we denote the nonincreasing rearrangement of X 1,..., X n in particular X1 = max{ X 1,..., X n } and Xn = min{ X 1,..., X n }. Random variables X, 1 n, are called order statistics of X. By 1 we immediately get for isotropic log-concave vectors X, PX t exp 1 t C for t C n/. The main result of the paper is Theorem 3 which states that the above inequality holds for t C logen/ as shows the example of exponential distribution this range of t is for n/2 optimal up to a universal constant. Tail estimates for order statistics can be also applied to provide optimal estimates for sup #I=m P I X, where the supremum is taen over all subsets of {1,..., n} of cardinality m [1, n] and P I denotes the coordinatewise projection. The details will be presented in the forthcoming paper [1]. The organization of the article is as follows. In Section 2 we discuss upper bounds for tails of order statistics and their connections with exponential concentration and Paouris result. Section 3 is devoted to the derivation of tail estimates of l r norms for log-concave vectors. Finally Section 4 contains a proof of Theorem 4, which is a crucial tool used to derive our main result. Throughout the article by C, C 1,... we denote universal constants. Values of a constant C may differ at each occurence. For x R n we put x = x 2 = n x2 i 1/2. 2
3 2 Tail estimates for order statistics If the coordinates of X are independent symmetric exponential random variables with variance one then it is not hard to see that MedX 1 C logen/ for any 1 n/2. So we may obtain a reasonable bound for PX t, n/2 in the case of isotropic log-concave vectors only for t 1 C logen/. Using the idea that exponential random vectors are extremal in the class of unconditional log-concave vectors i.e. such vectors that η 1 X 1,..., η n X n has the same distribution as X for any choice of signs η i { 1, 1} one may easily derive the following fact. Proposition 1. If X is a log-concave and unconditional n-dimensional isotropic random vector then PX t exp 1 C t en for t C log. Proof. The result of Bobov and Nazarov [2] implies that for any i 1 < i 2 <... < i and t > 0, P X i1 t,..., X i t = 2 PX i1 t,..., X i t 2 exp 1 C t. Hence PX t 1 i 1 <...<i n 2en if t C logen/. P X i1 t,..., X i t exp 1 C t exp 1 2C t n 2 exp 1 C t However for a general isotropic log-concave vector without unconditionality assumption we may bound PX i1 t,..., X i t only by exp t/c for t C. This suggests that we should rather expect bound exp t/c than exp t/c. If we try to apply the union bound as in the proof of Proposition 1 it will wor only for t C logen/. Another approach may be based on the exponential concentration. We say that a vector X satisfies exponential concentration inequality with a constant α if for any Borel set A, PX A + αtb n 2 1 exp t if PX A 1 2 and t > 0. 3
4 Proposition 2. If the coordinates of an n-dimensional vector X have mean zero and variance one and X satisfies exponential concentration inequality with a constant α 1 then PX t exp 1 t 3α en for t 8α log. Proof. Since VarX i = 1 we have P X i 2 1/2 so P X i 2 + t exp t/α for t > 0. Let µ be the distribution of X. Then the set At = { x R n : #{i: x i t} < } 2 has measure µ at least 1/2 for t 4α logen/ indeed we have for such t 1 µat = P 1 { Xi t} 2 2 E 2n exp t 2n en 2 1 2α 2. 1 { Xi t} Let A = A4α logen/. If z = x + y A + sb2 n then less than /2 of x i s are bigger than 4α logen/ and less than /2 of y i s are bigger than 2s, so en P X 4α log + 2s 1 µa + sb2 n exp 1 s. α For log-concave vectors it is nown that exponential inequality is equivalent to several other functional inequalities such as Cheeger s and spectral gap see [9] for a detailed discussion and recent results. The strong conjecture due to Kannan, Lovász and Simonovits [6] states that every isotropic log-concave vector satisfies Cheeger s and therefore also exponential inequality with a uniform constant. The conjecture however is wide open a recent result of Klartag [7] shows that in the unconditional case KLS conjecture holds up to log n constant see also [5] for examples of nonproduct distributions that satisfy spectral gap inequality with uniform constants. Best nown upper bound for Cheeger s constant for general isotropic logconcave measure is n α for some α 1/4, 1/2 see [9] and [4]. The main result of this paper states that despite the approach via the union bound or exponential concetration fails the natural estimate for order statistics is valid. Namely we have 4
5 Theorem 3. Let X be an n-dimensional log-concave isotropic vector. Then PX t exp 1 en t for t C log. C Our approach is based on the suitable estimate of moments of the process N X t, where N X t := 1 {Xi t}, t 0. Theorem 4. For any isotropic log-concave vector X and p 1 we have nt Et 2 N X t p Cp 2p 2 for t C log p 2. We postpone a long and bit technical proof till the last section of the paper. Let us only mention at this point that it is based on two ideas. One is the Paouris large deviation inequality 1 and another is an observation that if we restrict a log-concave distribution to a convex set it is still log-concave. Proof of Theorem 3. Observe that X t implies that N Xt /2 or N X t /2 and vector X is also isotropic and log-concave. So by Theorem 4 and Chebyshev s inequality we get 2 penx PX t t p + EN X t p Cp 2p 2 t provided that t C lognt 2 /p 2. So it is enough to tae p = 1 ec t and notice that the restriction on t follows by the assumption that t C logen/. As we already noticed one of the main tools in the proof of Theorem 4 is the Paouris concentration of mass. One may however also do the opposite and derive large deviations for the Euclidean norm of X from our estimate of moments of N X t and the observation that the distribution of UX is again log-concave and isotropic for any rotation U. More precisely the following statement holds. Proposition 5. Suppose that X is a random vector in R n such that for some constants A 1, A 2 < and any U On, E t 2 N UX t l A1 l 2l for t A 2, l n. Then P X t n exp 1 t n CA 1 for t max{ca 1, A 2 }. 5
6 Proof. Let us fix t A 2. Hölder s inequality gives that for any U 1,..., U n On, E l l N Ui Xt EN Ui Xt l 1/l A1 l 2l for l n. t Now let U 1,..., U l be independent random rotations in On distributed according to the Haar measure then for l n, A1 l t 2l l EX E U N Ui Xt = E X E U1 N U1 Xt l = E X np Y X, Y t l = n l E X P Y X Y 1 t l, where Y is a random vector uniformly distributed on S n 1. Since Y 1 is symmetric, EY1 2 = 1/n and EY 4 1 C/n2 we get by the Paley-Zygmund inequality that PY n 1/C 1 which gives P X 2t n E X C1 P Y X Y 1 t l C1 A 2 1 l2 l. t 2 n To conclude the proof it is enough to tae l = 1 ec1 A 1 nt. 3 Concentration of l r norms The aim of this section is to derive Paouris type estimates for concentration of X r = n X i r 1/r. We start with presenting two simple examples. Example 1. Let the coordinates of X be independent symmetric exponential r.v s with variance one. Then E X r r 1/r = ne X 1 r 1/r 1 C rn1/r for r [1,, and E X 1 C log n E X p r 1/p E X 1 p 1/p p C for p 2, r 1. 6
7 It is also nown that in the independent exponential case wea and strong moments are comparable [8], hence for r 2, E X r r 1/r = E Therefore we get sup a r 1 i E X 2 r 1/2 + C E X 2 r 1/2 + Cr a i X i r 1/r sup E a r 1 i sup E a r 1 i a i X i r 1/r a i X i 2 1/2 E X 2 r 1/r + Cr. E X p r 1/p E X 2 r 1/2 1 C rn1/r for p 2 and n C r. Example 2. For 1 r 2 let X be an isotropic random vector such that Y = X X n / n has the exponential distribution with variance one. Then by Hölder s inequality X r n 1/r 1/2 Y and E X p r 1/p n 1/r 1/2 Y p 1 C n1/r 1/2 p for p 2, 1 r 2. and The examples above show that the best we can hope is E X p r 1/p Cn 1/r + n 1/r 1/2 p for p 2, 1 r 2, 2 E X p r 1/p Crn 1/r + p for p 2, r [2, 3 Or in terms of tails, E X p 1/p Clog n + p for p 2. 4 P X r t exp 1 C tn1/2 1/r for t Cn 1/r, r [1, 2], 5 P X r t exp 1 C t for t Crn 1/r, r [2, 6 and P X t exp 1 C t for t C log n. 7 Case r [1, 2] is a simple consequence of the Paouris theorem. 7
8 Proposition 6. Estimates 2 and 5 hold for all isotropic log-concave vectors X. Proof. We have X r n 1/r 1/2 X 2 by Hölder s inequality, hence 2 and therefore also 5 immediately follows by the Paouris result. Case r = is also very simple Proposition 7. Estimates 4 and 7 hold for all isotropic log-concave vectors X. Proof. We have P X t P X i t n exp t/c. What is left is the case 2 < r < we would lie to obtain 6 and 3. We almost get it except that constants explode when r approaches 2. Theorem 8. For any δ > 0 there exist constants C 1 δ, C 2 δ C1+δ 1/2 such that for any r 2 + δ, P X r t exp 1 C 1 δ t for t C 1 δrn 1/r and E X p r 1/p C 2 δ rn 1/r + p for p 2. The proof of Theorem 8 is based on the following slightly more precise estimate. Proposition 9. For r > 2 we have P X r t exp 1 r 2 1/rt C r or in terms of moments r 1/rlog E X p r 1/p C rn 1/r + n + p r 2 r 1/r for t C rn 1/r + log n r 2 for p 2. 8
9 Proof. Let s = log 2 n. We have Theorem 3 yields P X r r = X r C r 3 log r en Xi r s 2 X 2 r. + t r exp 1 t C Observe that s 2 log r en2 Cn j r 2 j Cr r n. Thus for t 1,..., t 0 we get where Hence by 8 P X r C rn 1/r + P X r C rn 1/r + j=1 s 1/r s t P Y Y := 2 X 2 r C r 3 log r en2. s 1/r t s s P Y t exp for t > 0. 8 s t, 1 C 2 2 1/r r t. Fix t > 0 and choose t such that t = 2 /2 /r t 1/r. Then s s t = t r 2 2 r 2 t r r 1 2 Ct r r r 2, so we get r 1/r P X r C rn 1/r + t log r 2 2 n + 1 exp 1 C t. Proof of Theorem 8. Observe that r r 2 1/r C1+δ 1/2 for r 2+δ and log n rn 1/r and apply Proposition 9. 9
10 4 Proof of Theorem 4 Our crucial tool will be the following result. Proposition 10. Let X be an isotropic log-concave n-dimensional random vector, A = {X K}, where K is a convex set in R n such that 0 < PA 1/e. Then PA {X i t} C 1 PA t 2 log 2 PA+ne t/c 1 for t C 1. 9 Moreover for 1 u t C 2, #{i n: PA {X i t} e u PA} C 2u 2 t 2 log 2 PA. 10 Proof. Let Y be a random vector distributed as the vector X conditioned on the set A that is PY B = PA {X B} PA = PX B K. PX K Notice that in particular for any set B, PX B PAPY B. The vector Y is log-concave, but no longer isotropic. Since this is only a matter of permutation of coordinates we may assume that EY1 2 EY EYn 2. For α > 0 let m = mα = #{i: EY 2 i α}. We have EY EY 2 m α. Hence by the Paley-Zygmund inequality, m P Yi αm P m Y 2 i 1 2 E m Yi E m Y 2 i 2 E m Y 2 i 2 1 C. This implies that m P Xi αm 1 C PA. However by the result of Paouris, m P Xi αm exp 1 mα C 3 for α C 3. 10
11 So for α C 3, exp 1 C 3 mα PA/C and we get that We have mα = #{i: EY 2 i α} C 4 α log2 PA for α C PA {X i t} PA t = PY i t exp 1 CEYi 21/2 and 10 follows by 11. Tae t C 3 and let 0 be a nonnegative integer such that 2 0 t C t. Define and By 11 we get I 0 = {i: EY 2 i t 2 }, I 0 +1 = {i: EY 2 i < 4 0 t 2 } I j = {i: 4 j t 2 EY 2 i < 4 1 j t 2 } j = 1, 2,..., 0. #I j C 4 4 j t 2 log 2 PA for j = 0, 1,..., 0 and obviously #I 0 +1 n. Moreover for i I j, j 0, Thus Y i PY i t P EYi 2 2j 1 1/ PY i t = PY i t #I 0 + e j=0 i I j 0 C 4 t 2 log 2 PA 1 + e j=1 C 1 t 2 log 2 PA + ne t/c 1 exp 1 1 C 2j j=1 To finish the proof of 9 it is enough to observe that #I j exp 1 C 2j 2 2j exp 1 C 2j + ene t/c. PA {X i t} = PA PY i t. 11
12 The following two examples show that estimate 9 is close to be optimal. Example 1. Tae X 1, X 2,..., X n to be independent symmetric exponential random variables with variance 1 and A = {X 1 2} Then PA = 1 2e and PA {X i t} = PA i=2 PX i t = n 1PA exp t/ 2, i=2 therefore the factor ne t/c in 9 is necessary. Example 2. Tae A = {X 1 t,..., X t} then PA {X i t} PA. So improvement of the factor t 2 PA log 2 PA in 9 would imply in particular a better estimate of PX 1 t,..., X t than exp 1 C t and we do not now if such bound is possible to obtain. Proof of Theorem 4. We have N X n, so the statement is obvious if t n Cp, in the sequel we will assume that t n 10p. Let C 1 and C 2 be as in Proposition 10 increasing C i if necessary we may assume that PX 1 t e t/c i for t C i and i = 1, 2. Let us fix p 1 and t C log nt2, then t max{c p 2 1, 4C 2 } and t 2 ne t/c 1 p 2 if C is large enough. Let l be a positive integer such that p l 2p and l = 2 for some integer. Since EN X t p 1/p EN X t l 1/l it is enough to show that Et 2 N X t l Cl 2l. Recall that by our assumption on p, we have t n 5l. To shorten the notation let B i1,...,i s = {X i1 t,..., X is t} and B = Ω. Define ml := EN X t l = E l = 1 {Xi t} i 1,...,i l =1 PB i1,...,i l, we need to show that ml Cl 2l. 12 t 12
13 We devide the sum in ml into several parts. Let j 1 2 be such integer that nt 2 j1 2 2 < log l 2 2 j1 1. We set I 0 = { i 1,..., i l {1,..., n} l : PB i1,...,i l > e l}, I j = { i 1,..., i l {1,..., n} l : PB i1,...,i l e 2jl, e 2j 1l ] } 0 < j < j 1 and I j1 = { i 1,..., i l {1,..., n} l : PB i1,...,i l e 2j 1 1 l }. Since {1,..., n} l = j 1 j=0 I j we get ml = j 1 j=0 m j l, where m j l := PB i1,...,i l for 0 j j 1. i 1,...,i l I j It is easy to bound m j1 l namely since #I j1 n l we have l 2l. t i 1,...,i l I j1 PB i1,...,i l n l e 2j1 1l To estimate m 0 l we define first for I {1,..., n} l and 1 s l, P s I = {i 1,..., i s : i 1,..., i l I for some i s+1,..., i l }. By Proposition 10 we get for s = 1,..., l 1 PB i1,...,i s+1 i 1,...,i s+1 P s+1 I 0 C 1 i 1,...,i s P si 0 i s+1 =1 PB i1,...,i s {X is+1 t} i 1,...,i s P si 0 PB i1,...,i s t 2 log 2 PB i1,...,i s + ne t/c1. Observe that we have PB i1,...,i s > e l for i 1,..., i s P s I 0 and recall that t 2 ne t/c 1 p 2 4l 2, hence PB i1,...,i s+1 5C 1 t 2 l 2 PB i1,...,i s. i 1,...,i s+1 P s+1 I 0 i 1,...,i s P si 0 So, by easy induction we obtain m 0 l = PB i1,...,i l 5C 1 t 2 l 2 l 1 i 1,...,i l I 0 5C 1 t 2 l 2 l 1 ne t/c 1 13 Cl 2l. t i 1 P 1 I 0 PB i1
14 Now comes the most involved part of the proof estimating m j l for 0 < j < j 1. It is based on suitable bounds for #I j. We will need the following simple combinatorial lemma. Lemma 11. Let l 0 l 1... l s be a fixed sequence of positive integers and } F = {f : {1, 2,..., l 0 } {0, 1, 2,..., s}: 1 i s #{r : fr i} l i. Then #F s eli 1 Proof of Lemma 11. Notice that any function f : {1, 2,..., l 0 } {0, 1, 2,..., s} is determined by the sets A i = {r : fr i} for i = 0, 1,..., s. Tae f F, obviously A 0 = {1,..., l 0 }. If the set A i 1 of cardinality a i 1 l i 1 is already chosen then the set A i A i 1 of cardinality at most l i may be chosen in ai 1 0 ways. + ai ai 1 l i li 1 0 l i + li. li li 1 l i eli 1 li We come bac to the proof of Theorem 4. Fix 0 < j < j 1, let r 1 be a positive integer such that 2 r 1 < t C 2 2 r 1+1. For i 1,..., i l I j we define a function f i1,...,i l : {1,..., l} {j, j+1,..., r 1 } by the formula j if PB i1,...,i s exp 2 j+1 PB i1,...,i s 1, f i1,...,i l s = r if exp 2 r+1 PB i 1,...,is PB i1,...,i s 1 < exp 2r, j < r < r 1, r 1 if PB i1,...,i s < exp 2 r 1 PB i1,...,i s 1. Notice that for all i 1, PX i1 t e t/c 2 < exp 2 r 1 PB, so f i1,...,i l 1 = r 1 for all i 1,..., i l. Put F j := { f i1,...,i l : i 1,..., i l I j }. For f = f i1,...,i l F j and r > j, we have exp 2 j l < PB i1,...,i l < exp 2 r #{s: fs r}, l i 14
15 so #{s: fs r} 2 j r l =: l r. 13 Observe that the above inequality holds also for r = j. We have l r 1 /l r = 2 and r 1 r=j+1 l r l so by Lemma 11 we get Put #F j r 1 r=j+1 elr 1 l r lr e 2l. Now fix f F j we will estimate the cardinality of the set We have I j f := {i 1,..., i l I j : f i1,...,i l = f}. n r := #{s {1,..., l}: fs = r} r = j, j + 1,..., r 1. n j + n j n r1 = l, moreover if i 1,..., i s 1 are fixed and fs = r < r 1 then s 2 and by the second part of Proposition 10 with u = 2 r+1 t/c 2 i s may tae at most 4C 2 2 2r t 2 log 2 PB i1,...,i s 1 4C 22 2r+j l 2 t 2 4C 2l 2 t 2 values. Thus #I j f n nr 1 r 1 1 r=j m nr r = n nr 1 4C2 l 2 t 2 l n r1 exp exp2r + j =: m r r 1 1 Observe that by previously derived estimate 13 we get n r l r = 2 j r l, r=j 2r + jn r. hence We also have r 1 1 r=j 2r + jn r 2 j+2 l r2 r C + 2 j 2 l. r=j n r1 2 j r 1 l 2C 2 2 j l t 1 lognt 2 /4l 2 2j 3 l, 15
16 where the last inequality holds since t C lognt 2 /4l 2 and C may be taen arbitrarily large. So we get that for any f F j, Hence #I j f This shows that Cl 2 l nt 2 nr1 t 2 4l 2 exp 2 j 2 l Cl 2 l 3 exp t 2 8 2j l. Cl 2 l 3 Cl 2 l #I j #F j exp t 2 8 2j l exp t j l. Cl m j l = PB i1,...,i l #I j exp 2 j 1 2 l l exp 2 j 3 t 2 l. i 1,...,i l I j Therefore j 1 1 ml = m 0 l + m j1 l + m j l Cl 2l t and 12 holds. j=1 l t 2l C l C l exp 2 j 3 l Acnowledgments. This wor was done while the author was taing part in the Thematic Program on Asymptotic Geometric Analysis at the Fields Institute in Toronto. The author would lie to than Rados law Adamcza and Nicole Tomcza-Jaegermann for their helpful comments. References [1] R. Adamcza, R. Lata la, A. Litva, A. Pajor and N. Tomcza- Jaegermann, in preparation. [2] S.G. Bobov and F.L. Nazarov, On convex bodies and log-concave probability measures with unconditional basis, in: Geometric aspects of functional analysis, 53 69, Lecture Notes in Math., 1807, Springer, Berlin, [3] C. Borell, Convex measures on locally convex spaces, Ar. Math , j=1 16
17 [4] O. Guedon and E. Milman, Interpolating thin-shell and sharp large-deviation estimates for isotropic log-concave measures, preprint, [5] N. Huet, Spectral gap for some invariant log-concave probability measures, preprint, [6] R. Kannan, L. Lovász, and M. Simonovits, Isoperimetric problems for convex bodies and a localization lemma, Discrete Comput. Geom , [7] B. Klartag, A Berry-Esseen type inequality for convex bodies with an unconditional basis, Probab. Theory Related Fields, , [8] R. Lata la, Tail and moment estimates for sums of independent random vectors with logarithmically concave tails, Studia Math , [9] E. Milman, On the role of convexity in isoperimetry, spectral gap and concentration, Invent. Math , [10] G. Paouris, Concentration of mass on convex bodies, Geom. Funct. Anal ,
Tail inequalities for order statistics of log-concave vectors and applications
Tail inequalities for order statistics of log-concave vectors and applications Rafał Latała Based in part on a joint work with R.Adamczak, A.E.Litvak, A.Pajor and N.Tomczak-Jaegermann Banff, May 2011 Basic
More informationDiscussion on the paper Hypotheses testing by convex optimization by A. Goldenschluger, A. Juditsky and A. Nemirovski.
Discussion on the paper Hypotheses testing by convex optimization by A. Goldenschluger, A. Juditsky and A. Nemirovski. Fabienne Comte, Celine Duval, Valentine Genon-Catalot To cite this version: Fabienne
More informationOn an anti-ramsey type result
On an anti-ramsey type result Noga Alon, Hanno Lefmann and Vojtĕch Rödl Abstract We consider anti-ramsey type results. For a given coloring of the k-element subsets of an n-element set X, where two k-element
More informationModern Optimization Methods for Big Data Problems MATH11146 The University of Edinburgh
Modern Optimization Methods for Big Data Problems MATH11146 The University of Edinburgh Peter Richtárik Week 3 Randomized Coordinate Descent With Arbitrary Sampling January 27, 2016 1 / 30 The Problem
More informationON INDUCED SUBGRAPHS WITH ALL DEGREES ODD. 1. Introduction
ON INDUCED SUBGRAPHS WITH ALL DEGREES ODD A.D. SCOTT Abstract. Gallai proved that the vertex set of any graph can be partitioned into two sets, each inducing a subgraph with all degrees even. We prove
More informationMASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 5 9/17/2008 RANDOM VARIABLES
MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 5 9/17/2008 RANDOM VARIABLES Contents 1. Random variables and measurable functions 2. Cumulative distribution functions 3. Discrete
More informationAbout the inverse football pool problem for 9 games 1
Seventh International Workshop on Optimal Codes and Related Topics September 6-1, 013, Albena, Bulgaria pp. 15-133 About the inverse football pool problem for 9 games 1 Emil Kolev Tsonka Baicheva Institute
More informationAdaptive Online Gradient Descent
Adaptive Online Gradient Descent Peter L Bartlett Division of Computer Science Department of Statistics UC Berkeley Berkeley, CA 94709 bartlett@csberkeleyedu Elad Hazan IBM Almaden Research Center 650
More informationRandom graphs with a given degree sequence
Sourav Chatterjee (NYU) Persi Diaconis (Stanford) Allan Sly (Microsoft) Let G be an undirected simple graph on n vertices. Let d 1,..., d n be the degrees of the vertices of G arranged in descending order.
More informationFurther Study on Strong Lagrangian Duality Property for Invex Programs via Penalty Functions 1
Further Study on Strong Lagrangian Duality Property for Invex Programs via Penalty Functions 1 J. Zhang Institute of Applied Mathematics, Chongqing University of Posts and Telecommunications, Chongqing
More informationINTEGRAL OPERATORS ON THE PRODUCT OF C(K) SPACES
INTEGRAL OPERATORS ON THE PRODUCT OF C(K) SPACES FERNANDO BOMBAL AND IGNACIO VILLANUEVA Abstract. We study and characterize the integral multilinear operators on a product of C(K) spaces in terms of the
More informationPacific Journal of Mathematics
Pacific Journal of Mathematics GLOBAL EXISTENCE AND DECREASING PROPERTY OF BOUNDARY VALUES OF SOLUTIONS TO PARABOLIC EQUATIONS WITH NONLOCAL BOUNDARY CONDITIONS Sangwon Seo Volume 193 No. 1 March 2000
More informationProperties of BMO functions whose reciprocals are also BMO
Properties of BMO functions whose reciprocals are also BMO R. L. Johnson and C. J. Neugebauer The main result says that a non-negative BMO-function w, whose reciprocal is also in BMO, belongs to p> A p,and
More informationConcentration inequalities for order statistics Using the entropy method and Rényi s representation
Concentration inequalities for order statistics Using the entropy method and Rényi s representation Maud Thomas 1 in collaboration with Stéphane Boucheron 1 1 LPMA Université Paris-Diderot High Dimensional
More informationResearch Article Stability Analysis for Higher-Order Adjacent Derivative in Parametrized Vector Optimization
Hindawi Publishing Corporation Journal of Inequalities and Applications Volume 2010, Article ID 510838, 15 pages doi:10.1155/2010/510838 Research Article Stability Analysis for Higher-Order Adjacent Derivative
More informationSHARP BOUNDS FOR THE SUM OF THE SQUARES OF THE DEGREES OF A GRAPH
31 Kragujevac J. Math. 25 (2003) 31 49. SHARP BOUNDS FOR THE SUM OF THE SQUARES OF THE DEGREES OF A GRAPH Kinkar Ch. Das Department of Mathematics, Indian Institute of Technology, Kharagpur 721302, W.B.,
More informationLecture 4: BK inequality 27th August and 6th September, 2007
CSL866: Percolation and Random Graphs IIT Delhi Amitabha Bagchi Scribe: Arindam Pal Lecture 4: BK inequality 27th August and 6th September, 2007 4. Preliminaries The FKG inequality allows us to lower bound
More informationDuality of linear conic problems
Duality of linear conic problems Alexander Shapiro and Arkadi Nemirovski Abstract It is well known that the optimal values of a linear programming problem and its dual are equal to each other if at least
More informationQuestion: What is the probability that a five-card poker hand contains a flush, that is, five cards of the same suit?
ECS20 Discrete Mathematics Quarter: Spring 2007 Instructor: John Steinberger Assistant: Sophie Engle (prepared by Sophie Engle) Homework 8 Hints Due Wednesday June 6 th 2007 Section 6.1 #16 What is the
More informationINDISTINGUISHABILITY OF ABSOLUTELY CONTINUOUS AND SINGULAR DISTRIBUTIONS
INDISTINGUISHABILITY OF ABSOLUTELY CONTINUOUS AND SINGULAR DISTRIBUTIONS STEVEN P. LALLEY AND ANDREW NOBEL Abstract. It is shown that there are no consistent decision rules for the hypothesis testing problem
More informationWeek 1: Introduction to Online Learning
Week 1: Introduction to Online Learning 1 Introduction This is written based on Prediction, Learning, and Games (ISBN: 2184189 / -21-8418-9 Cesa-Bianchi, Nicolo; Lugosi, Gabor 1.1 A Gentle Start Consider
More informationTHE CENTRAL LIMIT THEOREM TORONTO
THE CENTRAL LIMIT THEOREM DANIEL RÜDT UNIVERSITY OF TORONTO MARCH, 2010 Contents 1 Introduction 1 2 Mathematical Background 3 3 The Central Limit Theorem 4 4 Examples 4 4.1 Roulette......................................
More informationIdeal Class Group and Units
Chapter 4 Ideal Class Group and Units We are now interested in understanding two aspects of ring of integers of number fields: how principal they are (that is, what is the proportion of principal ideals
More informationCOMPLETE MARKETS DO NOT ALLOW FREE CASH FLOW STREAMS
COMPLETE MARKETS DO NOT ALLOW FREE CASH FLOW STREAMS NICOLE BÄUERLE AND STEFANIE GRETHER Abstract. In this short note we prove a conjecture posed in Cui et al. 2012): Dynamic mean-variance problems in
More informationMath 461 Fall 2006 Test 2 Solutions
Math 461 Fall 2006 Test 2 Solutions Total points: 100. Do all questions. Explain all answers. No notes, books, or electronic devices. 1. [105+5 points] Assume X Exponential(λ). Justify the following two
More informationFINITE DIMENSIONAL ORDERED VECTOR SPACES WITH RIESZ INTERPOLATION AND EFFROS-SHEN S UNIMODULARITY CONJECTURE AARON TIKUISIS
FINITE DIMENSIONAL ORDERED VECTOR SPACES WITH RIESZ INTERPOLATION AND EFFROS-SHEN S UNIMODULARITY CONJECTURE AARON TIKUISIS Abstract. It is shown that, for any field F R, any ordered vector space structure
More information1 Norms and Vector Spaces
008.10.07.01 1 Norms and Vector Spaces Suppose we have a complex vector space V. A norm is a function f : V R which satisfies (i) f(x) 0 for all x V (ii) f(x + y) f(x) + f(y) for all x,y V (iii) f(λx)
More informationCONTRIBUTIONS TO ZERO SUM PROBLEMS
CONTRIBUTIONS TO ZERO SUM PROBLEMS S. D. ADHIKARI, Y. G. CHEN, J. B. FRIEDLANDER, S. V. KONYAGIN AND F. PAPPALARDI Abstract. A prototype of zero sum theorems, the well known theorem of Erdős, Ginzburg
More informationHow To Prove The Dirichlet Unit Theorem
Chapter 6 The Dirichlet Unit Theorem As usual, we will be working in the ring B of algebraic integers of a number field L. Two factorizations of an element of B are regarded as essentially the same if
More informationF. ABTAHI and M. ZARRIN. (Communicated by J. Goldstein)
Journal of Algerian Mathematical Society Vol. 1, pp. 1 6 1 CONCERNING THE l p -CONJECTURE FOR DISCRETE SEMIGROUPS F. ABTAHI and M. ZARRIN (Communicated by J. Goldstein) Abstract. For 2 < p
More informationarxiv:1112.0829v1 [math.pr] 5 Dec 2011
How Not to Win a Million Dollars: A Counterexample to a Conjecture of L. Breiman Thomas P. Hayes arxiv:1112.0829v1 [math.pr] 5 Dec 2011 Abstract Consider a gambling game in which we are allowed to repeatedly
More informationLecture 13: Martingales
Lecture 13: Martingales 1. Definition of a Martingale 1.1 Filtrations 1.2 Definition of a martingale and its basic properties 1.3 Sums of independent random variables and related models 1.4 Products of
More informationAn example of a computable
An example of a computable absolutely normal number Verónica Becher Santiago Figueira Abstract The first example of an absolutely normal number was given by Sierpinski in 96, twenty years before the concept
More informationSeparation Properties for Locally Convex Cones
Journal of Convex Analysis Volume 9 (2002), No. 1, 301 307 Separation Properties for Locally Convex Cones Walter Roth Department of Mathematics, Universiti Brunei Darussalam, Gadong BE1410, Brunei Darussalam
More informationWhat is Statistics? Lecture 1. Introduction and probability review. Idea of parametric inference
0. 1. Introduction and probability review 1.1. What is Statistics? What is Statistics? Lecture 1. Introduction and probability review There are many definitions: I will use A set of principle and procedures
More information2.3 Convex Constrained Optimization Problems
42 CHAPTER 2. FUNDAMENTAL CONCEPTS IN CONVEX OPTIMIZATION Theorem 15 Let f : R n R and h : R R. Consider g(x) = h(f(x)) for all x R n. The function g is convex if either of the following two conditions
More informationThe sample space for a pair of die rolls is the set. The sample space for a random number between 0 and 1 is the interval [0, 1].
Probability Theory Probability Spaces and Events Consider a random experiment with several possible outcomes. For example, we might roll a pair of dice, flip a coin three times, or choose a random real
More informationThe Online Set Cover Problem
The Online Set Cover Problem Noga Alon Baruch Awerbuch Yossi Azar Niv Buchbinder Joseph Seffi Naor ABSTRACT Let X = {, 2,..., n} be a ground set of n elements, and let S be a family of subsets of X, S
More informationTHE SCHEDULING OF MAINTENANCE SERVICE
THE SCHEDULING OF MAINTENANCE SERVICE Shoshana Anily Celia A. Glass Refael Hassin Abstract We study a discrete problem of scheduling activities of several types under the constraint that at most a single
More informationGambling Systems and Multiplication-Invariant Measures
Gambling Systems and Multiplication-Invariant Measures by Jeffrey S. Rosenthal* and Peter O. Schwartz** (May 28, 997.. Introduction. This short paper describes a surprising connection between two previously
More informationMath 231b Lecture 35. G. Quick
Math 231b Lecture 35 G. Quick 35. Lecture 35: Sphere bundles and the Adams conjecture 35.1. Sphere bundles. Let X be a connected finite cell complex. We saw that the J-homomorphism could be defined by
More informationThe Ideal Class Group
Chapter 5 The Ideal Class Group We will use Minkowski theory, which belongs to the general area of geometry of numbers, to gain insight into the ideal class group of a number field. We have already mentioned
More informationAdaptive Search with Stochastic Acceptance Probabilities for Global Optimization
Adaptive Search with Stochastic Acceptance Probabilities for Global Optimization Archis Ghate a and Robert L. Smith b a Industrial Engineering, University of Washington, Box 352650, Seattle, Washington,
More information1. (First passage/hitting times/gambler s ruin problem:) Suppose that X has a discrete state space and let i be a fixed state. Let
Copyright c 2009 by Karl Sigman 1 Stopping Times 1.1 Stopping Times: Definition Given a stochastic process X = {X n : n 0}, a random time τ is a discrete random variable on the same probability space as
More information24. The Branch and Bound Method
24. The Branch and Bound Method It has serious practical consequences if it is known that a combinatorial problem is NP-complete. Then one can conclude according to the present state of science that no
More informationA Turán Type Problem Concerning the Powers of the Degrees of a Graph
A Turán Type Problem Concerning the Powers of the Degrees of a Graph Yair Caro and Raphael Yuster Department of Mathematics University of Haifa-ORANIM, Tivon 36006, Israel. AMS Subject Classification:
More informationConvex analysis and profit/cost/support functions
CALIFORNIA INSTITUTE OF TECHNOLOGY Division of the Humanities and Social Sciences Convex analysis and profit/cost/support functions KC Border October 2004 Revised January 2009 Let A be a subset of R m
More informationAll trees contain a large induced subgraph having all degrees 1 (mod k)
All trees contain a large induced subgraph having all degrees 1 (mod k) David M. Berman, A.J. Radcliffe, A.D. Scott, Hong Wang, and Larry Wargo *Department of Mathematics University of New Orleans New
More information15 Limit sets. Lyapunov functions
15 Limit sets. Lyapunov functions At this point, considering the solutions to ẋ = f(x), x U R 2, (1) we were most interested in the behavior of solutions when t (sometimes, this is called asymptotic behavior
More informationON SOME ANALOGUE OF THE GENERALIZED ALLOCATION SCHEME
ON SOME ANALOGUE OF THE GENERALIZED ALLOCATION SCHEME Alexey Chuprunov Kazan State University, Russia István Fazekas University of Debrecen, Hungary 2012 Kolchin s generalized allocation scheme A law of
More informationLarge induced subgraphs with all degrees odd
Large induced subgraphs with all degrees odd A.D. Scott Department of Pure Mathematics and Mathematical Statistics, University of Cambridge, England Abstract: We prove that every connected graph of order
More informationSome stability results of parameter identification in a jump diffusion model
Some stability results of parameter identification in a jump diffusion model D. Düvelmeyer Technische Universität Chemnitz, Fakultät für Mathematik, 09107 Chemnitz, Germany Abstract In this paper we discuss
More informationHow To Find Out How To Calculate A Premeasure On A Set Of Two-Dimensional Algebra
54 CHAPTER 5 Product Measures Given two measure spaces, we may construct a natural measure on their Cartesian product; the prototype is the construction of Lebesgue measure on R 2 as the product of Lebesgue
More informationNotes from Week 1: Algorithms for sequential prediction
CS 683 Learning, Games, and Electronic Markets Spring 2007 Notes from Week 1: Algorithms for sequential prediction Instructor: Robert Kleinberg 22-26 Jan 2007 1 Introduction In this course we will be looking
More informationMath 431 An Introduction to Probability. Final Exam Solutions
Math 43 An Introduction to Probability Final Eam Solutions. A continuous random variable X has cdf a for 0, F () = for 0 <
More information17.3.1 Follow the Perturbed Leader
CS787: Advanced Algorithms Topic: Online Learning Presenters: David He, Chris Hopman 17.3.1 Follow the Perturbed Leader 17.3.1.1 Prediction Problem Recall the prediction problem that we discussed in class.
More informationEx. 2.1 (Davide Basilio Bartolini)
ECE 54: Elements of Information Theory, Fall 00 Homework Solutions Ex.. (Davide Basilio Bartolini) Text Coin Flips. A fair coin is flipped until the first head occurs. Let X denote the number of flips
More informationElements of probability theory
2 Elements of probability theory Probability theory provides mathematical models for random phenomena, that is, phenomena which under repeated observations yield di erent outcomes that cannot be predicted
More information1 The Brownian bridge construction
The Brownian bridge construction The Brownian bridge construction is a way to build a Brownian motion path by successively adding finer scale detail. This construction leads to a relatively easy proof
More informationOverview of Monte Carlo Simulation, Probability Review and Introduction to Matlab
Monte Carlo Simulation: IEOR E4703 Fall 2004 c 2004 by Martin Haugh Overview of Monte Carlo Simulation, Probability Review and Introduction to Matlab 1 Overview of Monte Carlo Simulation 1.1 Why use simulation?
More informationGeometric Methods in the Analysis of Glivenko-Cantelli Classes
Geometric Methods in the Analysis of Glivenko-Cantelli Classes Shahar Mendelson Computer Sciences Laboratory, RSISE, The Australian National University, Canberra 0200, Australia shahar@csl.anu.edu.au Abstract.
More informationInner Product Spaces and Orthogonality
Inner Product Spaces and Orthogonality week 3-4 Fall 2006 Dot product of R n The inner product or dot product of R n is a function, defined by u, v a b + a 2 b 2 + + a n b n for u a, a 2,, a n T, v b,
More informationMathematics for Econometrics, Fourth Edition
Mathematics for Econometrics, Fourth Edition Phoebus J. Dhrymes 1 July 2012 1 c Phoebus J. Dhrymes, 2012. Preliminary material; not to be cited or disseminated without the author s permission. 2 Contents
More informationMAS108 Probability I
1 QUEEN MARY UNIVERSITY OF LONDON 2:30 pm, Thursday 3 May, 2007 Duration: 2 hours MAS108 Probability I Do not start reading the question paper until you are instructed to by the invigilators. The paper
More informationLecture 6: Discrete & Continuous Probability and Random Variables
Lecture 6: Discrete & Continuous Probability and Random Variables D. Alex Hughes Math Camp September 17, 2015 D. Alex Hughes (Math Camp) Lecture 6: Discrete & Continuous Probability and Random September
More informationON LIMIT LAWS FOR CENTRAL ORDER STATISTICS UNDER POWER NORMALIZATION. E. I. Pancheva, A. Gacovska-Barandovska
Pliska Stud. Math. Bulgar. 22 (2015), STUDIA MATHEMATICA BULGARICA ON LIMIT LAWS FOR CENTRAL ORDER STATISTICS UNDER POWER NORMALIZATION E. I. Pancheva, A. Gacovska-Barandovska Smirnov (1949) derived four
More informationCurriculum Vitae. Grigoris Paouris January 2011
Curriculum Vitae Grigoris Paouris January 2011 Address Texas A&M University Department of Mathematics College Station TX 77843-3368 U.S.A. e-mail: grigoris@math.tamu.edu Web-page http://www.math.tamu.edu/
More informationMathematics Course 111: Algebra I Part IV: Vector Spaces
Mathematics Course 111: Algebra I Part IV: Vector Spaces D. R. Wilkins Academic Year 1996-7 9 Vector Spaces A vector space over some field K is an algebraic structure consisting of a set V on which are
More information1. Prove that the empty set is a subset of every set.
1. Prove that the empty set is a subset of every set. Basic Topology Written by Men-Gen Tsai email: b89902089@ntu.edu.tw Proof: For any element x of the empty set, x is also an element of every set since
More informationTHE NUMBER OF GRAPHS AND A RANDOM GRAPH WITH A GIVEN DEGREE SEQUENCE. Alexander Barvinok
THE NUMBER OF GRAPHS AND A RANDOM GRAPH WITH A GIVEN DEGREE SEQUENCE Alexer Barvinok Papers are available at http://www.math.lsa.umich.edu/ barvinok/papers.html This is a joint work with J.A. Hartigan
More informationWHEN DOES A RANDOMLY WEIGHTED SELF NORMALIZED SUM CONVERGE IN DISTRIBUTION?
WHEN DOES A RANDOMLY WEIGHTED SELF NORMALIZED SUM CONVERGE IN DISTRIBUTION? DAVID M MASON 1 Statistics Program, University of Delaware Newark, DE 19717 email: davidm@udeledu JOEL ZINN 2 Department of Mathematics,
More informationMaster s Theory Exam Spring 2006
Spring 2006 This exam contains 7 questions. You should attempt them all. Each question is divided into parts to help lead you through the material. You should attempt to complete as much of each problem
More informationERDOS PROBLEMS ON IRREGULARITIES OF LINE SIZES AND POINT DEGREES A. GYARFAS*
BOLYAI SOCIETY MATHEMATICAL STUDIES, 11 Paul Erdos and his Mathematics. II, Budapest, 2002, pp. 367-373. ERDOS PROBLEMS ON IRREGULARITIES OF LINE SIZES AND POINT DEGREES A. GYARFAS* Problems and results
More informationRegular Induced Subgraphs of a Random Graph*
Regular Induced Subgraphs of a Random Graph* Michael Krivelevich, 1 Benny Sudaov, Nicholas Wormald 3 1 School of Mathematical Sciences, Tel Aviv University, Tel Aviv 69978, Israel; e-mail: rivelev@post.tau.ac.il
More informationStationary random graphs on Z with prescribed iid degrees and finite mean connections
Stationary random graphs on Z with prescribed iid degrees and finite mean connections Maria Deijfen Johan Jonasson February 2006 Abstract Let F be a probability distribution with support on the non-negative
More informationChapter 4 Lecture Notes
Chapter 4 Lecture Notes Random Variables October 27, 2015 1 Section 4.1 Random Variables A random variable is typically a real-valued function defined on the sample space of some experiment. For instance,
More informationNo: 10 04. Bilkent University. Monotonic Extension. Farhad Husseinov. Discussion Papers. Department of Economics
No: 10 04 Bilkent University Monotonic Extension Farhad Husseinov Discussion Papers Department of Economics The Discussion Papers of the Department of Economics are intended to make the initial results
More informationChapter 2: Binomial Methods and the Black-Scholes Formula
Chapter 2: Binomial Methods and the Black-Scholes Formula 2.1 Binomial Trees We consider a financial market consisting of a bond B t = B(t), a stock S t = S(t), and a call-option C t = C(t), where the
More informationTHREE DIMENSIONAL GEOMETRY
Chapter 8 THREE DIMENSIONAL GEOMETRY 8.1 Introduction In this chapter we present a vector algebra approach to three dimensional geometry. The aim is to present standard properties of lines and planes,
More informationIntroduction to Probability
Introduction to Probability EE 179, Lecture 15, Handout #24 Probability theory gives a mathematical characterization for experiments with random outcomes. coin toss life of lightbulb binary data sequence
More informationMATH 304 Linear Algebra Lecture 9: Subspaces of vector spaces (continued). Span. Spanning set.
MATH 304 Linear Algebra Lecture 9: Subspaces of vector spaces (continued). Span. Spanning set. Vector space A vector space is a set V equipped with two operations, addition V V (x,y) x + y V and scalar
More informationCHAPTER II THE LIMIT OF A SEQUENCE OF NUMBERS DEFINITION OF THE NUMBER e.
CHAPTER II THE LIMIT OF A SEQUENCE OF NUMBERS DEFINITION OF THE NUMBER e. This chapter contains the beginnings of the most important, and probably the most subtle, notion in mathematical analysis, i.e.,
More informationCURVES WHOSE SECANT DEGREE IS ONE IN POSITIVE CHARACTERISTIC. 1. Introduction
Acta Math. Univ. Comenianae Vol. LXXXI, 1 (2012), pp. 71 77 71 CURVES WHOSE SECANT DEGREE IS ONE IN POSITIVE CHARACTERISTIC E. BALLICO Abstract. Here we study (in positive characteristic) integral curves
More informationInfluences in low-degree polynomials
Influences in low-degree polynomials Artūrs Bačkurs December 12, 2012 1 Introduction In 3] it is conjectured that every bounded real polynomial has a highly influential variable The conjecture is known
More informationn k=1 k=0 1/k! = e. Example 6.4. The series 1/k 2 converges in R. Indeed, if s n = n then k=1 1/k, then s 2n s n = 1 n + 1 +...
6 Series We call a normed space (X, ) a Banach space provided that every Cauchy sequence (x n ) in X converges. For example, R with the norm = is an example of Banach space. Now let (x n ) be a sequence
More informationMathematical Methods of Engineering Analysis
Mathematical Methods of Engineering Analysis Erhan Çinlar Robert J. Vanderbei February 2, 2000 Contents Sets and Functions 1 1 Sets................................... 1 Subsets.............................
More informationKiller Te categors of Subspace in CpNN
Three observations regarding Schatten p classes Gideon Schechtman Abstract The paper contains three results, the common feature of which is that they deal with the Schatten p class. The first is a presentation
More informationIRREDUCIBLE OPERATOR SEMIGROUPS SUCH THAT AB AND BA ARE PROPORTIONAL. 1. Introduction
IRREDUCIBLE OPERATOR SEMIGROUPS SUCH THAT AB AND BA ARE PROPORTIONAL R. DRNOVŠEK, T. KOŠIR Dedicated to Prof. Heydar Radjavi on the occasion of his seventieth birthday. Abstract. Let S be an irreducible
More informationMath 55: Discrete Mathematics
Math 55: Discrete Mathematics UC Berkeley, Fall 2011 Homework # 5, due Wednesday, February 22 5.1.4 Let P (n) be the statement that 1 3 + 2 3 + + n 3 = (n(n + 1)/2) 2 for the positive integer n. a) What
More informationSection 6.1 - Inner Products and Norms
Section 6.1 - Inner Products and Norms Definition. Let V be a vector space over F {R, C}. An inner product on V is a function that assigns, to every ordered pair of vectors x and y in V, a scalar in F,
More informationAn axiomatic approach to capital allocation
An axiomatic approach to capital allocation Michael Kalkbrener Deutsche Bank AG Abstract Capital allocation techniques are of central importance in portfolio management and risk-based performance measurement.
More information1 Sets and Set Notation.
LINEAR ALGEBRA MATH 27.6 SPRING 23 (COHEN) LECTURE NOTES Sets and Set Notation. Definition (Naive Definition of a Set). A set is any collection of objects, called the elements of that set. We will most
More informationInformation Theory and Coding Prof. S. N. Merchant Department of Electrical Engineering Indian Institute of Technology, Bombay
Information Theory and Coding Prof. S. N. Merchant Department of Electrical Engineering Indian Institute of Technology, Bombay Lecture - 17 Shannon-Fano-Elias Coding and Introduction to Arithmetic Coding
More informationFALSE ALARMS IN FAULT-TOLERANT DOMINATING SETS IN GRAPHS. Mateusz Nikodem
Opuscula Mathematica Vol. 32 No. 4 2012 http://dx.doi.org/10.7494/opmath.2012.32.4.751 FALSE ALARMS IN FAULT-TOLERANT DOMINATING SETS IN GRAPHS Mateusz Nikodem Abstract. We develop the problem of fault-tolerant
More informationDefinition: Suppose that two random variables, either continuous or discrete, X and Y have joint density
HW MATH 461/561 Lecture Notes 15 1 Definition: Suppose that two random variables, either continuous or discrete, X and Y have joint density and marginal densities f(x, y), (x, y) Λ X,Y f X (x), x Λ X,
More informationThe degree, size and chromatic index of a uniform hypergraph
The degree, size and chromatic index of a uniform hypergraph Noga Alon Jeong Han Kim Abstract Let H be a k-uniform hypergraph in which no two edges share more than t common vertices, and let D denote the
More informationImportant Probability Distributions OPRE 6301
Important Probability Distributions OPRE 6301 Important Distributions... Certain probability distributions occur with such regularity in real-life applications that they have been given their own names.
More informationAsymptotics of discounted aggregate claims for renewal risk model with risky investment
Appl. Math. J. Chinese Univ. 21, 25(2: 29-216 Asymptotics of discounted aggregate claims for renewal risk model with risky investment JIANG Tao Abstract. Under the assumption that the claim size is subexponentially
More informationWalrasian Demand. u(x) where B(p, w) = {x R n + : p x w}.
Walrasian Demand Econ 2100 Fall 2015 Lecture 5, September 16 Outline 1 Walrasian Demand 2 Properties of Walrasian Demand 3 An Optimization Recipe 4 First and Second Order Conditions Definition Walrasian
More informationMath 370/408, Spring 2008 Prof. A.J. Hildebrand. Actuarial Exam Practice Problem Set 2 Solutions
Math 70/408, Spring 2008 Prof. A.J. Hildebrand Actuarial Exam Practice Problem Set 2 Solutions About this problem set: These are problems from Course /P actuarial exams that I have collected over the years,
More information