A square bias transformation: properties and applications

Size: px
Start display at page:

Download "A square bias transformation: properties and applications"

Transcription

1 A square bias transformation: properties and applications Irina Shevtsova arxiv: v4 [math.pr] 13 Dec 13 Abstract The properties of the square bias transformation are studied, in particular, the precise moment-type estimate for the L 1 -metric between the transformed and the original distributions is proved, a relation between their characteristic functions is found. As a corollary, some new moment-type estimates for the proximity of arbitrary characteristic function with zero mean and finite third moment to the normal one with zero mean and the same variance are proved involving the double integrals of the square- and zero- bias transformations. Key words and phrases: probability transformation, zero bias transformation, size bias transformation, square bias transformation, characteristic function, L 1 -metric AMS 1 Mathematics Subject Classification: 6E1, 6E15 1 Introduction Let X be a random variable r.v.) with the distribution function d.f.) Fx) = PX < x), x R, and the characteristic function ch.f.) ft) = Ee itx = e itx dfx), t R, which is the Fourier-Stieltjes transform of the d.f. Fx). As is well known, if X is nonnegative with < EX <, then f t), t R, 1) f ) is a ch.f., and if < EX <, then f t) f ), tf ) f t) f ) Research supported by the Russian Foundation for Basic Research projects a, a, ofi-m) and by the grant of the President of Russia MK ). Lomonosov Moscow State University, Faculty of Computational Mathematics and Cybernetics, Leninskie Gory, GSP-1, Moscow, , Russia; Institute for Informatics Problems of the Russian Academy of Sciences; ishevtsova@cs.msu.su 1

2 are ch.f. s as well see, e.g., [15, Theorem 1..5]). The probability transformation given by 1) is called the X-size bias transformation. By a transformation of a random variable we mean that of its distribution. The X-size bias transformation was introduced by Goldstein and Rinott [7] for the purpose of estimation of the accuracy of the multivariate normal approximation to nonnegative random vectors under conditions of local dependence by Stein s method. Namely, in [7] an almost surely nonnegative r.v. X with < EX < is said to have the X-size biased distribution if dpx < x) = x dfx), x R. ) EX It is easy to see that the distribution given by ) has the ch.f. given by 1), hence, by virtue of the uniqueness theorem, definitions 1) and ) are equivalent. In the same paper Goldstein and Rinott also noticed that the distribution of X may be characterized by the relation EXGX) = EXEGX ), which should hold for all functions G such that EXGX) <. As regards the second transformation, if EX =, then the distribution given by the ch.f. f t) f ) tf ) = 1 σ f t), t where σ = EX >, is called the X-zero biased distribution. This definition was introduced by Goldstein and Reinert in [5] in an equivalent form for the purpose of generalization of the size bias transformation to r.v. s taking both positive and negative values and was inspired by the characteristic property of the mean zero normal distribution as the unique fixed point of the zero bias transformation. Namely, in [5] a r.v. X z) is said to have the X-zero biased distribution if EX = and EXGX) = σ EG X z) ) for all absolutely continuous functions G for which EXGX) exists. The zero biased transformation possesses the following elementary properties most of them are noticed/proved in [5]): 1. The zero biased distribution is absolutely continuous and unimodal about zero with the probability density function px) = σ EXIX > x), x R, and the ch.f. Ee itxz) 1 σ f t), t R. t. X z) d = X if and only if X has the normal distribution with zero mean [1, 5]. 3. The zero biased transformation preserves symmetry. 4. σ EX z) ) n = EX n+ /n+1) for n N, in particular, σ EX z) =.5EX If X = Y Y n, where Y 1,...,Y n are independent r.v. s with zero means and EYj = σj > so that σ σ n = σ, then X z) = X I + Y z) I, where I is a random index independent of Y 1,...,Y n with the distribution PI = i) = σi/σ, i = 1,...,n, and X i = X Y i = j i Y j.

3 6. The following non-trivial estimate was proved in 9 independently by Goldstein [4] and Tyurin [3, ]: L 1 X,X z) ) E X 3 σ, 3) L 1 X,Y) being the L 1 -distance between the r.v. s X and Y, { } L 1 X,Y) = inf E X Y : X = d X, Y = d Y, E X <, E Y <. As regards the third transformation, given by the characteristic function f t) f t) f ) = f t) σ, t R, 4) where σ EX, ), it is called the X-square bias transformation. It is easy to see that a r.v. X has the ch.f. f t) if and only if EX GX) = σ EGX ) 5) for all functions G such that EX GX) <. In 7 L.Goldstein [3] called the distribution of a r.v. X satisfying 5) the X-square biased distribution. In 11 L.Chen, L.Goldstein and Q.-M. Shao [1, Proposition.3] proved the following relation between the distribution of the zero biased X z) and square biased X distributions of a symmetric r.v. X: X z) d = UX, where the r.v. s U, X are independent, U having uniform distribution on [ 1,1]. Taking into account that the square bias transformation preserves symmetry see below), the latest relation Later in [19] it was noticed that X = X ), and the distribution of X obtained the second name: X-double size bias distribution. In the same paper the following characterization of the modulus of the normally distributed r.v. was proved: X d = U 1 X, where U 1 has uniform distribution on[,1] and is independent ofx, if and only if X d = Z, where Z has the standard normal distribution. It is easy to see that the square bias transformation possesses the following elementary properties. 1. A r.v. X has the X-square biased distribution if and only if its d.f. F x) satisfies df x) = x dfx), x R. 6) σ. X d = X if and only if P X = σ) = 1, i.e. any Bernoulli distribution with symmetric atoms is a fixed point of the square bias transformation. This can be verified by noticing that the solution of the corresponding linear homogeneous differential equation f t) + σ ft) = of the second order with the initial condition f) = 1 has the form ft) = pe iσt +1 p)e iσt, p R, being a ch.f. if and only if p [,1]. 3. Square bias transformation preserves symmetry. Indeed, if the r.v. X has a symmetric distribution, then it s ch.f. ft) is even, and hence, f t) = f t)/f ) = f t)/f ) = f t), i.e. the distribution of X is symmetric as well. 3

4 4. X ) d = X ), where X ) has the X -size biased distribution. 5. cx) = cx for any constant c R. 6. σ EX ) n = EX n+, n N, σ E X r = E X r+, r >, in particular, σ EX = EX 3, σ E X = E X 3. Moreover, the following estimate for the L 1 -distance between the distributions of X and X will be proved in this paper. Theorem 1. If EX =, EX = 1, and E X 3 <, then L 1 X,X ) E X 3, moreover, for any ε > there exists a distribution of a r.v. X concentrated in two points, such that EX =, EX = 1, E X 3 <, and L 1 X,X ) > 1 ε)e X 3. The existence of the square bias transformation follows from the earlier result of [15] mentioned above. Moreover, in 5, Goldstein and Reinert [6] proved the existence of a class of transformations of probability distributions that are characterized by equations like 5). Namely, the authors described a class of measurable functions T : R R that provide the existence and uniqueness of the distribution of a random variable X T) such that ETX)GX) = EG m) X T) ) EXm TX) m! for all m times differentiable functions G: R R with E TX)GX) <. The authors of [6] also noticed that this class includes the zero- and size- bias transformations respectively with m = 1, Tx) = x and m =, Tx) = x +. L.Goldstein [3] noticed that this class also includes the square bias transformation with m =, Tx) = x ). However, up till now the properties of the square biased transformation have not been studied, in particular, the characteristic function of the square biased distribution and the estimate for L 1 X,X ) are established in this paper for the first time. Motivation and applications The zero bias transformation gives an opportunity to construct an integral estimate for the proximity of a ch.f. with zero mean to the normal one with the same variance in terms of the proximity of the corresponding zero biased distribution to the original one, which might be sharper than non-integral estimates based on the Taylor formula in the neighborhood of zero. Namely, for the sake of convenience put σ = 1 implying β 3 1 by the Lyapounov inequality. Then using the elementary relations ft) e t / = e t / t fu)e u / 1 ) t du = e / t f u)+σ ufu) ) e u / du = 4 = e t / t Ee iux Ee iuxz) ) ue u / du, 7)

