Distributional transformations, orthogonal polynomials, and Stein characterizations
|
|
- Virginia Gordon
- 6 years ago
- Views:
Transcription
1 Distributional transforations, orthogonal polynoials, and Stein characterizations LARRY GOLDSTEIN 13 and GESINE REINERT 23 Abstract A new class of distributional transforations is introduced, characterized by equations relating function weighted expectations of test functions on a given distribution to expectations of the transfored distribution on the test function s higher order derivatives. The class includes the size and zero bias transforations, and when specializing to weighting by polynoial functions, relates distributional failies closed under independent addition, and in particular the infinitely divisible distributions, to the faily of transforations induced by their associated orthogonal polynoial systes. For these failies, generalizing a well known property of size biasing, sus of independent variables are transfored by replacing suands chosen according to a ultivariate distribution on its index set by independent variables whose distributions are transfored by ebers of that sae faily. A variety of the transforations associated with the classical orthogonal polynoial systes have as fixed points the original distribution, or a eber of the sae faily with different paraeter. 1 Introduction The zero bias transforation was introduced in [13]. This apping enjoys properties siilar to those of the well known size biased transforation (see e.g. [15]) on non-negative variables, but can be applied to ean zero rando variables. One ain feature of the zero bias transforation is that its unique fixed point is the ean zero noral distribution, and for this reason it has been applied in Stein s ethod for the purpose of noral approxiation 1 Departent of Matheatics, University of Southern California, Los Angeles CA , USA 2 Departent of Statistics, University of Oxford, Oxford OX1 3TG, UK, supported in part by EPSRC grant no. GR/R52183/01 3 This work was partially copleted while the authors were visiting the Institute for Matheatical Sciences, National University of Singapore, in The visit was supported by the Institute. 1
2 ([13], [11], [12], and [14]). The zero bias transforation is also related to the K i function in the work [16], [5], [22], and [6] and others; for a good overview see [8]. We place the classical size bias transforation and the zero bias transforation in a broader context, showing that both are a particular case of transforing a given distribution X into X (P ) through the use of a easurable biasing function P. To be ore precise, for the given X and P let C denote the collection of functions whose th derivative exists and is easurable on R, and suppressing X on the left hand side, set F (P ) = {F C : E P (X)F (X) < }. We consider transforations characterized by EP (X)F (X) = αef () (X (P ) ) for all F F (P ), (1) where necessarily α = (!) 1 EP (X)X when X F(P ); we insist α > 0. We coin this distribution the X P biased distribution. For discrete distributions the differential operator is replaced by the difference operator; see Sections 4.3 and 4.4. Theore 2.1 provides our ost general conditions on the existence of transforations characterized by (1), where the biasing function P is only required to have sign changes and satisfy certain orthogonality and positivity conditions; we call the order of the resulting transforation. In the particular case where P is a polynoial, the sign change condition can be expressed in ters of the roots and order of the polynoial P, and the orthogonality properties in ters of oents. For exaple, for each = 0, 1,... there exists a distributional transforation which is defined using the Herite polynoial of order as the biasing function, and whose doain are those distributions whose first 2 oents atch those of the ean zero noral; the case = 1 corresponds to the zero bias transforation of [13]. Theore 2.1 in Section 2 shows distributional transforations exist in great generality. In Section 3 we find that there is considerable additional structure for the failies of transforations induced by orthogonal polynoial systes, especially those corresponding to failies of distributions which are closed under addition of independent variables. Corresponding to the Noral, Gaa, Poisson, Binoial and Beta-type distributions, in Section 4 we study the faily of transforations defined using the Herite, 2
3 Laguerre, Charlier, Krawtchouk, and Gegenbauer polynoials, and obtain high order Stein type characterizing equations. Our work here is in the spirit of [9], where other fundaental connections between Stein equations and orthogonal polynoials were first described. The approach in [9] is iterated in [24], cobining it with well-known connections between orthogonal polynoials and birth and death processes, and used as in [17] to describe solutions of Stein equations. We first review soe well known facts regarding the size bias transforation, which is the siplest and best known of all these distributional transforations. For non-negative X with 0 < EX = µ <, the X-size biased distribution X s is defined by the characterizing equation EXF (X) = µef (X s ) for all F F 0 (X). (2) One key feature of the sized bias transforation is the following. If X 1,..., X n are independent non-negative variables with finite positive expectations EX i = µ i and n W = X i, i=1 then a variable with the W -size biased distribution can be constructed by replacing a variable X i, chosen with probability proportional to µ i, by an independent variable Xi s having the X i -size biased distribution. In other words, letting µ i P (I = i) = nj=1 µ j be independent of X 1,..., X n, the variable W s = W X I + X s I (3) has the W -size biased distribution. Letting x + = ax(0, x), size biasing is the case of (1) with biasing function P (x) = x +. This transforation is of order zero, as there are = 0 sign changes of x + on R, and has α = EX + ; when X 0 we have X + = X resulting in the usual characterization (2). The zero bias transforation [13] was otivated by the siilarity between the size bias transforation and the Stein equation [21] for the ean zero noral distribution. In particular, Stein s identity says that Z N (0, ) if and only if EZF (Z) = EF (Z) for all F F 1 (Z). (4) 3
4 Coparing (4) to (2), for a ean zero, positive variance variable X, we say that X z has the X-zero biased distribution if EXF (X) = EF (X z ) for all F F 1 (X). (5) Note that (5) for zero biasing is the sae as (2) for size biasing, but with variance replacing ean, and F replacing F. That the noral distribution with variance is the unique fixed point of the zero bias transforation follows iediately fro the characterization (4). It was shown in [13] that the zero bias distribution X z exists for all X that have ean zero and finite positive variance. Its existence follows also fro Theore 2.1, as the special case of (1) for the function P (x) = x, having = 1 sign changes on R, and α equal to the variance of X. The zero bias transforation was introduced and used in [13] to obtain bounds of order n 1 in noral approxiations for sooth test functions under third order oent conditions, in the presence of dependence induced by siple rando sapling. In [11] it is used to provide bounds to the noral distribution for hierarchical sequences generated by the iteration of a so called averaging function, in [12] for noral approxiation in cobinatorial central liit theores with rando perutations having distribution constant over cycle type, and in [14] the extension of the zero bias transforation to higher diension is considered. The zero bias transforation enjoys a property siilar to (3) for size biasing. In particular, it was shown in [13] that a su of independent ean zero variables with finite variances can be zero biased by replacing one variable chosen with probability proportional to its variance by an independent variable fro that suands zero biased distribution. Precisely, let X 1,..., X n be independent ean zero variables with variance i = EXi 2 > 0, W = X X n, and I a rando index, independent of X 1,..., X n with distribution P (I = i) = i nj=1 j. (6) Then W z = W X I + X z I (7) 4
5 has the W -zero biased distribution, where Xi z is a variable independent of X j, j i having the X i zero biased distribution. This construction is extended to the failies of transforations associated with orthogonal polynoial in Theore 3.1. In particular, in Section 3 we see that for higher order transforations sus of independent variables are transfored by replacing ultiple variables chosen according to soe distribution (e.g. ultinoial, ultivariate hypergeoetric) with independent variables possessing distributions transfored by the sae faily. In Section 2 we give the oent and sign change conditions on P which guarantee the existence of the X P distribution and provide an explicit construction. In Section 3 we treat the special case where P is a eber of a faily of orthogonal polynoials. The generalization to higher order of the replace one variable zero and size bias constructions is based on the identity (25) expressing an orthogonal polynoial of a su as a su of like polynoials with suands having no larger order, and is given in Section 3. In Sections 4.1, 4.2, 4.3, 4.4 and 4.5 we treat the Herite, Laguerre, Charlier, Krawtchouk and Gegenbauer polynoials, corresponding to the Noral, Gaa, Poisson, Binoial and Beta-type distributions respectively. Special instances of the Beta-type distributions we consider are the unifor U[ 1, 1], the arcsine, and the sei-circle distribution. 2 Transforations in General We begin our study with the following existence and uniqueness theore for the types of distributional transforations under consideration. We say the easurable function P on R is positive on an interval I if P (x) 0 for all x I with strict inequality for at least one x, and siilarly for P negative on I. We say P has exactly = 0, 1,... sign changes if R can be partitioned into + 1 disjoint subintervals with non-epty interior such that P alternates sign on successive intervals. Though the choices for the endpoints of such intervals ay be soewhat arbitrary when there are intervals where P is zero, we will nevertheless say that a sign change occurs at the interval boundaries; the uniqueness guaranteed by Theore 2.1 shows that the X P biased distribution constructed in the proof of Theore 2.1 is the sae for all interval boundary choices, and Exaple 2.1 gives soe additional explanation of this phenoenon in the context of a particular exaple. We note that for existence in general, regarding boundedness, 5
6 the orthogonality conditions required by Theore 2.1 are only relative to P and required only up to a finite order; such conditions ay not ipose boundedness on any of the power oents of X, as illustrated in Exaple 2.1. Theore 2.1 Let X be a rando variable, {0, 1, 2,...} and P a easurable function with exactly sign changes, positive on its rightost interval and 1! EXk P (X) = αδ k, k = 0,...,, (8) with α > 0. Then there exists a unique distribution for a rando variable X (P ) such that EP (X)F (X) = αef () (X (P ) ) for all F F (P ). (9) Theore 2.1 says that X is in the doain of the distributional transforation of order defined using the biasing function P having sign changes when the powers of X saller than are orthogonal to P (X) in the L 2 (X) sense, that is, when P (X) {1, X,..., X 1 }, and EX P (X) > 0. As noted above, the existence of both the size and zero bias transforations are both special cases. Proof of Theore 2.1. We give an explicit construction of the variate X (P ). By replacing P by P/α, it suffices to prove the theore for α = 1. Label the points where the sign changes of P occur as r 1,..., r, and let Q(x) = (x r i ), (10) i=1 adopting the usual convention that an epty product is 1. By construction Q and P have the sae sign, so letting µ X denote the distribution of X, dµ Y (y) = 1! Q(y)P (y)dµ X(y) (11) is therefore a easure, and since (8) with k = iplies that EQ(X)P (X) =!, a probability easure. Now with Y and {U i } i 1 utually independent with Y having distribution µ Y and U j having distribution function u i on [0, 1], with r 0 = Y and r +1 = 0, we clai that X (P ) = +1 k=1 ( ) U i (r k 1 r k ) (12) i=k 6
7 satisfies (9), thus proving the existence of the X P biased distribution. We begin by noting that for any F for which either side below exists, and so for k = 0,...,, letting EF (Y ) = 1 EF (X)Q(X)P (X), (13)! R k (x) = i=k+1 (x r i ), a polynoial of degree k, by (13) and (8) we have k E(1/ (Y r i )) = 1 i=1! ER k(x)p (X) = δ k,. (14) We show the clai by induction. In particular, for k 1 letting +1 V k = U i, W k = i=k j=k V j (r j 1 r j ), (15) and taking X (P ) as in (12), we show that for all F Cc, the collection of infinitely differentiable functions with copact support, and k = 0,..., { F EF () (X (P ) ( k) } (V k+1 (Y r k+1 ) + W k+2 ) ) = k! E Vk+1 k ki=1. (16) (Y r i ) We see the expectation on the right hand exists since F and all its derivatives are bounded, V k+1 is independent of Y for all k, EUi k < for i k + 1, and use of (14). The case k = 0 is the stateent that X (P ) = V 1 (Y r 1 )+W 2, which follows fro definitions (12) and (15). Assue (16) holds for soe 0 k <. Using V k+1 = U k+1 V k+2 in (16) and taking expectation over U k+1, with density (k + 1)u k k+1, we obtain EF () (X (P ) ) = (k + 1)!E 1 0 { F ( k) } (u k+1 V k+2 (Y r k+1 ) + W k+2 ) u k k+1 V k+2 k ki=1 u k (Y r i ) k+1du k+1. Cancelling u k k+1 and integrating, we obtain { F ( (k+1)) (V k+2 (Y r k+1 ) + W k+2 ) F ( (k+1)) } (W k+2 ) (k + 1)!E Vk+2 k+1 k+1. (17) i=1 (Y r i ) 7
8 Using the independence of V k+2 and Y for any k, and that W k+2 is independent of Y for all k 0, the second ter in the expectation (17) vanishes by (14), since k+1 1. The induction is copleted by noting that definitions (15) give that V k+2 (Y r k+1 ) + W k+2 = V k+2 (Y r k+2 ) + W k+3. Now applying (16) for k = and using V +1 = 1, W +2 = 0 and r +1 = 0 we obtain { } F (Y ) EF () (X (P ) ) =!E = EP (X)F (X) Q(Y ) by (13). That is, the equality in (9) holds for all F C c. For F F (X), by replacing F by F (x) 1 j=0 F (j) (0) x j j! if necessary, we ay assue, in light of (8), that F (j) (0) = 0 for j = 0,..., 1, and hence, with If = x 0 f, F (x) = I f for soe easurable function f. Since F = F 1 F 2 where F 1 (x) = I f + and F 2 (x) = I f, it suffices by linearity to consider f 0. Letting 0 f n f we have I f n = F n F, and hence the equality in (9) holds for F F (X) using the onotone and doinated convergence theores on the right and left sides of (9), respectively. The distribution X (P ) is unique since (9) holds for all F Cc, which is separating. The existence of the X (P ) distribution also follows fro the Riesz representation theore upon deonstrating the positivity of the linear operator T defined by T f = EP (X)F (X) with F (x) = I f over f Cc 0, the space of continuous functions with copact support. The signed easure dµ = P dµ X has the property x j dµ = EX j P (X) = 0 for j = 0, 1,..., 1, and now the sign change property of P allows us, when on the finite interval [a, b], to invoke Theore 5.4 in Chapter XI of [19] (see also Exaple 1.4 in Chapter XI) to conclude T is positive and hence T f = b a fdµ() for soe easure µ (), which is a probability easure since 8
9 EX P (X) =!. This arguent is siilar to the one used in [13] to prove the existence of the zero bias distribution for a ean zero, finite variance X by noting that when f 0 the function F = If is non-decreasing, and hence X and F (X) are positively correlated, and so the operator is positive. T f = EXF (X) EXEF (X) = 0 Exaple 2.1 Consider the application of Theore 2.1 where P (x) has exactly = 1 sign change at r 1 = 0. Then for the non constant X to be in the doain of the transforation characterized by EP (X)F (X) = αef (X (P ) ) (18) we require EP (X) = 0 and α = EXP (X) > 0. We have Q(x) = x in (10) and, recalling the X variable in the proof was rescaled to have α = 1, the Y distribution in (11) is dµ Y (y) = xp (x)dµ X (y)/α. Fro (12) with = 1, r 0 = Y, r 2 = 0 and U j with distribution function u j on [0, 1] X (P ) = +1 k=1 ( ) U i (r k 1 r k ) = U 1 (r 0 r 1 ) + (r 1 r 2 ) = U 1 Y. i=k Hence X (P ) is absolutely continuous, and one can directly verify that its density is given by f (P ) (x) = α 1 E[P (X); X > x]. (19) When x 0 P (u)du is finite for all x and c = exp( α 1 x 0 P (u)du)dx <, the transforation (18) has a fixed point at the distribution with density ( f(x) = c 1 exp 1 x ) P (u)du ; α 0 for instance, when P (x) = x, f is the ean zero noral density with variance α. 9
10 Taking P to be the sign function P (x) = 1(x > 0) 1(x < 0) provides an exaple of a transforation given by a discontinuous P, and shows that generally the orthogonality conditions ay not reduce to restrictions on the oents of X, in particular, (8) for k = 0 requires X to have edian 0. If in addition α = E X is finite, iposed by (8) for k = 1, Theore 2.1 gives that X is in doain of the transforation characterized by (18). The density of the transfored variables are, by (19), f (P ) (x) = { P (X > x)/e X x > 0 P (X < x)/e X x < 0. (20) For this choice of P the Y distribution in (11) becoes dµ Y (y) = y dµ X (y)/e X, which is the X size biased distribution. Hence, the X P biased distribution is obtain by ultiplying Y µ Y by an independent U[0, 1] variable. The transforation has a fixed point at the Laplace distribution with density f(x) = 1 2α exp ( 1 α x ). Taking P (x) = 1(x > 1) 1(x < 1) gives a transforation having doain those variables X with α = E( X 1( X > 1)) < and satisfying P (X > 1) = P (X < 1). (21) Since P (x) = 0 in the set [ 1, 1] the sign change can be said to occur at point in ( 1, 1) and the polynoial Q in the proof of Theore 2.1 can be taken to be Q(x) = x r 1 for any r 1 ( 1, 1). As assured by uniqueness, the distribution constructed in the proof of Theore 2.1 does not depend on choice of r 1 ; in fact, in this case (21) iplies that the du Y distribution in (11) is the sae for all r 1 ( 1, 1). 10
11 3 Transforations using orthogonal polynoials We consider a syste of polynoinals orthogonal with respect to a non-trivial faily of distributions Z L indexed by a real paraeter. Condition 3.1 For soe 0, the polynoials {P k (x)} 0 k are onic, have degree k, are orthogonal with respect to the distributional faily Z L, and satisfy E[P k (Z )] 2 > 0. Note that since P k is onic and orthogonal it has k distinct roots and is positive as x (e.g. [1]); furtherore, we have EZ k P k (Z ) = E[P k (Z )] 2, k = 0,...,. When studying transforations using an iplicit faily of orthogonal polynoials, we index the transfored distribution by say, X (k), that is, by the paraeter and order k of the polynoial. Applying Theore 2.1 in this fraework, we obtain the following Corollary 3.1 Let Condition 3.1 be satisfied with EZ 2 k set Then for all X M k, where <, and for 0 α (k) = 1 k! EZk P k (Z ). (22) M k = {X : EX j = EZ j, 0 j 2k}, there exists a rando variable X (k) such that for all F F k (P k ) EP k (X)F (X) = α (k) EF (k) (X (k) ). (23) Proof: By Condition 3.1 and orthogonality we have for 0 j k, 1 k! EXj P k (X) = 1 k! EZj P k (Z ) = 1 k! EP j (Z )P k (Z ) = α (k) using X M k. Now invoke Theore 2.1. δ j,k 11
12 We say the faily of distributions Z is closed under independent addition if for independent Z i L i, i = 1, 2 we have Z 1 +Z 2 L There is special structure when the transforation function in Theore 2.1 is a eber of an orthogonal polynoial syste corresponding to such a faily. In particular, the following Theore 3.1 generalizes (3) and (7) in showing how a su of independent variables can be P transfored by replacing a randoly chosen collection in the su by variables with distributions transfored using the sae orthogonal polynoial syste. For n = 1, 2,..., consider a ulti-index = ( 1,..., n ), and with = ( 1,..., n ) and x = (x 1,..., x n ) let and set α () n = = i, n = i i=1 i=1 n = α ( i) i and P (x) = n i=1 i=1 P i i (x i ). (24) Theore 3.1 Let Z, > 0 be a faily of rando variables closed under independent addition with EZ 2 <, and suppose the associated orthogonal polynoials {P k (x)} 0 k satisfies Condition 3.1 and, for soe weights c, the identity P (w) = : = c P (x), (25) where P (x) is given in (24) and w = x x n. Then α () defined in (22) and (24) respectively, satisfy α () = : = and α () c α (), (26) and we ay consider the variable I, independent of all other variables, with distribution α P (I = ) = c () α (), =. (27) 12
13 Furtherore, for any positive 1,..., n and independent variables X 1,, X n with X i M i and n W = X i, i=1 the variable has the W P distribution. W () = : = (X i ) (I i) i Proof. Since X i M i, we have for 0 k 2, and independent Z i L i and Z L, that n n EW k = E( X i ) k = E( Z i ) k = EZ. k i=1 i=1 Hence W M, and the W () distribution exists by Corollary 3.1. Equality (26) follows by ultiplying (25) by W = ( i X i ) taking expectation, and using independence and orthogonality. By (26), for any F C c, α () EF () (W () ) = E Using independence and successively applying the identity c α () F () (W () ). (28) α ( i) i EF (q) ((X i ) ( i) i + y) = EP i i (X i )F (q i) (X i + y), (29) we see that the right hand side of (28) is equal to E c P (X)F (W ) = EP (W )F (W ), (30) by (25). Coparing (28) to (30) we have α () EF () (W () ) = EP (W )F (W ), for all F C c, and hence W () has the W -P biased distribution. 13
14 For the possibly infinite syste of onic polynoials {P (x)} orthogonal with respect to L, define the generating function φ t (x, ) = 0 P (x) t!. (31) Though the constants α () can be found using F (x) = x in (23), squaring (31) and taking expectation using orthogonality gives the alternative ethod E[φ t (Z, )] 2 = 0 α () t 2!. (32) Theore 3.2 applies in the special cases considered in Sections 4.1 through 4.4. Theore 3.2 If the polynoial generating function φ t (x, ) in (31) satisfies n φ t (w, ) = φ t (x i, i ) (33) i=1 for w = x x n and = n, then (25), and hence (27), in Theore 3.1 are satisfied respectively by c = ( ) Proof: Rewriting (33), 0 and P (I = ) = t! P (w) = = = n i=1 i 0 P 1,, n t! 0 ( ) () α α () P i i (x i ) t i i! =, =. (x) t1+ +n 1! n! ( ) P (x), giving (25) with the values claied. We also note that squaring (25) and taking expectation, using independence and orthogonality, results in α () = = ( ) 1 c 2 α, (34) 14
15 so that the conclusion of Theore 3.2 can also be seen to hold by equating coefficients of (26) and (34) when α takes on sufficiently any values. We end this section with a result about the potential for iterated biasing. Theore 3.3 Let Condition 3.1 be satisfied, and suppose that the the distributional faily at Z is closed under transforation with respect to P k (x), that is, there exists µ(, k) such that (Z ) (k) = Z µ(,k). Then if X M we have X (k) M k µ(k,) for k. In particular for non-negative j with 0 k + j, the distribution (X (k) )(j) µ(,k) exists. Proof. Let 0 j 2( k) and F (x) = x k+j /(k + j) k, where (x) k = x(x 1) (x k + 1). Then α (k) E(X(k) = EP k (Z )F (Z ) = α (k) )j = α (k) EF (k) (X (k) ) = EP k (X)F (X) EF (k) ((Z ) (k) ) = α(k) E(Z µ(,k)) j. Thus the first 2( k) oents of X (k) atch those of Z µ(,k), and the existence of the distribution (X (k) )(j) µ(,k) follows fro Corollary Special Orthogonal Polynoial Systes In Sections we specialize to the classic Herite, Laguerre, Charlier, Krawtchouk and Gegenbauer orthogonal polynoial systes, corresponding to the Noral, Gaa, Poisson, Binoial and a Beta like faily, respectively. All these failies correspond to a collection of orthogonal polynoials satisfying Condition 3.1, and except for the last case, have a generating function which satisfies (33). The Noral and Poisson distributions are fixed points of their associated transforations. In the Gaa, Binoial and Beta-type cases the transforations ap to the sae faily, but with a shifted paraeter. For further connections between probability distributions and such polynoial syste generating functions, see [2] and [3]. 15
16 4.1 Herite Polynoials For σ 2 = > 0, define the collection of Herite polynoials {H (x)} 0 through the generating function or equivalently, the Rodriguez forula e xt 1 2 t2 = H (x) t =0!, (35) H (x) = ( ) e x2 2 d x 2 dx e 2. (36) These polynoials are orthogonal with respect to the noral distribution N (0, ) with density (2π) 1/2 exp( x 2 /(2)). For F Cc and Z N (0, ), applying the Rodriguez forula (36) we have Hence, EH (Z )F (Z ) = = = ( ( ) e x2 d 2 ( ) ( d x 2 dx e 2 ) x 2 dx e 2 F () (x) e x 2 2 dx 2π ) F (x) e x2 2 2π dx 1 F (x) dx 2π = EF () (Z ). (37) (Z ) () = Z, that is, for each = 0, 1,..., the noral Z N (0, ) is a fixed point of the th order transforation induced by H (x). Fro (37) we see that α () =, which we could find alternatively using (32) and E[e Z t 1 2 t2 ] 2 = e t2 = t2 0!. Now since the generating function (35) satisfies the conditions of Theore 3.2, the distribution of the rando index I in Theore 3.1 is ultinoial 16
17 Mult(, ). For zero biasing and = 1, this ultinoial distribution reduces to the pick an index proportional to variance as specified in (6). Lastly, we indicate two ways in which the classical Stein equation can be generalized to the Herite case. With N h = Eh(Z), the standard noral expectation of h, both the equations and f (x)h 1 1 (x) H 1 (x)f(x) = h(x) N h (38) f () (x) H 1 (x)f(x) = h(x) N h (39) reduce to the usual Stein equation when = 1 (see [21], [22]) f (x) xf(x) = h(x) N h, (40) and in particular the expectations on the left hand sides of each evaluated at a rando variable W are zero for all f Cc if and only if W is standard noral. 4.2 Laguerre Polynoials For > 0, let {L (x)} 0 be the collection of Laguerre polynoials defined by the generating function { } xt (1 + t) exp = 1 + t or equivalently, the Rodriguez forula L (x) t =0!, (41) L (x) = ( 1) x +1 e x d dx x+ 1 e x, (42) which are orthogonal with respect to the Gaa distribution with paraeter, having density x 1 e x /Γ(), x > 0. For F Cc and Z with this density, applying the Rodriguez forula (42) yields EL (Z )F (Z ) = 0 ( 1) x +1 e x ( d dx x+ 1 e x ) F (x) x 1 e x dx Γ() 17
18 = ( 1) Γ() = ( d 0 Γ( + ) Γ() where () is the rising factorial, 0 dx x+ 1 e x ) F (x)dx F () (x) x+ 1 e x Γ( + ) dx = () EF () (Z + ), (43) () = ( + 1) ( + 1) = Γ( + ). Γ() Hence Fro (43) we see that α () using (32) and E (Z ) () = Z +. = (), which we could find alternatively [ ( )] (1 + t) Z t 2 exp = (1 t 2 ) = () t2 1 + t 0!. Since the generating function (41) satisfies the conditions of Theore 3.2, the rando index I in Theore 3.1 has distribution P (I = ) = ( ) ni=1 ( i ) i = () ( ) ni=1 i ( ) i + 1, which we recognize as the ultivariate hypergeoetric distribution with paraeters and ,..., n + n 1, see [18], p.301. Though the Gaa is not a fixed point of the Laguerre transforations as the noral is for the Herites, nevertheless there exist Stein equations for the Gaa paralleling (40) for the noral which can be used for studying distributional approxiations for the Gaa faily; for details, see [20]. In particular, we have the Stein characterization that X Γ(, 1) if and only if E(X )f(x) = EXf (X) for all soooth functions f. Using that L 1 (x) = x, the X (1) order one Laguerre transforation is characterized by E(X )f(x) = Ef (X (1) ) 18
19 for all sooth functions f. Coparing these two equations we see that X Γ(, 1) if and only if for all sooth functions f, EXf (X) = Ef (X (1) ); in other words, X Γ(, 1) if and only if X (1), the first order Laguerre transforation of X, equals its size bias transforation X s. 4.3 Charlier Polynoials For > 0, let {C (x)} 0 be the collection of Charlier polynoials defined by the generating function e t (1 + t) x = C (x) t =0!, (44) or, equivalently, with (x) k = x(x 1) (x k + 1), the falling factorial, C (x) = k=0 ( ) (x) k ( ) k, (45) k giving a faily orthogonal with respect to the Poisson distribution P() with ass function e k /k!, k = 0, 1,.... Fro (45) one can derive the Rodriguez forula ( C (x) = ( 1) Γ(x + 1) x x ), (46) Γ(x + 1) where f(x) = f(x) f(x 1), the backward difference. Since the transforations in Theore 2.1 defined using derivatives of test functions yield absolutely continuous distributions when 1, no discrete distribution will be a fixed point. However, parallel to (9), for an integer valued rando variable X we can define the discrete X P biased distribution via EP (X)F (X) = αe F (X () ) for all F F (P ), (47) where f(x) = f(x + 1) f(x), and again suppressing dependence on X, F (P ) = {F : R R : E P (X)F (X) < }. 19
20 That for all = 0, 1... the Poisson P()-distribution is a fixed point (Z ) () = Z of the discrete transforation (47) with P replaced by C follows. For Z P(), by the Rodriguez forula (46) and can be seen as b k a k = ( 1) b k a k, (48) k=0 k=0 we have EC k (Z )F (Z ) = e k=0 k! C (k)f (k) ( ) = ( 1) e k F (k) k! Fro (49) we see that α () (32) and k=0 = e k F (k) k! k=0 = E F (Z ). (49) =, which we could find alternatively using E[e t (1 + t) Z ] 2 = e t2 = t2 0!. Using the existence of the Charlier biased distributions and that (29) holds with derivative replaced by difference, it is easy to see that the arguent and hence conclusion of Theore 3.1 holds in this discrete case. Now since the generating function (44) satisfies the conditions of Theore 3.2, the distribution of the rando index I in Theore 3.1 is ultinoial Mult(, ), as in the noral case. As the order one Charlier polynoial is C 1 (x) = x, Stein characterizations of the for (38) or (39), with Herite replaced by Charlier and derivatives replaced by differences, generalize the Stein equation for the Poisson distribution with paraeter given in [7], and extensively studied for exaple in [4]. 20
21 4.4 Krawtchouk Polynoials With = 1, 2,... and p (0, 1) fixed, let {K (x)} 0 be the collection of Krawtchouk polynoials defined by the generating function (1 + qt) x (1 pt) x = =0 t! K (x) (50) where p + q = 1, giving the faily of polynoials orthogonal with respect to the Binoial B(, p) distribution. In contrast to the previous exaples, the Binoial is not infinitely divisible and has support on a bounded set. Following the approach set out in [3], the polynoials can also be given by the Rodriguez forula K (x) = ( 1)! ( ) p x q x {( ) ( ) x } p ), x q and so for Z B(, p), 0 and bounded F, ( x EK (Z )F (Z ) = EF (Z ) ( 1)! ( ) p Z q Z ( ) ( ) Z p ) q = =! ( k k=0 ( ) ( Z )p k q k F (k) ( 1)! ( ) p k q k p q ( 1) k=0 Z ( ) k ( F (k) k ) ( p q ( k ) k. ) ( ) k p q Using (48) and letting () again be the falling factorial, we write the last expression as ( ) ( ) () p q k p F (k) k=0 k q ( ) = () (pq) p k q k F (k) k k=0 = α () E F (Z () ), 21
22 yielding α () = () (pq) and (Z ) () = Z. Hence, siilar to the Gaa faily, the Binoial distribution is not a fixed point of its own transforational faily, but the transfored distribution is a eber of the sae faily. One can calculate α () alternatively using (32), (50), and series expansion of E(1 + qt) 2Z (1 pt) 2 2Z = (1 + pqt 2 ). As for Exaple 4.3, the conclusion of Theore 3.1 holds, and since the generating function (50) satisfies the conditions of Theore 3.2 the distribution of the rando index I in Theore 3.1 is given by P (I = ) = ( ) (pq) i ni=1 ( i ) i () (pq) = ( ) ni=1 ( i ) i = () ni=1 ( i i ) ( ), which we recognize as the ultivariate hypergeoetric distribution with paraeters and 1,..., n, see [18], p.301. Fro [10] we have the Stein characterization that X B(, p) if and only if pe( X)f(X + 1) = qexf(x), for all functions f for which these expectations exist. Using the first Krawtchouk polynoial is K 1 (x) = qx p( x), we obtain that the first order Krawtchouk transforation is characterized by qexf(x) pe( X)f(X) = pqe f(x (1) ). Cobining these equations yields that X B(, p) if and only if pe( X) f(x) = pe( X)(f(X + 1) f(x)) = qexf(x) pe( X)f(X) = pqe f(x (1) ). Putting g(x) = f( x) we see that X B(, p) if and only if X (1) has the ( X)-size biased distribution, that is, if and only if X (1) B( 1, q) + 1, which is equivalent to X (1) B( 1, p). 22
23 4.5 Gegenbauer Polynoials In this last section, we consider a polynoial syste orthogonal with respect to a continuous distribution with copact support. For > 1, let (see [3]) 2 α () = Γ()Γ(2 + )Γ( + 1) 2 2 Γ( + + 1)Γ( + )Γ(2), and the collection of Gegenbauer polynoials G (x) be defined via the Rodriguez forula G (x) = ( 1) α () Γ( + 1 )Γ( + + 1) 2 Γ( + 1)Γ( + + 1)(1 x2 ) 1 d 2 dx {(1 2 x2 ) }. Then G (x) are onic, have degree, and satisfy the orthogonality relation where Z g with 1! EGk (Z )G (Z ) = α () δ k, k = 0,...,, g (x) = 1 Γ( + 1) π Γ( + 1)(1 x2 ) 1 2, x 1. 2 In particular Corollary 3.1 obtains, proving the existence of the faily of Gegenbauer transforations. This faily of distribution is a special case of the centered Pearson Type I-distributions, soeties also called Beta Type I-distributions, see [23], p.150. We note that for = 1/2 we obtain the unifor distribution U[ 1, 1], for = 0 the arcsine law, and for = 1 the sei-circle law [25], [26]. Considering the action of the G transforation on Z g, for F Cc we have EG (Z )F (Z ) = 1 Γ( + 1) π Γ( + 1 α () Γ( + 1 )Γ( + + 1) )( 1) Γ( + 1)Γ( + + 1) 2 1 = 1 α () Γ( + + 1) 1 π Γ( + + 1) F () (x)(1 x 2 ) = α () EF () (Z + ), F (x) d dx {(1 x2 ) } 23
24 yielding (Z ) () = Z +. Thus, for = 0 we obtain that the first order Gegenbauer transforation of the arcsine distribution is the sei-circle law. Lastly we note that since the above Beta-type distributions are not invariant under addition, Theore 3.1 and its construction do not apply. However, as G 1 (x) = x, we recognize the first order Gegenbauer transforation as the zero-bias transforation, so that for sus of independent rando variables the construction given in (7) applies. Acknowledgeent. The authors would like to thank the organizers of the progra Stein s ethod and applications: A progra in honor of Charles Stein and the Institute of Matheatical Sciences in Singapore for their ost generous hospitality, and the excellent eeting where this work was copleted. Also we would like to thank an anonyous referee for very helpful coents. References [1] Abraowitz and A.A. Stegun, eds. (1972) Handbook of Matheatical Functions. M Dover, New York [2] Asai, N., Kubo, I., and Kuo, H. (2003). Multiplicative renoralization and generating functions I. Taiwanese Journal of Matheatics 7, [3] Asai, N., Kubo, I., and Kuo, H. (2004). Multiplicative renoralization and generating functions II. To appear in Taiwanese Journal of Matheatics. [4] Barbour, A.D., Holst, L., and Janson, S. (1992). Poisson Approxiation. Oxford University Press. [5] Bolthausen, E. (1984). An estiate of the reainder in a cobinatorial central liit theore. Z. Wahrscheinlichkeitstheor. Verw. Geb. 66, [6] Cacoullos, T., Papathanasiou, V., and Utev, S. (1994). Variational inequalities with exaples and an application to the central liit theore. Ann. Probab. 22,
25 [7] Chen, L.H.Y. (1975). Poisson approxiation for dependent trials. Ann. Probab. 3, [8] Chen, L.H.Y. and Shao, Q-M. (2003). Stein s ethod and noral approxiation. Tutorial notes for the workshop on Stein s ethod and Applications. shao [9] Diaconis, P., and Zabell, S. (1991). Closed for suation for classical distributions: variations on a thee of de Moivre. Statistical Science 6, [10] Eh, W. (1991). Binoial approxiation to the Poisson binoial distribution. Statistics and Probability Letters 11, [11] Goldstein, L. (2003). Noral approxiation for hierarchical sequences. Annals of Applied Probability, In Press. [12] Goldstein, L. (2004). Berry Esseen bounds for cobinatorial central liit theores and pattern occurrences, using zero and size biasing. Preprint. [13] Goldstein, L., and Reinert, G. (1997) Stein s ethod and the zero bias transforation with application to siple rando sapling. Ann. Appl. Probab. 7, [14] Goldstein, L., and Reinert, G. (2004) Zero biasing in one and higher diensions, and applications. Preprint. [15] Goldstein, L., and Rinott, Y. (1996). On ultivariate noral approxiations by Stein s ethod and size bias couplings. J. Appl. Prob. 33, [16] Ho, S.-T., and Chen, L.H.Y. (1978). An L p bound for the reainder in a cobinatorial central liit theore. Ann. Probab. 6, [17] Holes. S. (1998). Stein s ethod for birth and death processes. Preprint. [18] Johnson, N.L., and Kotz, S. (1969). Discrete Distributions. Wiley, New York etc. 25
26 [19] Karlin, S. and Studden, W.J. (1966). Tchebycheff Systes, with Applications in Analysis and Statistics. Interscience, New York. [20] Luk, H.M. (1994). Stein s ethod for the gaa distribution and related statistical applications. Ph.D. thesis. University of Southern California, Los Angeles, USA. [21] Stein, C. (1972). A bound for the error in the noral approxiation to the distribution of a su of dependent rando variables. Proc. Sixth Berkeley Syp. Math. Statist. Probab. 2, Univ. California Press, Berkeley. [22] Stein, C. (1986). Approxiate Coputation of Expectations. IMS, Hayward, California. [23] Kendall, M.G. ad Stuart, S. (1969). The Advanced Theory of Statistics. Volue 1: Distribution Theory. Griffin, London. [24] Schoutens, W. (2001). Orthogonal polynoials in Stein s ethod. J. Math. Anal. Appl. 253, [25] Wigner, E. P. (1955). Characteristic vectors of bordered atrices with infinite diension. Ann. Math [26] Wigner, E. P. (1958). On the distribution of the roots of certain syetric atrices. Ann. Math
Uniform Approximation and Bernstein Polynomials with Coefficients in the Unit Interval
Unifor Approxiation and Bernstein Polynoials with Coefficients in the Unit Interval Weiang Qian and Marc D. Riedel Electrical and Coputer Engineering, University of Minnesota 200 Union St. S.E. Minneapolis,
More informationThe Distribution of the Covariance Matrix for a Subset of Elliptical Distributions with Extension to Two Kurtosis Parameters
journal of ultivariate analysis 58, 96106 (1996) article no. 0041 The Distribution of the Covariance Matrix for a Subset of Elliptical Distributions with Extension to Two Kurtosis Paraeters H. S. Steyn
More information13.2 Fully Polynomial Randomized Approximation Scheme for Permanent of Random 0-1 Matrices
CS71 Randoness & Coputation Spring 018 Instructor: Alistair Sinclair Lecture 13: February 7 Disclaier: These notes have not been subjected to the usual scrutiny accorded to foral publications. They ay
More informationThe Weierstrass Approximation Theorem
36 The Weierstrass Approxiation Theore Recall that the fundaental idea underlying the construction of the real nubers is approxiation by the sipler rational nubers. Firstly, nubers are often deterined
More informationChapter 6 1-D Continuous Groups
Chapter 6 1-D Continuous Groups Continuous groups consist of group eleents labelled by one or ore continuous variables, say a 1, a 2,, a r, where each variable has a well- defined range. This chapter explores:
More informationSemicircle law for generalized Curie-Weiss matrix ensembles at subcritical temperature
Seicircle law for generalized Curie-Weiss atrix ensebles at subcritical teperature Werner Kirsch Fakultät für Matheatik und Inforatik FernUniversität in Hagen, Gerany Thoas Kriecherbauer Matheatisches
More informationMASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 11 10/15/2008 ABSTRACT INTEGRATION I
MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 11 10/15/2008 ABSTRACT INTEGRATION I Contents 1. Preliinaries 2. The ain result 3. The Rieann integral 4. The integral of a nonnegative
More informationResearch Article Some Formulae of Products of the Apostol-Bernoulli and Apostol-Euler Polynomials
Discrete Dynaics in Nature and Society Volue 202, Article ID 927953, pages doi:055/202/927953 Research Article Soe Forulae of Products of the Apostol-Bernoulli and Apostol-Euler Polynoials Yuan He and
More informationProbability Distributions
Probability Distributions In Chapter, we ephasized the central role played by probability theory in the solution of pattern recognition probles. We turn now to an exploration of soe particular exaples
More informationOn Conditions for Linearity of Optimal Estimation
On Conditions for Linearity of Optial Estiation Erah Akyol, Kuar Viswanatha and Kenneth Rose {eakyol, kuar, rose}@ece.ucsb.edu Departent of Electrical and Coputer Engineering University of California at
More informationThe degree of a typical vertex in generalized random intersection graph models
Discrete Matheatics 306 006 15 165 www.elsevier.co/locate/disc The degree of a typical vertex in generalized rando intersection graph odels Jerzy Jaworski a, Michał Karoński a, Dudley Stark b a Departent
More informationEXPLICIT CONGRUENCES FOR EULER POLYNOMIALS
EXPLICIT CONGRUENCES FOR EULER POLYNOMIALS Zhi-Wei Sun Departent of Matheatics, Nanjing University Nanjing 10093, People s Republic of China zwsun@nju.edu.cn Abstract In this paper we establish soe explicit
More informationGeneralized eigenfunctions and a Borel Theorem on the Sierpinski Gasket.
Generalized eigenfunctions and a Borel Theore on the Sierpinski Gasket. Kasso A. Okoudjou, Luke G. Rogers, and Robert S. Strichartz May 26, 2006 1 Introduction There is a well developed theory (see [5,
More informationarxiv: v2 [math.pr] 24 Mar 2016
arxiv:1603.01889v2 [ath.pr] 24 Mar 2016 The rate of convergence of soe asyptotically chi-square distributed statistics by Stein s ethod Robert E. Gaunt and Gesine Reinert Departent of Statistics University
More informationA Bernstein-Markov Theorem for Normed Spaces
A Bernstein-Markov Theore for Nored Spaces Lawrence A. Harris Departent of Matheatics, University of Kentucky Lexington, Kentucky 40506-0027 Abstract Let X and Y be real nored linear spaces and let φ :
More informationKeywords: Estimator, Bias, Mean-squared error, normality, generalized Pareto distribution
Testing approxiate norality of an estiator using the estiated MSE and bias with an application to the shape paraeter of the generalized Pareto distribution J. Martin van Zyl Abstract In this work the norality
More informationStein 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 informationDescent polynomials. Mohamed Omar Department of Mathematics, Harvey Mudd College, 301 Platt Boulevard, Claremont, CA , USA,
Descent polynoials arxiv:1710.11033v2 [ath.co] 13 Nov 2017 Alexander Diaz-Lopez Departent of Matheatics and Statistics, Villanova University, 800 Lancaster Avenue, Villanova, PA 19085, USA, alexander.diaz-lopez@villanova.edu
More informationExplicit solution of the polynomial least-squares approximation problem on Chebyshev extrema nodes
Explicit solution of the polynoial least-squares approxiation proble on Chebyshev extrea nodes Alfredo Eisinberg, Giuseppe Fedele Dipartiento di Elettronica Inforatica e Sisteistica, Università degli Studi
More informationTHE SUPER CATALAN NUMBERS S(m, m + s) FOR s 3 AND SOME INTEGER FACTORIAL RATIOS. 1. Introduction. = (2n)!
THE SUPER CATALAN NUMBERS S(, + s FOR s 3 AND SOME INTEGER FACTORIAL RATIOS XIN CHEN AND JANE WANG Abstract. We give a cobinatorial interpretation for the super Catalan nuber S(, + s for s 3 using lattice
More informationNon-uniform Berry Esseen Bounds for Weighted U-Statistics and Generalized L-Statistics
Coun Math Stat 0 :5 67 DOI 0.007/s4004-0-009- Non-unifor Berry Esseen Bounds for Weighted U-Statistics and Generalized L-Statistics Haojun Hu Qi-Man Shao Received: 9 August 0 / Accepted: Septeber 0 / Published
More informationStatistics and Probability Letters
Statistics and Probability Letters 79 2009 223 233 Contents lists available at ScienceDirect Statistics and Probability Letters journal hoepage: www.elsevier.co/locate/stapro A CLT for a one-diensional
More informationA := A i : {A i } S. is an algebra. The same object is obtained when the union in required to be disjoint.
59 6. ABSTRACT MEASURE THEORY Having developed the Lebesgue integral with respect to the general easures, we now have a general concept with few specific exaples to actually test it on. Indeed, so far
More informationPREPRINT 2006:17. Inequalities of the Brunn-Minkowski Type for Gaussian Measures CHRISTER BORELL
PREPRINT 2006:7 Inequalities of the Brunn-Minkowski Type for Gaussian Measures CHRISTER BORELL Departent of Matheatical Sciences Division of Matheatics CHALMERS UNIVERSITY OF TECHNOLOGY GÖTEBORG UNIVERSITY
More informationThis article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and
This article appeared in a ournal published by Elsevier. The attached copy is furnished to the author for internal non-coercial research and education use, including for instruction at the authors institution
More informationComputable Shell Decomposition Bounds
Coputable Shell Decoposition Bounds John Langford TTI-Chicago jcl@cs.cu.edu David McAllester TTI-Chicago dac@autoreason.co Editor: Leslie Pack Kaelbling and David Cohn Abstract Haussler, Kearns, Seung
More informationRAFIA(MBA) TUTOR S UPLOADED FILE Course STA301: Statistics and Probability Lecture No 1 to 5
Course STA0: Statistics and Probability Lecture No to 5 Multiple Choice Questions:. Statistics deals with: a) Observations b) Aggregates of facts*** c) Individuals d) Isolated ites. A nuber of students
More informationDivisibility of Polynomials over Finite Fields and Combinatorial Applications
Designs, Codes and Cryptography anuscript No. (will be inserted by the editor) Divisibility of Polynoials over Finite Fields and Cobinatorial Applications Daniel Panario Olga Sosnovski Brett Stevens Qiang
More informationPolygonal Designs: Existence and Construction
Polygonal Designs: Existence and Construction John Hegean Departent of Matheatics, Stanford University, Stanford, CA 9405 Jeff Langford Departent of Matheatics, Drake University, Des Moines, IA 5011 G
More informationThe concavity and convexity of the Boros Moll sequences
The concavity and convexity of the Boros Moll sequences Ernest X.W. Xia Departent of Matheatics Jiangsu University Zhenjiang, Jiangsu 1013, P.R. China ernestxwxia@163.co Subitted: Oct 1, 013; Accepted:
More informationNon-Parametric Non-Line-of-Sight Identification 1
Non-Paraetric Non-Line-of-Sight Identification Sinan Gezici, Hisashi Kobayashi and H. Vincent Poor Departent of Electrical Engineering School of Engineering and Applied Science Princeton University, Princeton,
More informationSome Classical Ergodic Theorems
Soe Classical Ergodic Theores Matt Rosenzweig Contents Classical Ergodic Theores. Mean Ergodic Theores........................................2 Maxial Ergodic Theore.....................................
More informationIn this chapter, we consider several graph-theoretic and probabilistic models
THREE ONE GRAPH-THEORETIC AND STATISTICAL MODELS 3.1 INTRODUCTION In this chapter, we consider several graph-theoretic and probabilistic odels for a social network, which we do under different assuptions
More informationA symbolic operator approach to several summation formulas for power series II
A sybolic operator approach to several suation forulas for power series II T. X. He, L. C. Hsu 2, and P. J.-S. Shiue 3 Departent of Matheatics and Coputer Science Illinois Wesleyan University Blooington,
More informationPoly-Bernoulli Numbers and Eulerian Numbers
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 21 (2018, Article 18.6.1 Poly-Bernoulli Nubers and Eulerian Nubers Beáta Bényi Faculty of Water Sciences National University of Public Service H-1441
More information3.3 Variational Characterization of Singular Values
3.3. Variational Characterization of Singular Values 61 3.3 Variational Characterization of Singular Values Since the singular values are square roots of the eigenvalues of the Heritian atrices A A and
More informationResearch Article On the Isolated Vertices and Connectivity in Random Intersection Graphs
International Cobinatorics Volue 2011, Article ID 872703, 9 pages doi:10.1155/2011/872703 Research Article On the Isolated Vertices and Connectivity in Rando Intersection Graphs Yilun Shang Institute for
More informationFeature Extraction Techniques
Feature Extraction Techniques Unsupervised Learning II Feature Extraction Unsupervised ethods can also be used to find features which can be useful for categorization. There are unsupervised ethods that
More information. The univariate situation. It is well-known for a long tie that denoinators of Pade approxiants can be considered as orthogonal polynoials with respe
PROPERTIES OF MULTIVARIATE HOMOGENEOUS ORTHOGONAL POLYNOMIALS Brahi Benouahane y Annie Cuyt? Keywords Abstract It is well-known that the denoinators of Pade approxiants can be considered as orthogonal
More informationTesting Properties of Collections of Distributions
Testing Properties of Collections of Distributions Reut Levi Dana Ron Ronitt Rubinfeld April 9, 0 Abstract We propose a fraework for studying property testing of collections of distributions, where the
More informationarxiv: v1 [cs.ds] 3 Feb 2014
arxiv:40.043v [cs.ds] 3 Feb 04 A Bound on the Expected Optiality of Rando Feasible Solutions to Cobinatorial Optiization Probles Evan A. Sultani The Johns Hopins University APL evan@sultani.co http://www.sultani.co/
More informationThe Hilbert Schmidt version of the commutator theorem for zero trace matrices
The Hilbert Schidt version of the coutator theore for zero trace atrices Oer Angel Gideon Schechtan March 205 Abstract Let A be a coplex atrix with zero trace. Then there are atrices B and C such that
More informationElementary properties of 1-isometries on a Hilbert space
Eleentary properties of 1-isoetries on a Hilbert space Muneo Chō Departaent of Matheatics, Kanagawa University Hiratsua 259-1293, Japan Caixing Gu y Departent of Matheatics, California Polytechnic State
More informationNew upper bound for the B-spline basis condition number II. K. Scherer. Institut fur Angewandte Mathematik, Universitat Bonn, Bonn, Germany.
New upper bound for the B-spline basis condition nuber II. A proof of de Boor's 2 -conjecture K. Scherer Institut fur Angewandte Matheati, Universitat Bonn, 535 Bonn, Gerany and A. Yu. Shadrin Coputing
More informationBipartite subgraphs and the smallest eigenvalue
Bipartite subgraphs and the sallest eigenvalue Noga Alon Benny Sudaov Abstract Two results dealing with the relation between the sallest eigenvalue of a graph and its bipartite subgraphs are obtained.
More informationSampling How Big a Sample?
C. G. G. Aitken, 1 Ph.D. Sapling How Big a Saple? REFERENCE: Aitken CGG. Sapling how big a saple? J Forensic Sci 1999;44(4):750 760. ABSTRACT: It is thought that, in a consignent of discrete units, a certain
More informationComputational and Statistical Learning Theory
Coputational and Statistical Learning Theory Proble sets 5 and 6 Due: Noveber th Please send your solutions to learning-subissions@ttic.edu Notations/Definitions Recall the definition of saple based Radeacher
More informationCurious Bounds for Floor Function Sums
1 47 6 11 Journal of Integer Sequences, Vol. 1 (018), Article 18.1.8 Curious Bounds for Floor Function Sus Thotsaporn Thanatipanonda and Elaine Wong 1 Science Division Mahidol University International
More informationNecessity of low effective dimension
Necessity of low effective diension Art B. Owen Stanford University October 2002, Orig: July 2002 Abstract Practitioners have long noticed that quasi-monte Carlo ethods work very well on functions that
More informationHermite s Rule Surpasses Simpson s: in Mathematics Curricula Simpson s Rule. Should be Replaced by Hermite s
International Matheatical Foru, 4, 9, no. 34, 663-686 Herite s Rule Surpasses Sipson s: in Matheatics Curricula Sipson s Rule Should be Replaced by Herite s Vito Lapret University of Lublana Faculty of
More informationE0 370 Statistical Learning Theory Lecture 5 (Aug 25, 2011)
E0 370 Statistical Learning Theory Lecture 5 Aug 5, 0 Covering Nubers, Pseudo-Diension, and Fat-Shattering Diension Lecturer: Shivani Agarwal Scribe: Shivani Agarwal Introduction So far we have seen how
More informationTail estimates for norms of sums of log-concave random vectors
Tail estiates for nors of sus of log-concave rando vectors Rados law Adaczak Rafa l Lata la Alexander E. Litvak Alain Pajor Nicole Toczak-Jaegerann Abstract We establish new tail estiates for order statistics
More informationSupplement to: Subsampling Methods for Persistent Homology
Suppleent to: Subsapling Methods for Persistent Hoology A. Technical results In this section, we present soe technical results that will be used to prove the ain theores. First, we expand the notation
More informationPrerequisites. We recall: Theorem 2 A subset of a countably innite set is countable.
Prerequisites 1 Set Theory We recall the basic facts about countable and uncountable sets, union and intersection of sets and iages and preiages of functions. 1.1 Countable and uncountable sets We can
More informationAsymptotics of weighted random sums
Asyptotics of weighted rando sus José Manuel Corcuera, David Nualart, Mark Podolskij arxiv:402.44v [ath.pr] 6 Feb 204 February 7, 204 Abstract In this paper we study the asyptotic behaviour of weighted
More informationChaotic Coupled Map Lattices
Chaotic Coupled Map Lattices Author: Dustin Keys Advisors: Dr. Robert Indik, Dr. Kevin Lin 1 Introduction When a syste of chaotic aps is coupled in a way that allows the to share inforation about each
More informationPattern Recognition and Machine Learning. Artificial Neural networks
Pattern Recognition and Machine Learning Jaes L. Crowley ENSIMAG 3 - MMIS Fall Seester 2017 Lessons 7 20 Dec 2017 Outline Artificial Neural networks Notation...2 Introduction...3 Key Equations... 3 Artificial
More informationMoments of the product and ratio of two correlated chi-square variables
Stat Papers 009 50:581 59 DOI 10.1007/s0036-007-0105-0 REGULAR ARTICLE Moents of the product and ratio of two correlated chi-square variables Anwar H. Joarder Received: June 006 / Revised: 8 October 007
More informationThe Euler-Maclaurin Formula and Sums of Powers
DRAFT VOL 79, NO 1, FEBRUARY 26 1 The Euler-Maclaurin Forula and Sus of Powers Michael Z Spivey University of Puget Sound Tacoa, WA 98416 spivey@upsedu Matheaticians have long been intrigued by the su
More informationSUSAN M. PITTS ABSTRACT
A FUNCTIONAL APPROACH TO APPROXIMATIONS FOR THE INDIVIDUAL RISK MODEL BY SUSAN M. PITTS ABSTRACT A functional approach is taken for the total clai aount distribution for the individual risk odel. Various
More informationA Simple Regression Problem
A Siple Regression Proble R. M. Castro March 23, 2 In this brief note a siple regression proble will be introduced, illustrating clearly the bias-variance tradeoff. Let Y i f(x i ) + W i, i,..., n, where
More information4 = (0.02) 3 13, = 0.25 because = 25. Simi-
Theore. Let b and be integers greater than. If = (. a a 2 a i ) b,then for any t N, in base (b + t), the fraction has the digital representation = (. a a 2 a i ) b+t, where a i = a i + tk i with k i =
More informationEstimating Parameters for a Gaussian pdf
Pattern Recognition and achine Learning Jaes L. Crowley ENSIAG 3 IS First Seester 00/0 Lesson 5 7 Noveber 00 Contents Estiating Paraeters for a Gaussian pdf Notation... The Pattern Recognition Proble...3
More informationAlireza Kamel Mirmostafaee
Bull. Korean Math. Soc. 47 (2010), No. 4, pp. 777 785 DOI 10.4134/BKMS.2010.47.4.777 STABILITY OF THE MONOMIAL FUNCTIONAL EQUATION IN QUASI NORMED SPACES Alireza Kael Mirostafaee Abstract. Let X be a linear
More informationPattern Recognition and Machine Learning. Learning and Evaluation for Pattern Recognition
Pattern Recognition and Machine Learning Jaes L. Crowley ENSIMAG 3 - MMIS Fall Seester 2017 Lesson 1 4 October 2017 Outline Learning and Evaluation for Pattern Recognition Notation...2 1. The Pattern Recognition
More informationVC Dimension and Sauer s Lemma
CMSC 35900 (Spring 2008) Learning Theory Lecture: VC Diension and Sauer s Lea Instructors: Sha Kakade and Abuj Tewari Radeacher Averages and Growth Function Theore Let F be a class of ±-valued functions
More informationPattern Recognition and Machine Learning. Artificial Neural networks
Pattern Recognition and Machine Learning Jaes L. Crowley ENSIMAG 3 - MMIS Fall Seester 2016 Lessons 7 14 Dec 2016 Outline Artificial Neural networks Notation...2 1. Introduction...3... 3 The Artificial
More informationComputable Shell Decomposition Bounds
Journal of Machine Learning Research 5 (2004) 529-547 Subitted 1/03; Revised 8/03; Published 5/04 Coputable Shell Decoposition Bounds John Langford David McAllester Toyota Technology Institute at Chicago
More informationFAST DYNAMO ON THE REAL LINE
FAST DYAMO O THE REAL LIE O. KOZLOVSKI & P. VYTOVA Abstract. In this paper we show that a piecewise expanding ap on the interval, extended to the real line by a non-expanding ap satisfying soe ild hypthesis
More informationBlock designs and statistics
Bloc designs and statistics Notes for Math 447 May 3, 2011 The ain paraeters of a bloc design are nuber of varieties v, bloc size, nuber of blocs b. A design is built on a set of v eleents. Each eleent
More informationLeft-to-right maxima in words and multiset permutations
Left-to-right axia in words and ultiset perutations Ay N. Myers Saint Joseph s University Philadelphia, PA 19131 Herbert S. Wilf University of Pennsylvania Philadelphia, PA 19104
More informationAn Extension to the Tactical Planning Model for a Job Shop: Continuous-Time Control
An Extension to the Tactical Planning Model for a Job Shop: Continuous-Tie Control Chee Chong. Teo, Rohit Bhatnagar, and Stephen C. Graves Singapore-MIT Alliance, Nanyang Technological Univ., and Massachusetts
More informationBIVARIATE NONCENTRAL DISTRIBUTIONS: AN APPROACH VIA THE COMPOUNDING METHOD
South African Statist J 06 50, 03 03 BIVARIATE NONCENTRAL DISTRIBUTIONS: AN APPROACH VIA THE COMPOUNDING METHOD Johan Ferreira Departent of Statistics, Faculty of Natural and Agricultural Sciences, University
More informationFourier Series Summary (From Salivahanan et al, 2002)
Fourier Series Suary (Fro Salivahanan et al, ) A periodic continuous signal f(t), - < t
More informationSoft Computing Techniques Help Assign Weights to Different Factors in Vulnerability Analysis
Soft Coputing Techniques Help Assign Weights to Different Factors in Vulnerability Analysis Beverly Rivera 1,2, Irbis Gallegos 1, and Vladik Kreinovich 2 1 Regional Cyber and Energy Security Center RCES
More informationDistributed Subgradient Methods for Multi-agent Optimization
1 Distributed Subgradient Methods for Multi-agent Optiization Angelia Nedić and Asuan Ozdaglar October 29, 2007 Abstract We study a distributed coputation odel for optiizing a su of convex objective functions
More informationIntelligent Systems: Reasoning and Recognition. Perceptrons and Support Vector Machines
Intelligent Systes: Reasoning and Recognition Jaes L. Crowley osig 1 Winter Seester 2018 Lesson 6 27 February 2018 Outline Perceptrons and Support Vector achines Notation...2 Linear odels...3 Lines, Planes
More information1 Generalization bounds based on Rademacher complexity
COS 5: Theoretical Machine Learning Lecturer: Rob Schapire Lecture #0 Scribe: Suqi Liu March 07, 08 Last tie we started proving this very general result about how quickly the epirical average converges
More informationSolutions 1. Introduction to Coding Theory - Spring 2010 Solutions 1. Exercise 1.1. See Examples 1.2 and 1.11 in the course notes.
Solutions 1 Exercise 1.1. See Exaples 1.2 and 1.11 in the course notes. Exercise 1.2. Observe that the Haing distance of two vectors is the iniu nuber of bit flips required to transfor one into the other.
More information1 Bounding the Margin
COS 511: Theoretical Machine Learning Lecturer: Rob Schapire Lecture #12 Scribe: Jian Min Si March 14, 2013 1 Bounding the Margin We are continuing the proof of a bound on the generalization error of AdaBoost
More informationGeneralized binomial expansion on Lorentz cones
J. Math. Anal. Appl. 79 003 66 75 www.elsevier.co/locate/jaa Generalized binoial expansion on Lorentz cones Honging Ding Departent of Matheatics and Matheatical Coputer Science, University of St. Louis,
More information2 Q 10. Likewise, in case of multiple particles, the corresponding density in 2 must be averaged over all
Lecture 6 Introduction to kinetic theory of plasa waves Introduction to kinetic theory So far we have been odeling plasa dynaics using fluid equations. The assuption has been that the pressure can be either
More informationTHE AVERAGE NORM OF POLYNOMIALS OF FIXED HEIGHT
THE AVERAGE NORM OF POLYNOMIALS OF FIXED HEIGHT PETER BORWEIN AND KWOK-KWONG STEPHEN CHOI Abstract. Let n be any integer and ( n ) X F n : a i z i : a i, ± i be the set of all polynoials of height and
More informationarxiv: v1 [math.pr] 17 May 2009
A strong law of large nubers for artingale arrays Yves F. Atchadé arxiv:0905.2761v1 [ath.pr] 17 May 2009 March 2009 Abstract: We prove a artingale triangular array generalization of the Chow-Birnbau- Marshall
More informationA note on the multiplication of sparse matrices
Cent. Eur. J. Cop. Sci. 41) 2014 1-11 DOI: 10.2478/s13537-014-0201-x Central European Journal of Coputer Science A note on the ultiplication of sparse atrices Research Article Keivan Borna 12, Sohrab Aboozarkhani
More informationBiostatistics Department Technical Report
Biostatistics Departent Technical Report BST006-00 Estiation of Prevalence by Pool Screening With Equal Sized Pools and a egative Binoial Sapling Model Charles R. Katholi, Ph.D. Eeritus Professor Departent
More informationIN modern society that various systems have become more
Developent of Reliability Function in -Coponent Standby Redundant Syste with Priority Based on Maxiu Entropy Principle Ryosuke Hirata, Ikuo Arizono, Ryosuke Toohiro, Satoshi Oigawa, and Yasuhiko Takeoto
More informationShannon Sampling II. Connections to Learning Theory
Shannon Sapling II Connections to Learning heory Steve Sale oyota echnological Institute at Chicago 147 East 60th Street, Chicago, IL 60637, USA E-ail: sale@athberkeleyedu Ding-Xuan Zhou Departent of Matheatics,
More informationBernoulli Numbers. Junior Number Theory Seminar University of Texas at Austin September 6th, 2005 Matilde N. Lalín. m 1 ( ) m + 1 k. B m.
Bernoulli Nubers Junior Nuber Theory Seinar University of Texas at Austin Septeber 6th, 5 Matilde N. Lalín I will ostly follow []. Definition and soe identities Definition 1 Bernoulli nubers are defined
More informationConnection coefficients between orthogonal polynomials and the canonical sequence
Connection coefficients between orthogonal polynoials and the canonical sequence P. Maroni Laboratoire Jacques-Louis Lions - CNRS Université Pierre et Marie Curie Boite courrier 187, 75252 Paris cedex
More informationSymbolic Analysis as Universal Tool for Deriving Properties of Non-linear Algorithms Case study of EM Algorithm
Acta Polytechnica Hungarica Vol., No., 04 Sybolic Analysis as Universal Tool for Deriving Properties of Non-linear Algoriths Case study of EM Algorith Vladiir Mladenović, Miroslav Lutovac, Dana Porrat
More informationAn Approximate Model for the Theoretical Prediction of the Velocity Increase in the Intermediate Ballistics Period
An Approxiate Model for the Theoretical Prediction of the Velocity... 77 Central European Journal of Energetic Materials, 205, 2(), 77-88 ISSN 2353-843 An Approxiate Model for the Theoretical Prediction
More informationPoisson processes and their properties
Poisson processes and their properties Poisson processes. collection {N(t) : t [, )} of rando variable indexed by tie t is called a continuous-tie stochastic process, Furtherore, we call N(t) a Poisson
More informationVARIABLES. Contents 1. Preliminaries 1 2. One variable Special cases 8 3. Two variables Special cases 14 References 16
q-generating FUNCTIONS FOR ONE AND TWO VARIABLES. THOMAS ERNST Contents 1. Preliinaries 1. One variable 6.1. Special cases 8 3. Two variables 10 3.1. Special cases 14 References 16 Abstract. We use a ultidiensional
More informationON THE TWO-LEVEL PRECONDITIONING IN LEAST SQUARES METHOD
PROCEEDINGS OF THE YEREVAN STATE UNIVERSITY Physical and Matheatical Sciences 04,, p. 7 5 ON THE TWO-LEVEL PRECONDITIONING IN LEAST SQUARES METHOD M a t h e a t i c s Yu. A. HAKOPIAN, R. Z. HOVHANNISYAN
More information#A52 INTEGERS 10 (2010), COMBINATORIAL INTERPRETATIONS OF BINOMIAL COEFFICIENT ANALOGUES RELATED TO LUCAS SEQUENCES
#A5 INTEGERS 10 (010), 697-703 COMBINATORIAL INTERPRETATIONS OF BINOMIAL COEFFICIENT ANALOGUES RELATED TO LUCAS SEQUENCES Bruce E Sagan 1 Departent of Matheatics, Michigan State University, East Lansing,
More informationLower Bounds for Quantized Matrix Completion
Lower Bounds for Quantized Matrix Copletion Mary Wootters and Yaniv Plan Departent of Matheatics University of Michigan Ann Arbor, MI Eail: wootters, yplan}@uich.edu Mark A. Davenport School of Elec. &
More informationProbability and Stochastic Processes: A Friendly Introduction for Electrical and Computer Engineers Roy D. Yates and David J.
Probability and Stochastic Processes: A Friendly Introduction for Electrical and oputer Engineers Roy D. Yates and David J. Goodan Proble Solutions : Yates and Goodan,1..3 1.3.1 1.4.6 1.4.7 1.4.8 1..6
More informationDERIVING PROPER UNIFORM PRIORS FOR REGRESSION COEFFICIENTS
DERIVING PROPER UNIFORM PRIORS FOR REGRESSION COEFFICIENTS N. van Erp and P. van Gelder Structural Hydraulic and Probabilistic Design, TU Delft Delft, The Netherlands Abstract. In probles of odel coparison
More informationAnalysis of Polynomial & Rational Functions ( summary )
Analysis of Polynoial & Rational Functions ( suary ) The standard for of a polynoial function is ( ) where each of the nubers are called the coefficients. The polynoial of is said to have degree n, where
More information