5 and the estimate for the difference of arbitrary ch.f. s with finite first moments due to Korolev and Shevtsova [1]: Ee itx Ee ity t sin L 1X,Y) π ), E X,E Y <, t R, 8) where a b min{a,b}, a,b R, it is not difficult to conclude that t rt) ft) e t / e t / Ee iux ue Ee iuxz) u / du t e t / sin u L 1X,X z) ) π ) ue u / du, t R. Finally, applying inequality 3) to estimate L 1 X,X z) ) one obtain t rt) e t / β3 u sin 4 π ) ue u / du, t R, 9) for any r.v. X with EX =, EX = 1, E X 3 = β 3 <. Estimate 9) is exact as t, since, as is well known, rt) β 3 t 3 /6, and 9) implies that for all β 3 1 such that β 3 t π/ we have t β3 u ) rt) usin du = 3 sin β 3 t β 3 t 4 β3 4 4 cos β ) 3 t < β 3 t 3 4 6, with the least possible factor 1/6. However, estimate 9) is always sharper than the power-type estimate rt) β 3 t 3 /6 especially for moderate separated from zero) values of β 3 t. Note that β 3 t can be separated from zero for large enough values of β 3 1 even if t is small. Thus, the estimates for rt) of an integral 9)-type form play an important role in the construction of the least possible upper moment-type bounds of the accuracy of the normal approximation which should be uniform in some classes of distributions, especially if in these classes extremal distributions have large third absolute moments. This situation is typical, for example, for the problem of optimization of the absolute constants in the Berry Esseen-type inequalities with an improved structure see [11, 1, 1, 14, ] where a smoothing inequality is applied with the subsequent estimation of the difference f n t) e t /, f n t) being the ch.f. of the normalized sum of independent random variables, in terms of the difference ft) e t /, ft) being the ch.f. of a single r.v.) and in its non-uniform analogues for sums of independent r.v. s that use the Berry Esseen inequality with an improved structure see [, 18, 8]), as well as in the moment-type estimates of the rate of convergence in limit theorems for compound and mixed compound Poisson distributions where β 3, see [13, 1, 17]) which use the Berry Esseen inequality with an improved structure as well. The above reasoning suggests that for the moderate values of β 3 t, estimates for rt) in the twice-integrated form might be even sharper than estimates in the once-integrated form like 9). Since the ch.f. ft) is supposed to be differentiable at least twice, it is possible to continue 7) as ft) e t / = e t / t u e u / t u e u / = e t / f s)+sfs) ) dsdu = f s)+fs)+sf s) ) dsdu = = e t / 5 t u e u / ) Ee isx Ee isx +sf s) dsdu,

6 or as ft) e t / = e t / = e t / t u t u = e t / t u fs)e s / 1 ) dsdu = f s)+fs)+sf s)+s f s)+sfs) )) e s / dsdu = Ee isx Ee isx +sf s)+s Ee isx Ee isxz) ) ) e s / dsdu. Note that the second estimate contains the additional term s Ee isx Ee isxz) ), but the factor e s / does not exceed the analogous factor e u / in the first one. However, for all s t this additional term satisfies g 3 s) s Ee isx Ee isxz) s t = Ot ), t, actually, an even sharper estimate can be obtained, if inequalities 8) and 3) are used). If EX =, EX = 1, then for all s t we have g s) = s f s) = s EXe isx EX se Xe isx 1) s EX = s t = Ot ), t, so that while the first term sup g s)+g 3 s)) = Ot ), t, s t g 1 s) = Ee isx Ee isx = fs)+f s) should be equivalent to β 3 s as s + in order that the final integrated estimate have the exact order β 3 t 3 /6 as t. Thus, it is g 1 s) that determines the behavior of the final integral estimate for small values of s, and the problem of construction of the least possible bound for g 1 s) is very important. Theorem 1 gives an opportunity to construct such a bound. Namely, the following corollaries hold. Corollary 1. Let X be a r.v. with the ch.f. ft) and EX =, EX = 1, β 3 E X 3 <. Then for all t R Ee isx Ee isx ft)+f β3 t t) sin π ). Corollary. Let X be a r.v. with the ch.f. ft) and EX =, EX = 1, β 3 E X 3 <. Then for all t R ft) e t / e t / u t u β3 s sin π ) )ds+ u3 e u / 3 β3 s sin π ) +s β3 s sin 4 π ) )+s e s / dsdu. 6

7 to Note that, ast +, the r.-h. sides of the inequalities presented in corollary are equivalent t u sin β3 s ) dsdu = 8 β3 t β3 sin β ) 3t < < 3 β 3 sin β 3t 4 β 3t 4 cos β ) 3t = 4 t usin β3 u ) du, 4 provided that β 3 t π. Thus, the estimates including the square bias transformation which are presented in corollary in the twice-integrated form are sharper as t that the estimates in the once-integrated form which include the zero bias transformation only. So, corollary plays an important role in estimation of the rate of convergence in limit theorems for sums of independent random variables mentioned above. However, particular application of corollary is the subject of a separate investigation and will be published elsewhere. 3 Proof of theorem 1 As is known see, e.g. [4, Theorem 1.3.1]), the L 1 -metric can be represented in terms of the ζ 1 -metric as L 1 X,Y) = ζ 1 X,Y) sup{ EgX) EgY) : g F 1 }, E X <,E Y <, where F 1 is the set of all real-valued functions on R such that sup x y gx) gy) / x y 1. Since for any function g F 1 we also have g) F 1, we conclude that the modulus in the definition of ζ 1 X,Y) can be omitted: L 1 X,X ) = ζ 1 X,X ) = sup{egx) EgX ): g F 1 }. Let X be a r.v. with the d.f. Fx) and EX =, EX = 1, E X 3 <, X have X-square biased distribution, i.e. the d.f. F x) of the r.v. X satisfying the relation df x) = x dfx), x R. Then For g F 1 denote Then L 1 X,X ) = sup g F 1 EgX) EgX )) = sup g F 1 JF,g) = E1 X )gx) X 3 ) = L 1 X,X ) E X 3 = sup g F 1 JF,g), and the statement of the theorem is equivalent to sup sup g F 1 F JF,g) =, 1 x )gx)dfx). 1 x )gx) x 3 )dfx). where the supremum sup F is taken over all d.f. s F of the r.v. X satisfying two moment-type conditions: EX =, EX = 1. As it follows from the results of [9, 16], the supremum of a linear 7

8 with respect to the d.f. Fx)) functional JX, g) under two linear equality-type conditions EX =, EX = 1 is attained at the distributions concentrated in at most three points. Before passing to checking three- and two-point distributions, recall that for L 1 -metric the following representation in terms of the mean metric holds as well see, e.g. [4, 1.3]): and hence, L 1 X,Y) = κx,y) L 1 X,X ) = PX < u) PY < u) du, E X E Y <, Fu) F u) du = L 1 X,X ) = Fu) EX IX < u) du. Fu) EX IX < u) du. Let the r.v. X take two values and satisfy the conditions EX =, EX = 1. Then its distribution should necessarily have the form P X = ) q/p = p = 1 P X = ) p/q, q = 1 p,1). It is easy to see that EX 3 = q p)/ pq, E X 3 = p +q )/ pq. Then and hence L 1 X,X ) =, u p/q, EX IX < u) = p, p/q < u q/p, 1, q/p < u, EX IX < u) Fu) = p q)i p/q < u q/p ), p q I p/q < u q/p ) du = p q pq = EX 3 E X 3 by virtue of the Jensen inequality, thus, the statement of the theorem holds. Moreover, for any ε > L 1 X,X ) E X 3 = 1 p 1 p > 1 ε 1 p+p for all < p < ε/. Now consider a r.v. X taking exactly three values. Note that { L1 X,X ) } { sup : EX =, EX L1 X,X )σ } = 1 = sup : σ >, EX =, EX = σ, E X 3 E X 3 where the supremums are taken over three-point distributions of the r.v. X. Let X take values x,y,z with probabilities p,q,r > respectively, p+q +r = 1. Without loss of generality one can assume that x < y < z. From the conditions EX =, EX = σ we find that p = σ +yz z x)y x), q = σ +xz z y)y x), r = σ +xy z x)z y), yz < σ < xz. 8

9 For all u R we have EX IX < u) = σ EX IX < u) Fu) =, u x, px, x < u y, px +qy, y < u z, σ, z < u,, u x, px /σ 1), x < u y, px +qy )/σ p q, y < u z,, z < u. Noticing that px +qy )/σ p q = σ rz )/σ 1+r = r1 z /σ ), we obtain L 1 X,X ) = Fu) σ EX IX < u) du = p x y 1 σ 1 z z x)+r y). σ Consider the function L 1 X,X )σ E X 3 = py x) x σ +rz y) z σ +px 3 +qy 3 rz 3 = = 1 x σ σ +yz)+ z σ σ +xy) z3 σ +xz) + z x z y +σ z x xy +yz)+xyzz x)+xz 3 ) gx,y,z,σ ). The statement of the theorem is equivalent to supgx,y,z,σ ) =, where the sumpremum is taken over all σ >, x < y < z such that yz < σ < xz. Note that it suffices to consider only σ < max{x,z }, since the opposite inequality with q > ) implies that EX < σ. So, there are only three possibilities: 1) < σ < min{x,z }, ) x σ < z, 3) z σ < x. Opening the modules, we notice that gx,y,z,σ ) is a parabola with respect to σ on each of the intervals specified above. Consider the behavior of gx,y,z,σ ) on each of these intervals. 1. < σ < min{x,z }, then necessarily σ < xz and gx,y,z,σ ) = σ +xy)yz +σ z y)). z y)z x) The coefficient /z x) at σ 4 is negative, thus the branches of this parabola with respect to σ look down and the maximum value of the function gz,y,z,σ ) within the interval < σ < min{x,z } is attained either at the vertex σ = +xz xy) yz, z y) if σ > yz, or at the point σ yz +, if σ yz. We have σ +yz = yzz x) yz x)) z y) since x < y < z, with the equality attained if and only if y =. Thus, the supremum is attained as σ yz +, which implies that p and reduces the problem to checking two-point distributions considered above. 9,

10 . z σ < x, then by virtue of the conditions r >, z >. 3. x σ < z, then the function gx,y,z,σ ) = z3 σ +xy) z x)z y) = rz3 < gx,y,z,σ ) = σ x z y)+y z x)+xyz)+xyzxy xz yz) z x)z y) is linear and decreases monotonically in σ, since x z y)+y z x)+xyz >. Thus, if x yz, then the supremum of gx,y,z,σ ) is supplied by σ yz +, which reduces the problem to checking two-point distributions considered above. If x > yz, then the supremum of gx,y,z,σ ) is attained at σ = x. With this value of σ we have gx,y,z,x ) = xx+y)x z yx +yz ). z x)z y) y gx,y,z,x ) = xx+z)yzz y)+xz y) ) z x)z y) <, since x < z and x < y < z. Thus, the supremum of gx,y,z,x ) over all y such that x < y and yz < x = σ is supplied by y max{x, x /z}+ = x /z +, i.e., p, which reduces the problem to checking two-point distributions considered above. Thus, the theorem is completely proved. References [1] L. H. Y. Chen, L. Goldstein, Q.-M. Shao. Normal approximation by Stein s method. Springer, Berlin, Heidelberg, 11. [] S. V. Gavrilenko. An improvement of the nonuniform estimates of convergence rate of distributions of Poisson random sums to the normal law. Informatics and its Applications in Russian), 51):1 4, 11. [3] L. Goldstein. L 1 bounds in normal approximation. Ann. Probab, 355): , 7. [4] L. Goldstein. Bounds on the constant in the mean central limit theorem. Ann. Probab, 384): , 1. arxiv:91.76, 9. [5] L. Goldstein, G. Reinert. Stein s method and the zero bias transformation with application to simple random sampling. Ann. Appl. Probab., 74):935 95, [6] L. Goldstein, G. Reinert. Distributional transformations, orthogonal polynomials, and Stein characterizations. J. Theor. Probab., 181):37 6, 5. [7] L. Goldstein, Y. Rinott. On multivariate normal approximations by Stein s method and size bias couplings. J. Appl. Probab., 33:1 17,

11 [8] M. E. Grigorieva, S. V. Popov. An upper bound for the absolute constant in the nonuniform version of the Berry Esseen inequalities for nonidentically distributed summands. Dokl. Math., 861):54 56, 1. [9] W. Hoeffding. The extrema of the expected value of a function of independent random variables. Ann. Math. Statist., 6):68 75, [1] V. Korolev, I. Shevtsova. An improvement of the Berry Esseen inequality with applications to Poisson and mixed Poisson random sums. Scand. Actuar. J., 1):81 15, 1. Available online since 4 June 1. [11] V. Yu. Korolev, I. G. Shevtsova. An improvement of the Berry Esseen inequalities. Dokl. Math., 811):119 13, 1. [1] V. Yu. Korolev, I. G. Shevtsova. On the upper bound for the absolute constant in the Berry Esseen inequality. Theory Probab. Appl., 544): , 1. [13] V. Yu. Korolev, I. G. Shevtsova. Sharpened upper bounds for the absolute constant in the Berry Esseen inequality for mixed Poisson random sums. Dokl. Math., 81):18 18, 1. [14] V. Yu. Korolev, I. G. Shevtsova. A new moment-type estimate of convergence rate in the Lyapunov theorem. Theory Probab. Appl., 553):55 59, 11. [15] E. Lukacs. Characteristic Functions. Griffin, London, nd edition, 197. [16] H. P. Mulholland, C. A. Rogers. Representation theorems for distribution functions. Proc. London Math. Soc., 8):177 3, [17] Yu. S. Nefedova, I. G. Shevtsova. Structural improvement of nonuniform estimates for the rate of convergence in the central limit theorem with applications to Poisson random sums. Dokl. Math., 84):675 68, 11. [18] Yu. S. Nefedova, I. G. Shevtsova. On non-uniform convergence rate estimates in the central limit theorem. Theory Probab. Appl. in Russian), 571):6 97, 1. [19] E. Peköz, A. Röllin, N. Ross. Degree asymptotics with rates for preferential attachment random graphs. Ann. Appl. Probab., 33): , 13. [] I. Shevtsova. On the absolute constants in the Berry Esseen type inequalities for identically distributed summands. arxiv: , 11. [1] C. Stein. Estimation of the mean of a multivariate normal distribution. Ann. Statist., 996): , [] I. Tyurin. New estimates of the convergence rate in the Lyapunov theorem. arxiv:91.76, 9. [3] I. S. Tyurin. On the accuracy of the Gaussian approximation. Dokl. Math., 83):84 843, 9. [4] V. M. Zolotarev. Modern Theory of Summation of Random Variables. VSP, Utrecht, The Netherlands,

On the absolute constants in the Berry Esseen type inequalities for identically distributed summands

On the absolute constants in the Berry Esseen type inequalities for identically distributed summands On the absolute constants in the Berry Esseen type inequalities for identically distributed summands Irina Shevtsova arxiv:1111.6554v1 [math.pr] 28 Nov 2011 Abstract By a modification of the method that

More information

Bounds on the Constant in the Mean Central Limit Theorem

Bounds on the Constant in the Mean Central Limit Theorem Bounds on the Constant in the Mean Central Limit Theorem Larry Goldstein University of Southern California, Ann. Prob. 2010 Classical Berry Esseen Theorem Let X, X 1, X 2,... be i.i.d. with distribution

More information

THE LINDEBERG-FELLER CENTRAL LIMIT THEOREM VIA ZERO BIAS TRANSFORMATION

THE LINDEBERG-FELLER CENTRAL LIMIT THEOREM VIA ZERO BIAS TRANSFORMATION THE LINDEBERG-FELLER CENTRAL LIMIT THEOREM VIA ZERO BIAS TRANSFORMATION JAINUL VAGHASIA Contents. Introduction. Notations 3. Background in Probability Theory 3.. Expectation and Variance 3.. Convergence

More information

Concentration of Measures by Bounded Size Bias Couplings

Concentration of Measures by Bounded Size Bias Couplings Concentration of Measures by Bounded Size Bias Couplings Subhankar Ghosh, Larry Goldstein University of Southern California [arxiv:0906.3886] January 10 th, 2013 Concentration of Measure Distributional

More information

Concentration of Measures by Bounded Couplings

Concentration of Measures by Bounded Couplings Concentration of Measures by Bounded Couplings Subhankar Ghosh, Larry Goldstein and Ümit Işlak University of Southern California [arxiv:0906.3886] [arxiv:1304.5001] May 2013 Concentration of Measure Distributional

More information

Stein s Method: Distributional Approximation and Concentration of Measure

Stein s Method: Distributional Approximation and Concentration of Measure Stein s Method: Distributional Approximation and Concentration of Measure Larry Goldstein University of Southern California 36 th Midwest Probability Colloquium, 2014 Stein s method for Distributional

More information

Self-normalized Cramér-Type Large Deviations for Independent Random Variables

Self-normalized Cramér-Type Large Deviations for Independent Random Variables Self-normalized Cramér-Type Large Deviations for Independent Random Variables Qi-Man Shao National University of Singapore and University of Oregon qmshao@darkwing.uoregon.edu 1. Introduction Let X, X

More information

arxiv: v2 [math.pr] 19 Oct 2010

arxiv: v2 [math.pr] 19 Oct 2010 The Annals of Probability 2010, Vol. 38, No. 4, 1672 1689 DOI: 10.1214/10-AOP527 c Institute of Mathematical tatistics, 2010 arxiv:0906.5145v2 [math.pr] 19 Oct 2010 BOUND ON THE CONTANT IN THE MEAN CENTRAL

More information

Generating and characteristic functions. Generating and Characteristic Functions. Probability generating function. Probability generating function

Generating and characteristic functions. Generating and Characteristic Functions. Probability generating function. Probability generating function Generating and characteristic functions Generating and Characteristic Functions September 3, 03 Probability generating function Moment generating function Power series expansion Characteristic function

More information

BOUNDS ON THE CONSTANT IN THE MEAN CENTRAL LIMIT THEOREM. BY LARRY GOLDSTEIN University of Southern California

BOUNDS ON THE CONSTANT IN THE MEAN CENTRAL LIMIT THEOREM. BY LARRY GOLDSTEIN University of Southern California The Annals of Probability 2010, Vol. 38, No. 4, 1672 1689 DOI: 10.1214/10-AOP527 Institute of Mathematical Statistics, 2010 BOUNDS ON THE CONSTANT IN THE MEAN CENTRAL LIMIT THEOREM BY LARRY GOLDSTEIN University

More information

On rate of convergence in distribution of asymptotically normal statistics based on samples of random size

On rate of convergence in distribution of asymptotically normal statistics based on samples of random size Annales Mathematicae et Informaticae 39 212 pp. 17 28 Proceedings of the Conference on Stochastic Models and their Applications Faculty of Informatics, University of Debrecen, Debrecen, Hungary, August

More information

Stein s Method and the Zero Bias Transformation with Application to Simple Random Sampling

Stein s Method and the Zero Bias Transformation with Application to Simple Random Sampling Stein s Method and the Zero Bias Transformation with Application to Simple Random Sampling Larry Goldstein and Gesine Reinert November 8, 001 Abstract Let W be a random variable with mean zero and variance

More information

Notes on Poisson Approximation

Notes on Poisson Approximation Notes on Poisson Approximation A. D. Barbour* Universität Zürich Progress in Stein s Method, Singapore, January 2009 These notes are a supplement to the article Topics in Poisson Approximation, which appeared

More information

Random Variables. P(x) = P[X(e)] = P(e). (1)

Random Variables. P(x) = P[X(e)] = P(e). (1) Random Variables Random variable (discrete or continuous) is used to derive the output statistical properties of a system whose input is a random variable or random in nature. Definition Consider an experiment

More information

Stein s method and zero bias transformation: Application to CDO pricing

Stein s method and zero bias transformation: Application to CDO pricing Stein s method and zero bias transformation: Application to CDO pricing ESILV and Ecole Polytechnique Joint work with N. El Karoui Introduction CDO a portfolio credit derivative containing 100 underlying

More information

BOUNDARY PROPERTIES OF FIRST-ORDER PARTIAL DERIVATIVES OF THE POISSON INTEGRAL FOR THE HALF-SPACE R + k+1. (k > 1)

BOUNDARY PROPERTIES OF FIRST-ORDER PARTIAL DERIVATIVES OF THE POISSON INTEGRAL FOR THE HALF-SPACE R + k+1. (k > 1) GEORGIAN MATHEMATICAL JOURNAL: Vol. 4, No. 6, 1997, 585-6 BOUNDARY PROPERTIES OF FIRST-ORDER PARTIAL DERIVATIVES OF THE POISSON INTEGRAL FOR THE HALF-SPACE R + k+1 (k > 1) S. TOPURIA Abstract. Boundary

More information

arxiv: v2 [math.st] 20 Feb 2013

arxiv: v2 [math.st] 20 Feb 2013 Exact bounds on the closeness between the Student and standard normal distributions arxiv:1101.3328v2 [math.st] 20 Feb 2013 Contents Iosif Pinelis Department of Mathematical Sciences Michigan Technological

More information

A note on the convex infimum convolution inequality

A note on the convex infimum convolution inequality A note on the convex infimum convolution inequality Naomi Feldheim, Arnaud Marsiglietti, Piotr Nayar, Jing Wang Abstract We characterize the symmetric measures which satisfy the one dimensional convex

More information

MOMENT CONVERGENCE RATES OF LIL FOR NEGATIVELY ASSOCIATED SEQUENCES

MOMENT CONVERGENCE RATES OF LIL FOR NEGATIVELY ASSOCIATED SEQUENCES J. Korean Math. Soc. 47 1, No., pp. 63 75 DOI 1.4134/JKMS.1.47..63 MOMENT CONVERGENCE RATES OF LIL FOR NEGATIVELY ASSOCIATED SEQUENCES Ke-Ang Fu Li-Hua Hu Abstract. Let X n ; n 1 be a strictly stationary

More information

Maxima and Minima. (a, b) of R if

Maxima and Minima. (a, b) of R if Maxima and Minima Definition Let R be any region on the xy-plane, a function f (x, y) attains its absolute or global, maximum value M on R at the point (a, b) of R if (i) f (x, y) M for all points (x,

More information

ON CONCENTRATION FUNCTIONS OF RANDOM VARIABLES. Sergey G. Bobkov and Gennadiy P. Chistyakov. June 2, 2013

ON CONCENTRATION FUNCTIONS OF RANDOM VARIABLES. Sergey G. Bobkov and Gennadiy P. Chistyakov. June 2, 2013 ON CONCENTRATION FUNCTIONS OF RANDOM VARIABLES Sergey G. Bobkov and Gennadiy P. Chistyakov June, 3 Abstract The concentration functions are considered for sums of independent random variables. Two sided

More information

Normal approximation of Poisson functionals in Kolmogorov distance

Normal approximation of Poisson functionals in Kolmogorov distance Normal approximation of Poisson functionals in Kolmogorov distance Matthias Schulte Abstract Peccati, Solè, Taqqu, and Utzet recently combined Stein s method and Malliavin calculus to obtain a bound for

More information

The Hilbert Transform and Fine Continuity

The Hilbert Transform and Fine Continuity Irish Math. Soc. Bulletin 58 (2006), 8 9 8 The Hilbert Transform and Fine Continuity J. B. TWOMEY Abstract. It is shown that the Hilbert transform of a function having bounded variation in a finite interval

More information

On Concentration Functions of Random Variables

On Concentration Functions of Random Variables J Theor Probab (05) 8:976 988 DOI 0.007/s0959-03-0504- On Concentration Functions of Random Variables Sergey G. Bobkov Gennadiy P. Chistyakov Received: 4 April 03 / Revised: 6 June 03 / Published online:

More information

AN INEQUALITY FOR TAIL PROBABILITIES OF MARTINGALES WITH BOUNDED DIFFERENCES

AN INEQUALITY FOR TAIL PROBABILITIES OF MARTINGALES WITH BOUNDED DIFFERENCES Lithuanian Mathematical Journal, Vol. 4, No. 3, 00 AN INEQUALITY FOR TAIL PROBABILITIES OF MARTINGALES WITH BOUNDED DIFFERENCES V. Bentkus Vilnius Institute of Mathematics and Informatics, Akademijos 4,

More information

arxiv: v1 [math.st] 2 Apr 2016

arxiv: v1 [math.st] 2 Apr 2016 NON-ASYMPTOTIC RESULTS FOR CORNISH-FISHER EXPANSIONS V.V. ULYANOV, M. AOSHIMA, AND Y. FUJIKOSHI arxiv:1604.00539v1 [math.st] 2 Apr 2016 Abstract. We get the computable error bounds for generalized Cornish-Fisher

More information

Section 3.5 The Implicit Function Theorem

Section 3.5 The Implicit Function Theorem Section 3.5 The Implicit Function Theorem THEOREM 11 (Special Implicit Function Theorem): Suppose that F : R n+1 R has continuous partial derivatives. Denoting points in R n+1 by (x, z), where x R n and

More information

Continuous Functions on Metric Spaces

Continuous Functions on Metric Spaces Continuous Functions on Metric Spaces Math 201A, Fall 2016 1 Continuous functions Definition 1. Let (X, d X ) and (Y, d Y ) be metric spaces. A function f : X Y is continuous at a X if for every ɛ > 0

More information

MA102: Multivariable Calculus

MA102: Multivariable Calculus MA102: Multivariable Calculus Rupam Barman and Shreemayee Bora Department of Mathematics IIT Guwahati Differentiability of f : U R n R m Definition: Let U R n be open. Then f : U R n R m is differentiable

More information

Limiting Distributions

Limiting Distributions Limiting Distributions We introduce the mode of convergence for a sequence of random variables, and discuss the convergence in probability and in distribution. The concept of convergence leads us to the

More information

Chapter 2. Random Variable. Define single random variables in terms of their PDF and CDF, and calculate moments such as the mean and variance.

Chapter 2. Random Variable. Define single random variables in terms of their PDF and CDF, and calculate moments such as the mean and variance. Chapter 2 Random Variable CLO2 Define single random variables in terms of their PDF and CDF, and calculate moments such as the mean and variance. 1 1. Introduction In Chapter 1, we introduced the concept

More information

On large deviations for combinatorial sums

On large deviations for combinatorial sums arxiv:1901.0444v1 [math.pr] 14 Jan 019 On large deviations for combinatorial sums Andrei N. Frolov Dept. of Mathematics and Mechanics St. Petersburg State University St. Petersburg, Russia E-mail address:

More information

A note on the growth rate in the Fazekas Klesov general law of large numbers and on the weak law of large numbers for tail series

A note on the growth rate in the Fazekas Klesov general law of large numbers and on the weak law of large numbers for tail series Publ. Math. Debrecen 73/1-2 2008), 1 10 A note on the growth rate in the Fazekas Klesov general law of large numbers and on the weak law of large numbers for tail series By SOO HAK SUNG Taejon), TIEN-CHUNG

More information

MODERATE DEVIATIONS IN POISSON APPROXIMATION: A FIRST ATTEMPT

MODERATE DEVIATIONS IN POISSON APPROXIMATION: A FIRST ATTEMPT Statistica Sinica 23 (2013), 1523-1540 doi:http://dx.doi.org/10.5705/ss.2012.203s MODERATE DEVIATIONS IN POISSON APPROXIMATION: A FIRST ATTEMPT Louis H. Y. Chen 1, Xiao Fang 1,2 and Qi-Man Shao 3 1 National

More information

Normal Approximation for Hierarchical Structures

Normal Approximation for Hierarchical Structures Normal Approximation for Hierarchical Structures Larry Goldstein University of Southern California July 1, 2004 Abstract Given F : [a, b] k [a, b] and a non-constant X 0 with P (X 0 [a, b]) = 1, define

More information

Real Analysis Math 131AH Rudin, Chapter #1. Dominique Abdi

Real Analysis Math 131AH Rudin, Chapter #1. Dominique Abdi Real Analysis Math 3AH Rudin, Chapter # Dominique Abdi.. If r is rational (r 0) and x is irrational, prove that r + x and rx are irrational. Solution. Assume the contrary, that r+x and rx are rational.

More information

Wasserstein-2 bounds in normal approximation under local dependence

Wasserstein-2 bounds in normal approximation under local dependence Wasserstein- bounds in normal approximation under local dependence arxiv:1807.05741v1 [math.pr] 16 Jul 018 Xiao Fang The Chinese University of Hong Kong Abstract: We obtain a general bound for the Wasserstein-

More information

The Hopf argument. Yves Coudene. IRMAR, Université Rennes 1, campus beaulieu, bat Rennes cedex, France

The Hopf argument. Yves Coudene. IRMAR, Université Rennes 1, campus beaulieu, bat Rennes cedex, France The Hopf argument Yves Coudene IRMAR, Université Rennes, campus beaulieu, bat.23 35042 Rennes cedex, France yves.coudene@univ-rennes.fr slightly updated from the published version in Journal of Modern

More information

The Central Limit Theorem: More of the Story

The Central Limit Theorem: More of the Story The Central Limit Theorem: More of the Story Steven Janke November 2015 Steven Janke (Seminar) The Central Limit Theorem:More of the Story November 2015 1 / 33 Central Limit Theorem Theorem (Central Limit

More information

arxiv: v3 [math.pr] 24 Mar 2016

arxiv: v3 [math.pr] 24 Mar 2016 BOUND FOR THE MAXIMAL PROBABILITY IN THE LITTLEWOOD OFFORD PROBLEM ANDREI YU. ZAITSEV arxiv:151.00697v3 [math.pr] 4 Mar 016 Abstract. The paper deals with studying a connection of the Littlewood Offord

More information

A NOTE ON A DISTRIBUTION OF WEIGHTED SUMS OF I.I.D. RAYLEIGH RANDOM VARIABLES

A NOTE ON A DISTRIBUTION OF WEIGHTED SUMS OF I.I.D. RAYLEIGH RANDOM VARIABLES Sankhyā : The Indian Journal of Statistics 1998, Volume 6, Series A, Pt. 2, pp. 171-175 A NOTE ON A DISTRIBUTION OF WEIGHTED SUMS OF I.I.D. RAYLEIGH RANDOM VARIABLES By P. HITCZENKO North Carolina State

More information

Moment Properties of Distributions Used in Stochastic Financial Models

Moment Properties of Distributions Used in Stochastic Financial Models Moment Properties of Distributions Used in Stochastic Financial Models Jordan Stoyanov Newcastle University (UK) & University of Ljubljana (Slovenia) e-mail: stoyanovj@gmail.com ETH Zürich, Department

More information

THE NEARLY ADDITIVE MAPS

THE NEARLY ADDITIVE MAPS Bull. Korean Math. Soc. 46 (009), No., pp. 199 07 DOI 10.4134/BKMS.009.46..199 THE NEARLY ADDITIVE MAPS Esmaeeil Ansari-Piri and Nasrin Eghbali Abstract. This note is a verification on the relations between

More information

SOME PROPERTIES ON THE CLOSED SUBSETS IN BANACH SPACES

SOME PROPERTIES ON THE CLOSED SUBSETS IN BANACH SPACES ARCHIVUM MATHEMATICUM (BRNO) Tomus 42 (2006), 167 174 SOME PROPERTIES ON THE CLOSED SUBSETS IN BANACH SPACES ABDELHAKIM MAADEN AND ABDELKADER STOUTI Abstract. It is shown that under natural assumptions,

More information

ECE 4400:693 - Information Theory

ECE 4400:693 - Information Theory ECE 4400:693 - Information Theory Dr. Nghi Tran Lecture 8: Differential Entropy Dr. Nghi Tran (ECE-University of Akron) ECE 4400:693 Lecture 1 / 43 Outline 1 Review: Entropy of discrete RVs 2 Differential

More information

EC9A0: Pre-sessional Advanced Mathematics Course. Lecture Notes: Unconstrained Optimisation By Pablo F. Beker 1

EC9A0: Pre-sessional Advanced Mathematics Course. Lecture Notes: Unconstrained Optimisation By Pablo F. Beker 1 EC9A0: Pre-sessional Advanced Mathematics Course Lecture Notes: Unconstrained Optimisation By Pablo F. Beker 1 1 Infimum and Supremum Definition 1. Fix a set Y R. A number α R is an upper bound of Y if

More information

A Short Introduction to Stein s Method

A Short Introduction to Stein s Method A Short Introduction to Stein s Method Gesine Reinert Department of Statistics University of Oxford 1 Overview Lecture 1: focusses mainly on normal approximation Lecture 2: other approximations 2 1. The

More information

are Banach algebras. f(x)g(x) max Example 7.4. Similarly, A = L and A = l with the pointwise multiplication

are Banach algebras. f(x)g(x) max Example 7.4. Similarly, A = L and A = l with the pointwise multiplication 7. Banach algebras Definition 7.1. A is called a Banach algebra (with unit) if: (1) A is a Banach space; (2) There is a multiplication A A A that has the following properties: (xy)z = x(yz), (x + y)z =

More information

A COMPOUND POISSON APPROXIMATION INEQUALITY

A COMPOUND POISSON APPROXIMATION INEQUALITY J. Appl. Prob. 43, 282 288 (2006) Printed in Israel Applied Probability Trust 2006 A COMPOUND POISSON APPROXIMATION INEQUALITY EROL A. PEKÖZ, Boston University Abstract We give conditions under which the

More information

STAT 200C: High-dimensional Statistics

STAT 200C: High-dimensional Statistics STAT 200C: High-dimensional Statistics Arash A. Amini May 30, 2018 1 / 59 Classical case: n d. Asymptotic assumption: d is fixed and n. Basic tools: LLN and CLT. High-dimensional setting: n d, e.g. n/d

More information

Part II Probability and Measure

Part II Probability and Measure Part II Probability and Measure Theorems Based on lectures by J. Miller Notes taken by Dexter Chua Michaelmas 2016 These notes are not endorsed by the lecturers, and I have modified them (often significantly)

More information

FINAL REVIEW Answers and hints Math 311 Fall 2017

FINAL REVIEW Answers and hints Math 311 Fall 2017 FINAL RVIW Answers and hints Math 3 Fall 7. Let R be a Jordan region and let f : R be integrable. Prove that the graph of f, as a subset of R 3, has zero volume. Let R be a rectangle with R. Since f is

More information

arxiv: v1 [math.pr] 24 Aug 2018

arxiv: v1 [math.pr] 24 Aug 2018 On a class of norms generated by nonnegative integrable distributions arxiv:180808200v1 [mathpr] 24 Aug 2018 Michael Falk a and Gilles Stupfler b a Institute of Mathematics, University of Würzburg, Würzburg,

More information

Non Uniform Bounds on Geometric Approximation Via Stein s Method and w-functions

Non Uniform Bounds on Geometric Approximation Via Stein s Method and w-functions Communications in Statistics Theory and Methods, 40: 45 58, 20 Copyright Taylor & Francis Group, LLC ISSN: 036-0926 print/532-45x online DOI: 0.080/036092090337778 Non Uniform Bounds on Geometric Approximation

More information

2x (x 2 + y 2 + 1) 2 2y. (x 2 + y 2 + 1) 4. 4xy. (1, 1)(x 1) + (1, 1)(y + 1) (1, 1)(x 1)(y + 1) 81 x y y + 7.

2x (x 2 + y 2 + 1) 2 2y. (x 2 + y 2 + 1) 4. 4xy. (1, 1)(x 1) + (1, 1)(y + 1) (1, 1)(x 1)(y + 1) 81 x y y + 7. Homework 8 Solutions, November 007. (1 We calculate some derivatives: f x = f y = x (x + y + 1 y (x + y + 1 x = (x + y + 1 4x (x + y + 1 4 y = (x + y + 1 4y (x + y + 1 4 x y = 4xy (x + y + 1 4 Substituting

More information

1 Review of di erential calculus

1 Review of di erential calculus Review of di erential calculus This chapter presents the main elements of di erential calculus needed in probability theory. Often, students taking a course on probability theory have problems with concepts

More information

Engg. Math. I. Unit-I. Differential Calculus

Engg. Math. I. Unit-I. Differential Calculus Dr. Satish Shukla 1 of 50 Engg. Math. I Unit-I Differential Calculus Syllabus: Limits of functions, continuous functions, uniform continuity, monotone and inverse functions. Differentiable functions, Rolle

More information

On Some Estimates of the Remainder in Taylor s Formula

On Some Estimates of the Remainder in Taylor s Formula Journal of Mathematical Analysis and Applications 263, 246 263 (2) doi:.6/jmaa.2.7622, available online at http://www.idealibrary.com on On Some Estimates of the Remainder in Taylor s Formula G. A. Anastassiou

More information

STA2603/205/1/2014 /2014. ry II. Tutorial letter 205/1/

STA2603/205/1/2014 /2014. ry II. Tutorial letter 205/1/ STA263/25//24 Tutorial letter 25// /24 Distribution Theor ry II STA263 Semester Department of Statistics CONTENTS: Examination preparation tutorial letterr Solutions to Assignment 6 2 Dear Student, This

More information

3. Probability inequalities

3. Probability inequalities 3. Probability inequalities 3.. Introduction. Probability inequalities are an important instrument which is commonly used practically in all divisions of the theory of probability inequality is the Chebysjev

More information

Large deviations for weighted random sums

Large deviations for weighted random sums Nonlinear Analysis: Modelling and Control, 2013, Vol. 18, No. 2, 129 142 129 Large deviations for weighted random sums Aurelija Kasparavičiūtė, Leonas Saulis Vilnius Gediminas Technical University Saulėtekio

More information

Sec. 14.3: Partial Derivatives. All of the following are ways of representing the derivative. y dx

Sec. 14.3: Partial Derivatives. All of the following are ways of representing the derivative. y dx Math 2204 Multivariable Calc Chapter 14: Partial Derivatives I. Review from math 1225 A. First Derivative Sec. 14.3: Partial Derivatives 1. Def n : The derivative of the function f with respect to the

More information

X n D X lim n F n (x) = F (x) for all x C F. lim n F n(u) = F (u) for all u C F. (2)

X n D X lim n F n (x) = F (x) for all x C F. lim n F n(u) = F (u) for all u C F. (2) 14:17 11/16/2 TOPIC. Convergence in distribution and related notions. This section studies the notion of the so-called convergence in distribution of real random variables. This is the kind of convergence

More information

Asymptotic at infinity. g(x) g(x) Tangential at finite point. slope y. slope y

Asymptotic at infinity. g(x) g(x) Tangential at finite point. slope y. slope y Conjugate Transformations Since sup x2c [yx g(x)] = inf [g(x) yx] it is geometrically clear that y 2Diff there is a number t such that the graph of the linear equation : t + yx "supports" g : C, in that

More information

On an uniqueness theorem for characteristic functions

On an uniqueness theorem for characteristic functions ISSN 392-53 Nonlinear Analysis: Modelling and Control, 207, Vol. 22, No. 3, 42 420 https://doi.org/0.5388/na.207.3.9 On an uniqueness theorem for characteristic functions Saulius Norvidas Institute of

More information

A Gentle Introduction to Stein s Method for Normal Approximation I

A Gentle Introduction to Stein s Method for Normal Approximation I A Gentle Introduction to Stein s Method for Normal Approximation I Larry Goldstein University of Southern California Introduction to Stein s Method for Normal Approximation 1. Much activity since Stein

More information

Supplementary Questions for HP Chapter Sketch graphs of the following functions: (a) z = y x. (b) z = ye x. (c) z = x 2 y 2

Supplementary Questions for HP Chapter Sketch graphs of the following functions: (a) z = y x. (b) z = ye x. (c) z = x 2 y 2 Supplementary Questions for HP Chapter 17 1. Sketch graphs of the following functions: (a) z = y x (b) z = ye x (c) z = x y. Find the domain and range of the given functions: (a) f(x, y) = 36 9x 4y (b)

More information

Analysis Finite and Infinite Sets The Real Numbers The Cantor Set

Analysis Finite and Infinite Sets The Real Numbers The Cantor Set Analysis Finite and Infinite Sets Definition. An initial segment is {n N n n 0 }. Definition. A finite set can be put into one-to-one correspondence with an initial segment. The empty set is also considered

More information

EXACT CONVERGENCE RATE AND LEADING TERM IN THE CENTRAL LIMIT THEOREM FOR U-STATISTICS

EXACT CONVERGENCE RATE AND LEADING TERM IN THE CENTRAL LIMIT THEOREM FOR U-STATISTICS Statistica Sinica 6006, 409-4 EXACT CONVERGENCE RATE AND LEADING TERM IN THE CENTRAL LIMIT THEOREM FOR U-STATISTICS Qiying Wang and Neville C Weber The University of Sydney Abstract: The leading term in

More information

PROPERTY OF HALF{SPACES. July 25, Abstract

PROPERTY OF HALF{SPACES. July 25, Abstract A CHARACTERIZATION OF GAUSSIAN MEASURES VIA THE ISOPERIMETRIC PROPERTY OF HALF{SPACES S. G. Bobkov y and C. Houdre z July 25, 1995 Abstract If the half{spaces of the form fx 2 R n : x 1 cg are extremal

More information

arxiv: v1 [math.ca] 31 Jan 2016

arxiv: v1 [math.ca] 31 Jan 2016 ASYMPTOTIC STABILITY OF THE CAUCHY AND JENSEN FUNCTIONAL EQUATIONS ANNA BAHYRYCZ, ZSOLT PÁLES, AND MAGDALENA PISZCZEK arxiv:160.00300v1 [math.ca] 31 Jan 016 Abstract. The aim of this note is to investigate

More information

Math 321 Final Examination April 1995 Notation used in this exam: N. (1) S N (f,x) = f(t)e int dt e inx.

Math 321 Final Examination April 1995 Notation used in this exam: N. (1) S N (f,x) = f(t)e int dt e inx. Math 321 Final Examination April 1995 Notation used in this exam: N 1 π (1) S N (f,x) = f(t)e int dt e inx. 2π n= N π (2) C(X, R) is the space of bounded real-valued functions on the metric space X, equipped

More information

UNIVERSITY of LIMERICK OLLSCOIL LUIMNIGH

UNIVERSITY of LIMERICK OLLSCOIL LUIMNIGH UNIVERSITY of LIMERICK OLLSCOIL LUIMNIGH Faculty of Science and Engineering Department of Mathematics and Statistics END OF SEMESTER ASSESSMENT PAPER MODULE CODE: MA4006 SEMESTER: Spring 2011 MODULE TITLE:

More information

Fixed point of ϕ-contraction in metric spaces endowed with a graph

Fixed point of ϕ-contraction in metric spaces endowed with a graph Annals of the University of Craiova, Mathematics and Computer Science Series Volume 374, 2010, Pages 85 92 ISSN: 1223-6934 Fixed point of ϕ-contraction in metric spaces endowed with a graph Florin Bojor

More information

A CHARACTERIZATION OF STRICT LOCAL MINIMIZERS OF ORDER ONE FOR STATIC MINMAX PROBLEMS IN THE PARAMETRIC CONSTRAINT CASE

A CHARACTERIZATION OF STRICT LOCAL MINIMIZERS OF ORDER ONE FOR STATIC MINMAX PROBLEMS IN THE PARAMETRIC CONSTRAINT CASE Journal of Applied Analysis Vol. 6, No. 1 (2000), pp. 139 148 A CHARACTERIZATION OF STRICT LOCAL MINIMIZERS OF ORDER ONE FOR STATIC MINMAX PROBLEMS IN THE PARAMETRIC CONSTRAINT CASE A. W. A. TAHA Received

More information

Journal of Inequalities in Pure and Applied Mathematics

Journal of Inequalities in Pure and Applied Mathematics Journal of Inequalities in Pure and Applied Mathematics ON SOME APPROXIMATE FUNCTIONAL RELATIONS STEMMING FROM ORTHOGONALITY PRESERVING PROPERTY JACEK CHMIELIŃSKI Instytut Matematyki, Akademia Pedagogiczna

More information

Module 3. Function of a Random Variable and its distribution

Module 3. Function of a Random Variable and its distribution Module 3 Function of a Random Variable and its distribution 1. Function of a Random Variable Let Ω, F, be a probability space and let be random variable defined on Ω, F,. Further let h: R R be a given

More information

MATH The Chain Rule Fall 2016 A vector function of a vector variable is a function F: R n R m. In practice, if x 1, x n is the input,

MATH The Chain Rule Fall 2016 A vector function of a vector variable is a function F: R n R m. In practice, if x 1, x n is the input, MATH 20550 The Chain Rule Fall 2016 A vector function of a vector variable is a function F: R n R m. In practice, if x 1, x n is the input, F(x 1,, x n ) F 1 (x 1,, x n ),, F m (x 1,, x n ) where each

More information

arxiv: v1 [math.oc] 21 Mar 2015

arxiv: v1 [math.oc] 21 Mar 2015 Convex KKM maps, monotone operators and Minty variational inequalities arxiv:1503.06363v1 [math.oc] 21 Mar 2015 Marc Lassonde Université des Antilles, 97159 Pointe à Pitre, France E-mail: marc.lassonde@univ-ag.fr

More information

Lecture Notes on Metric Spaces

Lecture Notes on Metric Spaces Lecture Notes on Metric Spaces Math 117: Summer 2007 John Douglas Moore Our goal of these notes is to explain a few facts regarding metric spaces not included in the first few chapters of the text [1],

More information

1* (10 pts) Let X be a random variable with P (X = 1) = P (X = 1) = 1 2

1* (10 pts) Let X be a random variable with P (X = 1) = P (X = 1) = 1 2 Math 736-1 Homework Fall 27 1* (1 pts) Let X be a random variable with P (X = 1) = P (X = 1) = 1 2 and let Y be a standard normal random variable. Assume that X and Y are independent. Find the distribution

More information

LOWELL WEEKLY JOURNAL

LOWELL WEEKLY JOURNAL Y G y G Y 87 y Y 8 Y - $ X ; ; y y q 8 y $8 $ $ $ G 8 q < 8 6 4 y 8 7 4 8 8 < < y 6 $ q - - y G y G - Y y y 8 y y y Y Y 7-7- G - y y y ) y - y y y y - - y - y 87 7-7- G G < G y G y y 6 X y G y y y 87 G

More information

A Note on Integral Transforms and Partial Differential Equations

A Note on Integral Transforms and Partial Differential Equations Applied Mathematical Sciences, Vol 4, 200, no 3, 09-8 A Note on Integral Transforms and Partial Differential Equations Adem Kılıçman and Hassan Eltayeb Department of Mathematics and Institute for Mathematical

More information

Stein Couplings for Concentration of Measure

Stein Couplings for Concentration of Measure Stein Couplings for Concentration of Measure Jay Bartroff, Subhankar Ghosh, Larry Goldstein and Ümit Işlak University of Southern California [arxiv:0906.3886] [arxiv:1304.5001] [arxiv:1402.6769] Borchard

More information

CONVERGENCE OF THE FRACTIONAL PARTS OF THE RANDOM VARIABLES TO THE TRUNCATED EXPONENTIAL DISTRIBUTION

CONVERGENCE OF THE FRACTIONAL PARTS OF THE RANDOM VARIABLES TO THE TRUNCATED EXPONENTIAL DISTRIBUTION Ann. Acad. Rom. Sci. Ser. Math. Appl. ISSN 2066-6594 Vol. 4, No. 2 / 202 CONVERGENCE OF THE FRACTIONAL PARTS OF THE RANDOM VARIABLES TO THE TRUNCATED EXPONENTIAL DISTRIBUTION Bogdan Gheorghe Munteanu Abstract

More information

THE STRONG LAW OF LARGE NUMBERS

THE STRONG LAW OF LARGE NUMBERS Applied Mathematics and Stochastic Analysis, 13:3 (2000), 261-267. NEGATIVELY DEPENDENT BOUNDED RANDOM VARIABLE PROBABILITY INEQUALITIES AND THE STRONG LAW OF LARGE NUMBERS M. AMINI and A. BOZORGNIA Ferdowsi

More information

Topology. Xiaolong Han. Department of Mathematics, California State University, Northridge, CA 91330, USA address:

Topology. Xiaolong Han. Department of Mathematics, California State University, Northridge, CA 91330, USA  address: Topology Xiaolong Han Department of Mathematics, California State University, Northridge, CA 91330, USA E-mail address: Xiaolong.Han@csun.edu Remark. You are entitled to a reward of 1 point toward a homework

More information

MAS223 Statistical Inference and Modelling Exercises

MAS223 Statistical Inference and Modelling Exercises MAS223 Statistical Inference and Modelling Exercises The exercises are grouped into sections, corresponding to chapters of the lecture notes Within each section exercises are divided into warm-up questions,

More information

Differentiation. f(x + h) f(x) Lh = L.

Differentiation. f(x + h) f(x) Lh = L. Analysis in R n Math 204, Section 30 Winter Quarter 2008 Paul Sally, e-mail: sally@math.uchicago.edu John Boller, e-mail: boller@math.uchicago.edu website: http://www.math.uchicago.edu/ boller/m203 Differentiation

More information

Strong log-concavity is preserved by convolution

Strong log-concavity is preserved by convolution Strong log-concavity is preserved by convolution Jon A. Wellner Abstract. We review and formulate results concerning strong-log-concavity in both discrete and continuous settings. Although four different

More information

THE INVERSE FUNCTION THEOREM

THE INVERSE FUNCTION THEOREM THE INVERSE FUNCTION THEOREM W. PATRICK HOOPER The implicit function theorem is the following result: Theorem 1. Let f be a C 1 function from a neighborhood of a point a R n into R n. Suppose A = Df(a)

More information

Stein s Method: Distributional Approximation and Concentration of Measure

Stein s Method: Distributional Approximation and Concentration of Measure Stein s Method: Distributional Approximation and Concentration of Measure Larry Goldstein University of Southern California 36 th Midwest Probability Colloquium, 2014 Concentration of Measure Distributional

More information

review To find the coefficient of all the terms in 15ab + 60bc 17ca: Coefficient of ab = 15 Coefficient of bc = 60 Coefficient of ca = -17

review To find the coefficient of all the terms in 15ab + 60bc 17ca: Coefficient of ab = 15 Coefficient of bc = 60 Coefficient of ca = -17 1. Revision Recall basic terms of algebraic expressions like Variable, Constant, Term, Coefficient, Polynomial etc. The coefficients of the terms in 4x 2 5xy + 6y 2 are Coefficient of 4x 2 is 4 Coefficient

More information

Solutions to old Exam 3 problems

Solutions to old Exam 3 problems Solutions to old Exam 3 problems Hi students! I am putting this version of my review for the Final exam review here on the web site, place and time to be announced. Enjoy!! Best, Bill Meeks PS. There are

More information

2 Sequences, Continuity, and Limits

2 Sequences, Continuity, and Limits 2 Sequences, Continuity, and Limits In this chapter, we introduce the fundamental notions of continuity and limit of a real-valued function of two variables. As in ACICARA, the definitions as well as proofs

More information

TWO MAPPINGS RELATED TO SEMI-INNER PRODUCTS AND THEIR APPLICATIONS IN GEOMETRY OF NORMED LINEAR SPACES. S.S. Dragomir and J.J.

TWO MAPPINGS RELATED TO SEMI-INNER PRODUCTS AND THEIR APPLICATIONS IN GEOMETRY OF NORMED LINEAR SPACES. S.S. Dragomir and J.J. RGMIA Research Report Collection, Vol. 2, No. 1, 1999 http://sci.vu.edu.au/ rgmia TWO MAPPINGS RELATED TO SEMI-INNER PRODUCTS AND THEIR APPLICATIONS IN GEOMETRY OF NORMED LINEAR SPACES S.S. Dragomir and

More information

Math 141: Section 4.1 Extreme Values of Functions - Notes

Math 141: Section 4.1 Extreme Values of Functions - Notes Math 141: Section 4.1 Extreme Values of Functions - Notes Definition: Let f be a function with domain D. Thenf has an absolute (global) maximum value on D at a point c if f(x) apple f(c) for all x in D

More information

Asymptotic behavior for sums of non-identically distributed random variables

Asymptotic behavior for sums of non-identically distributed random variables Appl. Math. J. Chinese Univ. 2019, 34(1: 45-54 Asymptotic behavior for sums of non-identically distributed random variables YU Chang-jun 1 CHENG Dong-ya 2,3 Abstract. For any given positive integer m,

More information

MATH 409 Advanced Calculus I Lecture 16: Mean value theorem. Taylor s formula.

MATH 409 Advanced Calculus I Lecture 16: Mean value theorem. Taylor s formula. MATH 409 Advanced Calculus I Lecture 16: Mean value theorem. Taylor s formula. Points of local extremum Let f : E R be a function defined on a set E R. Definition. We say that f attains a local maximum

More information

MATH 1301, Solutions to practice problems

MATH 1301, Solutions to practice problems MATH 1301, Solutions to practice problems 1. (a) (C) and (D); x = 7. In 3 years, Ann is x + 3 years old and years ago, when was x years old. We get the equation x + 3 = (x ) which is (D); (C) is obtained

More information