A Non-Uniform Bound on Normal Approximation of Randomized Orthogonal Array Sampling Designs
|
|
- Winifred Hawkins
- 6 years ago
- Views:
Transcription
1 International Mathematical Forum,, 007, no. 48, A Non-Uniform Bound on Normal Approximation of Randomized Orthogonal Array Sampling Designs K. Laipaporn Department of Mathematics School of Science, Walailak University Nakhon Si Thammarat 8060, Thailand lkittipo@wu.ac.th K. Neammanee Department of Mathematics Faculty of Science, Chulalongkorn University Bangkok 0330, Thailand Kritsana.N@chula.ac.th Abstract This paper gave a non-uniform bound on normal approximation of randomized orthogonal array sampling designs which is proposed by Owen and Tang in 99 and 993. Our method is Stein s method. Mathematics Subject Classification: Primary 6E0, secondary 60F05 Keywords: non-uniform bound, normal approximation, computer experiment, orthogonal array sampling designs, Stein s method Introduction The problem of computing a value of integral over a high dimension is important in many scientific fields. Consider a deterministic function Y = f(x) R where x [0, ] d and f is known but hard to calculate. Then our aim is to estimate [0,] d f(x)dx,
2 348 K. Laipaporn and K. Neammanee that is the expectation of f X, μ = E(f X), where X is a random vector uniformly distributed on a unit hypercube [0, ] d. The simplest way is to draw the samplings X,X,..., X n independently and uniformly distributed from [0, ] d and use ˆμ = n n f X i (.) i= as an estimator of μ. This method is called the Monte Carlo method.(see[0],[4] and [6] for more details) Beside the uniform sampling, there are various alternative ways to sellect the points X i s for ˆμ. For examples, lattice sampling([9]), Latin hypercube sampling([],[3],[5],[8]), the orthogonal arrays([],[6]) and scrambled net([3],[4]). In 996, Loh considered some classes of the orthogonal arrays and he gave a uniform bound on normal approximation. In this work, we shall establish a non-uniform bound by using the Stein s method. The organization of this paper is as follows. In section, we give some definitions, notations and state the main result. Some useful lemmas are proved in section 3 and we show the main result in section 4. Preliminary Notes and Main Result Definition.. An orthogonal array of strength t with index λ (λ ) is an n d matrix with elements taken from the set {0,,..., } such that for any n t submatrix, each of the t possible rows appears the same number λ of times where d, n, and t are positive integers with t d and. Of course, n = λ t. A class of this arrays is denoted by OA(n, d,, t)(see [8] for more details). In 996, Loh considered the class OA(n, 3,,) when n = and constructed the sampling X,X,..., X on the unit cube [0, ] 3 as follows: Let (a) π,π,π 3 be random permutations of {0,,..., }, (b) U i,i,i 3,j be [0, ] uniform random variables where i,i,i 3 {0,,..., }, j {,, 3}, and (c) U i,i,i 3,j s and π k s be all stochastically independent. An orthogonal array-based sample of size, {X,X,..., X }, is defined to be {X(π (a i, ),π (a i, ),π 3 (a i,3 )) : i }, where, for each i,i,i 3 {0,,..., } and j {,, 3}, X ( i,i,i 3 ) = ( X (i,i,i 3 ),X (i,i,i 3 ),X 3 (i,i,i 3 ) ),
3 Normal approximation of orthogonal array 349 X j (i,i,i 3 )= i j + U i,i,i 3,j, and a i,j is the (i, j) th element of some arbitary but fixed A OA(, 3,,). So the estimator ˆμ of μ in (.) can be express in the form of ˆμ = f X(π (a i, ),π (a i, ),π 3 (a i,3 )). i= Owen([]) gave an expression for the asymptotic variance Var(ˆμ) ofˆμ. In this paper, we assume that Var(ˆμ) > 0 and define W = (ˆμ μ). (.) Var(ˆμ) Loh([8]) gave a uniform bound on the normal approximation of W and Theorem. is his result. Theorem.. Let Φ be the stantdard normal distribution function, i.e., Φ(x) = x e t dt. Suppose that E(f X) r < for some even integer r 4. π Then sup { P (W w) Φ(w) : <w< } = O( r r ) as. In 006, Laipaporn and Neammanee([]) improved the order in Theorem. to the rate O( ) under the assumption that E(f X) 6 <. In this work, we investigate a non-uniform bound. The following theorem is our main result. Theorem.. Suppose that E(f X) r < for even number r 0. Then, as, for z R, P (W z) Φ(z) max ( O( ( + z ) r r 8 r ), ( + z ) O( ) ). 6 3 Auxiliary Results In this section, we will give some lemmas which used in proving the main result in section 4. In 996, Loh defined a random function ρ π be such that ( i,i,ρ π (i,i ) ) = ( π (a i, ),π (a i, ),π 3 (a i,3 ) ) (3.) for some i {,..., } and showed that W in (.) can be rewritten again as the form W = Y ( i,i,ρ π (i,i ) ) (3.) i =0 i =0
4 350 K. Laipaporn and K. Neammanee [ where Y (i,i,i 3 )= f X(i,i,i 3 ) μ Var(ˆμ) ] μ k,l (i k,i l ), and k<l 3 3 μ j (i j ) μ(i,i,i 3 )=Ef X(i,i,i 3 ),μ j (i j )= [μ(i,i,i 3 ) μ], μ k,l (i k,i l )= i k =0 k j j= [μ(i,i,i 3 ) μ μ k (i k ) μ l (i l )]. i j =0 j k,l Let I and K be uniformly distributed random variables on {0,,..., }, (I,K) uniformly distributed on { (i, k) i, k =0,,...,,i k } and assume that they are indenpendent of all π,π,π 3 and U i,i,i 3,j s defined previously. Define W = W S S + S 3 + S 4 where S = Y ( I,i,ρ π (I,i ) ), S = Y ( K, i,ρ π (K, i ) ), i =0 i =0 S 3 = Y ( I,i,ρ π (K, i ) ), S 4 = Y ( K, i,ρ π (I,i ) ). i =0 i =0 Moreover, for each i,i and i 3 {0,,,..., }, and z 0, we also let and μ(i,i,i 3 )=EY (i,i,i 3 ) Y z (i,i,i 3 )=Y(i,i,i 3 )I ( Y (i,i,i 3 ) > +z ), Ŷ z (i,i,i 3 )=Y (i,i,i 3 )I ( Y (i,i,i 3 ) +z ), Ŷ = Ŷ z (i,i,ρ π (i,i )) i =0 i =0 Ỹ = Ŷ Ŝ,z Ŝ,z + Ŝ3,z + Ŝ4,z where Ŝ,z = Ŷ z (I,i,ρ π (I,i )), Ŝ,z = Ŷ z (K, i,ρ π (K, i )), i =0 i =0 Ŝ 3,z = Ŷ z (I,i,ρ π (K, i )), Ŝ 4,z = Ŷ z (K, i,ρ π (I,i )), i =0 i =0
5 Normal approximation of orthogonal array 35 and I is an indicator function. Loh([8]) showed that ( W, W ) is an exchangeable pair, S,S,S 3,S 4 are identically distributed and if E(f X) r < for a positive even integer r, then ESi r = O( r ) for i =,, 3, 4, (3.3) and By the fact that EY r (i,i,i 3 )=O( 3 r ), (3.4) i =0 i =0 i 3 =0 EY (i,i,i 3 )=+O( ). i =0 i =0 i 3 =0 for every positive even number r([]) we have (3.5) E( W W ) r O( r ) (3.6) i =0 i =0 i 3 =0 E Y (i,i,i 3 ) m Y z (i,i,i 3 ) n E Y (i,i,i 3 ) m+n+t i =0 i =0 i 3 =0 ( + z) t O(3 m n t ) (3.7) ( + z) t for any integers m, n and t which m 0,n,t > 0 and m + n + t is an even number. The following lemmas are used in section 4 and in what follows, C denotes a generic absolute constant whose value may be different at each appearance. Lemma 3... If E(f X) <, then EŶ O( ) as.. If E(f X) r <, then, for any even number r, E Ỹ Ŷ r O( ) r as. 3. If E(f X) r+ <, then, for any odd number r 3, E Ỹ Ŷ r O( ) r as. Proof. see [] on p.0. Lemma 3... If E(f X) <, then E ( Y (i,i,i 3 ) ) O() as. i =0 i =0 i 3 =0. If E(f X) 4 <, then E ( Y (i,i,i 3 ) )4 O( ) as. i =0 i =0 i 3 =0
6 35 K. Laipaporn and K. Neammanee Proof.. By the fact that i j =0 (see [8], p.) and (3.5), we have E ( Y (i,i,i 3 ) ) i =0 i =0 i 3 =0 =. Note that E ( where M = i,i,i 3 EY (i,i,i 3 )+ μ(i,i,i 3 ) = 0 for j =,, 3, (3.8) i,i,i 3 j,j,j 3 (j,j,j 3 ) (i,i,i 3 ) = EY (i,i,i 3 ) μ (i,i,i 3 ) i,i,i 3 i,i,i 3 O(). i =0 i =0 i 3 =0 μ(i,i,i 3 ) μ(j,j,j 3 ) Y (i,i,i 3 ) )4 = C M + C M + C 3 M 3 + C 4 M 4 + C 5 M 5 EY 4 (i,i,i 3 ), i,i,i 3 M = EY (i,i,i 3 )Y 3 (j,j,j 3 ), M 3 = M 4 = M 5 = i,i,i 3 j,j,j 3 (j,j,j 3 ) (i,i,i 3 ) i,i,i 3 j,j,j 3 (j,j,j 3 ) (i,i,i 3 ) EY (i,i,i 3 )Y (j,j,j 3 ), i,i,i 3 j,j,j 3 k,k,k 3 (j,j,j 3 ) (i,i,i 3 ) (k,k,k 3 ) (i,i,i 3 ) (k,k,k 3 ) (j,j,j 3 ) i,i,i 3 j,j,j 3 k,k,k 3 l,l,l 3 (j,j,j 3 ) (i,i,i 3 ) (k,k,k 3 ) (i,i,i 3 ) (l,l,l 3 ) (i,i,i 3 ) (l,l,l 3 ) (k,k,k 3 ) (3.9) EY (i,i,i 3 )Y (j,j,j 3 )Y (k,k,k 3 ), EY (i,i,i 3 )Y (j,j,j 3 )Y (k,k,k 3 )Y (l,l,l 3 ) and C,C,C 3,C 4,C 5 are constants. From (3.4) and (3.8), we know that
7 Normal approximation of orthogonal array 353 M = O( ), (3.0) M = μ(i,i,i 3 )EY 3 (j,j,j 3 ) i,i,i 3 j,j,j 3 (j,j,j 3 ) (i,i,i 3 ) = μ(j,j,j 3 )EY 3 (j,j,j 3 ) j,j,j 3 EY 4 (j,j,j 3 ) j,j,j 3 = O( ), (3.) M 3 = EY (i,i,i 3 )EY (j,j,j 3 ) i,i,i 3 j,j,j 3 (j,j,j 3 ) (i,i,i 3 ) ( i,i,i 3 EY (i,i,i 3 ) ) O( ), (3.) M 4 = EY (i,i,i 3 ) μ(j,j,j 3 ) μ(l,l,l 3 ) i,i,i 3 j,j,j 3 l,l,l 3 (j,j,j 3 ) (i,i,i 3 ) (l,l,l 3 ) (i,i,i 3 ) (l,l,l 3 ) (j,j,j 3 ) EY (i,i,i 3 ) μ(j,j,j 3 ) μ(i,i,i 3 ) (3.3) i,i,i 3 j,j,j 3 (j,j,j 3 ) (i,i,i 3 ) + i,i,i 3 j,j,j 3 (j,j,j 3 ) (i,i,i 3 ) i,i,i 3 EY 4 (i,i,i 3 )+ ( EY (i,i,i 3 ) μ (j,j,j 3 ) i,i,i 3 EY (i,i,i 3 ) ) O( ), (3.4) and M5 = i,i,i 3 j,j,j 3 k,k,k 3 (j,j,j 3 ) (i,i,i 3 ) (k,k,k 3 ) (i,i,i 3 ) (k,k,k 3 ) (j,j,j 3 ) l,l,l 3 (l,l,l 3 ) (i,i,i 3 ) (l,l,l 3 ) (j,j,j 3 ) (l,l,l 3 ) (k,k,k 3 ) μ(i,i,i 3 ) μ(j,j,j 3 ) μ(k,k,k 3 ) μ(l,l,l 3 )
8 354 K. Laipaporn and K. Neammanee =3 μ (i,i,i 3 ) μ(j,j,j 3 ) μ(k,k,k 3 ) i,i,i 3 j,j,j 3 k,k,k 3 (j,j,j 3 ) (i,i,i 3 ) (k,k,k 3 ) (i,i,i 3 ) (k,k,k 3 ) (j,j,j 3 ) =3 μ (i,i,i 3 ) μ(j,j,j 3 ) μ(i,i,i 3 ) i,i,i 3 j,j,j 3 (j,j,j 3 ) (i,i,i 3 ) + i,i,i 3 j,j,j 3 (j,j,j 3 ) (i,i,i 3 ) 3 ( O( ). μ (i,i,i 3 ) μ(j,j,j 3 ) μ(j,j,j 3 ) EY 4 (i,i,i 3 )+ ( EY (i,i,i 3 ) ) ) i,i,i 3 i,i,i 3 (3.5) Hence from (3.9)-(3.5), we have. Lemma 3.3. Suppose that E(f X) 4 <. Then. E ( Y z (i, j, k) ) k=0. E ( Y z (i, j, k) )4 k=0 ( + z) O( ) as. Proof.. It follows from (3.4) and (3.7) that E ( i =0 i =0 i 3 =0 Y z (i,i,i 3 ) ) = EYz (i,i,i 3 )+ i,i,i 3 ( + z) ( + z) O( ). ( + z) O( ) as. i,i,i 3 i,i,i 3 EY 4 (i,i,i 3 )+ j,j,j 3 (j,j,j 3 ) (i,i,i 3 ). By the same argument as (3.9) we see that EYz (i,i,i 3 ) i,i,i 3 EY z (i,i,i 3 )Y z (j,j,j 3 ) E ( Y z (i,i,i 3 ) )4 = C M,z + C M,z + C 3 M 3,z + C 4 M 4,z + C 5 M 5,z i =0 i =0 i 3 =0 (3.6)
9 Normal approximation of orthogonal array 355 where M,z = EYz 4 (i,i,i 3 ), i,i,i 3 M,z = M 3,z = M 4,z = i,i,i 3 j,j,j 3 (j,j,j 3 ) (i,i,i 3 ) i,i,i 3 j,j,j 3 (j,j,j 3 ) (i,i,i 3 ) EY z (i,i,i 3 )Y 3 z (j,j,j 3 ), EY z (i,i,i 3 )Y z (j,j,j 3 ), i,i,i 3 j,j,j 3 k,k,k 3 (j,j,j 3 ) (i,i,i 3 ) (k,k,k 3 ) (i,i,i 3 ) (k,k,k 3 ) (j,j,j 3 ) EYz (i,i,i 3 )Y z (j,j,j 3 )Y z (k,k,k 3 ), M 5,z = i,i,i 3 j,j,j 3 k,k,k 3 l,l,l 3 (j,j,j 3 ) (i,i,i 3 ) (k,k,k 3 ) (i,i,i 3 ) (l,l,l 3 ) (i,i,i 3 ) (k,k,k 3 ) (j,j,j 3 ) (l,l,l 3 ) (j,j,j 3 ) (l,l,l 3 ) (k,k,k 3 ) EY z (i,i,i 3 )Y z (j,j,j 3 )Y z (k,k,k 3 )Y z (l,l,l 3 ) and C,C,C 3,C 4,C 5 are some constants. From (3.7), M,z ( + z) O( 3 ), (3.7) { M,z E Y z (i,i,i 3 ) }{ E Yz 3 (j,j,j 3 ) } i,i,i 3 j,j,j 3 = ( + z) O( ), (3.8) 4 { M3,z EYz (i,i,i 3 ) } i,i,i 3 = ( + z) O( ), (3.9) 4 { M4,z EYz (i,i,i 3 ) }{ E Y z (j,j,j 3 ) }{ } E Y z (l,l,l 3 ) i,i,i 3 j,j,j 3 l,l,l 3 = ( + z) O( ), (3.0) 5 3 and M 5,z ( E Y z (i,i,i 3 ) )4 { ( + z) O( 3 4 )}4. (3.) i,i,i 3 Hence from (3.6)-(3.), we have.
10 356 K. Laipaporn and K. Neammanee Let g z be the solution of the Stein s euation g z(ω) ωg z (ω) =h(ω) Φ(z) where h(x) =I(x z). It is well known that { πe ω / Φ(ω)[ Φ(z)] if ω<z, g z (ω) = πe ω / Φ(z)[ Φ(ω)] if ω z. Moreover, ωg z (ω) is an increasing function of ω, and for all real ω,u, v, t and s, π 0 <g z (w) min( 4, ), for z 0 (3.) z g z(w), (3.3) and g z (w) g z (v) (3.4) s g z (w + s) g z (w + t) h(w + u)du I ( z max(s, t) <w<z min(s, t) ) ([5], p.9-0). t Lemma 3.4. For each z>0, let h : R R be defined by (3.5) h(w) =(wg z (w)) (3.6) If E(f X) r < for some positive even number r, then E 0 t h(ŷ + u)k(t)dudt O( ) as, ( + z) r where K(t) = )( (Ỹ Ŷ I ( 0 t 4 Ỹ Ŷ ) I ( Ỹ Ŷ t<0)). Proof. By the fact that 4( + z )e z 8 ( Φ(z)) if w z 0 h(w) 4( + z z )e z ( Φ(z)) if <w z or ω>z (3.7)
11 Normal approximation of orthogonal array 357 ([5], p.48) and Φ(z) e z for z>0 (3.8) πz ([7], p.3), we have z C( + z) if w z, h(w) C if w< z ( + z) or w>z (3.9) where C is a constant. From (3.9) and the fact that E we have E 0 t 0 t = E K(t)dudt E h(ŷ + u)k(t)dudt + E 0 t 0 t t K(t)dt E Ỹ Ŷ 3 O( ), (3.30) h(ŷ + u)k(t)i(ŷ + u<z or Ŷ + u>z)dudt h(ŷ + u)k(t)i(z Ŷ + u z)dudt C ( + z) O( )+C( + z)e 0 t K(t)I(Ŷ + u z )dudt. By Lemma 3.(,) and the fact that K(t) = 0 for t > Ŷ Ỹ, E 0 t 0 E K(t)I(Ŷ + u z )dudt t K(t)I(Ŷ + Ỹ Ŷ z )dudt E Ỹ Ŷ 3 I(Ŷ + Ỹ Ŷ z ) { E Ỹ Ŷ 3r} { r P (Ŷ + Ỹ Ŷ z r r )} O( ) { EŶ + Ỹ Ŷ z O( ). ( + z) r } r r Hence the lemma follows from this fact and (3.3). (3.3)
12 358 K. Laipaporn and K. Neammanee Lemma 3.5. Let B be the σ algebra generated by π,π,π 3 and U i,i,i 3,j s. Then. E E B { K(t)dt} O( ) as.. E ( E B { K(t)dt} ) =(+z) 6 O( ) as where E B X is the conditional expectation of X given σ algebra B. Proof.. First, we note that 3 E E B {S k } = O( ), (3.3) E E B S j S k = O( ) as (3.33) for any j, k =,, 3, 4 ([8], p.8-) and for each r, s N such that r + s is an even number, we have E S,z r ES,z = ES,z = ES 3,z = ES 4,z and E S i S j,z for i, j =,, 3, 4 where ( + z) O( ), (3.34) s s ( + z) 4 O( 4 ) (3.35) ( + z) O( ) (3.36) S,z = Y z (I,i,ρ π (I,i )), S,z = Y z (K, i,ρ π (K, i )) i =0 i =0 S 3,z = Y z (I,i,ρ π (K, i )), S 4,z = Y z (K, i,ρ π (I,i )) i =0 ([], p.-). Note from (3.35) and (3.36) that, i =0 E E B (S j,z S k ) EE B S j,z S k = E S j,z S k ( + z) O( ), (3.37) and E E B (S j,z S k,z ) E S j,z S k,z { ES j,z } { } ESk,z ( + z) 4 O( 4 ) (3.38) for any j, k =,, 3, 4. From (3.3), (3.33), (3.37) and (3.38), we have
13 Normal approximation of orthogonal array 359 E E B { K(t)dt} = E E B ( ) { (Ŝ,z + Ŝ,z Ŝ 3,z Ŝ 4,z ) } 4 4 E E B (( )Ŝ k,z ) + E E B (Ŝj,zŜk,z) = k= j<k 4 4 E E B {( )(S k S k,z ) } + k= j<k 4 4 E E B (( )Sk ) 4 + E E B S k,z S k + k= + j<k 4 k= E E B (S j S k S j,z S k S j S k,z + S j,z S k,z ) E E B (S j S j,z )(S k S k,z ) 4 E E B Sk,z k= O( ). (3.39). It follows from (3.3) and (3.34) that E ( E B { { = E E B { = ( ) K(t)dt} ) 4 ( ) 4 k=0 k i } 4 (Ŝ,z + Ŝ,z Ŝ3,z Ŝ4,z) } { E E B[ ( ) 4 Ŷ z (i, j, ρ π (i, j)) ( + Ŷ z (k, j, ρ π (k,j)) Ŷ z (i, j, ρ π (k,j)) Ŷ z (k, j, ρ π (i, j))) ]} 4 ( ) k=0 k i { E ( ) 4 [ Ŷ z (i, j, ρ π (i, j)) + Ŷ z (k, j, ρ π (k,j)) } 4 Ŷ z (i, j, ρ π (k,j)) Ŷ z (k, j, ρ π (i, j))] C ( ) { + 4 E( k=0 k i Ŷ z (i, j, ρ π (i, j))) E( } + 4 E( Ŷ z (i, j, ρ π (k,j))) E( Ŷ z (k, j, ρ π (i, j))) 8 Ŷ z (k, j, ρ π (k,j))) 8
14 360 K. Laipaporn and K. Neammanee = C + C 3( = C + C 4 EŜ 8,z = O(). Ŷ z (i, j, ρ π (i, j))) 8) + C ( E( Hence E ( E B { K(t)dt}) = E ( E B { K(t)dt} ) I ( E B ( + E ( E B { E E B { + { E ( E B { K(t)dt} ) I ( E B ( K(t)dt} 6 ( + z) 6 ( + z) 6 O( )+ E( E B { ( + z) 6 O( ). 3 3 k=0 k i Ŷ z (i, j, ρ π (k,j))) 8) E( K(t)dt) < ) 6 ( + z) 6 K(t)dt} ) 4} { P ( E B ( K(t)dt}) 4 ( 3 ( + z) 3 ) K(t)dt) ) 6 ( + z) 6 K(t)dt) )} 6 ( + z) 6 4 Proof of the main result(theorem.) To bound P (W z) Φ(z), it suffices to consider z>0 because we use the fact that Φ(z) = Φ( z) and apply the result to W when z 0. So, from now on, we assume z>0. Let γ = 4 E Ŷ Ỹ 3. We note from Lemma 3.(3) that, γ = O( ). By [] we know that sup { P (W z) Φ(z) : <z< } = O( ). Hence P (W z) Φ(z) z>. Note that ( + z) r O( ) for 0 <z. Assume that P (W z) Φ(z) P (W Ŷ )+ P(Ŷ z) Φ(z), (4.) and ( P (W Ŷ )=P ) I( Y (i, j, ρ π (i, j)) > +z)
15 Normal approximation of orthogonal array 36 ( E ) I( Y (i, j, ρ π (i, j)) > +z) = P ( Y (i, j, k) > +z) = k=0 k=0 ( + z) 4 O( ). E Y (i, j, k) 4 ( + z) 4 Thus we need to bound only the second term on the right hand side of (4.). Case ( + z)γ. By Lemma 3.() and the fact that γ, we have +z P (Ŷ >z)=p (Ŷ +> +z) E Ŷ + ( + z) C ( + z) Cγ +z. Hence P (Ŷ z) Φ(z) = P (Ŷ >z) Φ(z) = P (Ŷ > z)+( Φ(z)) +z O( ) C where we have used the fact that Φ(z) ( + z) Cγ in the last +z ineuality. Case ( + z)γ <. In view of Theorem. of [], we can show that P (Ŷ z) Φ(z) = Eg z (Ŷ ) EŶg z (Ŷ ) T + T + T 3 + T 4 (4.) where T = E {g z (Ŷ ) g z (Ŷ + t)}k(t)dt, T = Eg z (Ŷ )E K(t)dt Eg z (Ŷ ) T 3 = Eg z (Ŷ ) Eg z (Ŷ )E K(t)dt, K(t)dt, T 4 = Δg z (Ŷ ), and Δf(Ŷ )= Ef(Ŷ ) Ŷ z (i,i,i 3 ) for any function f. i =0 i =0 i 3 =0
16 36 K. Laipaporn and K. Neammanee From Lemma 3.() and Lemma 3.3() we have E( i =0 i =0 i 3 =0 And, by (3.7) and (3.8), E( i,i,i 3 = Y (i,i,i 3 )) + E( j,j,j 3 Y (i,i,i 3 )Y z (j,j,j 3 )) i =0 i =0 i 3 =0 Y z (i,i,i 3 )) O(). EY (i,i,i 3 )Y z (i,i,i 3 ) μ(i,i,i 3 )EY z (i,i,i 3 ) i,i,i 3 i,i,i 3 = O(). Hence T 4 z E z {E( = From Lemma 3.(), E g z(ŷ ) E ([], p.6), we have T 3 = Eg z (Ŷ ) E K(t)dt and T = Eg z (Ŷ )EB {E i =0 i =0 i 3 =0 i =0 i =0 i 3 =0 Ŷ z (i,i,i 3 ) Ŷ z (i,i,i 3 )) } ( + z) O( ). (4.3) C ([7], p.48) and ( + z) K(t)dt = E(Ŷ ) ΔŶ where ΔŶ O( ) K(t)dt C ( + z) E Ŷ +ΔŶ ( + z) O( ). K(t)dt} C E K(t)dt + Eg ( + z) z (Ŷ )EB{ K(t)dt } C E Ŷ + ( + z) ΔŶ + Eg z (Ŷ )I(Ŷ z )EB{ K(t)dt } = + Eg z (Ŷ )I(Ŷ < z )EB{ K(t)dt } (4.4) ( + z) O( )+T + T (4.5)
17 Normal approximation of orthogonal array 363 where and T = Eg z(ŷ )I(Ŷ z )EB{ T = Eg z(ŷ )I(Ŷ > z )EB{ K(t)dt } K(t)dt }. Note that g z(ω) =[ πωe ω / Φ(ω) + ][ Φ(z)] for ω z. Hence from this fact, Lemma 3.5(),(3.7) and the fact that e 3z 8 C, we have +z T E { π( z z z )e 8 Φ( )+}{ Φ(z) } I(Ŷ z )EB { K(t)dt} { π( z )e }{e z z } 8 + E E B { K(t)dt} z ( + z) O( ). (4.6) From Lemma 3.() and Lemma 3.5(), T EI(Ŷ >z )EB{ { P (Ŷ > z )} { E E B{ = ( + z) ( + z) Hence, by (4.5)-(4.7), we have O( )EŶ 6 K(t)dt } K(t)dt } } O( ). (4.7) 6 T ( + z) O( ). (4.8) 6 To finish the proof of Theorem., it remains to bound T. By (3.5) we have T T + T + T 3 (4.9) where T = EI( Ỹ Ŷ < +z ) I(z max(0,t) < Ŷ<z min(0,t))k(t)dt, T = EI( Ỹ Ŷ < +z 0 ) h(ŷ + u)k(t)dudt, T 3 = EI( Ỹ Ŷ +z ) t {g z(ŷ ) g z(ŷ + t)}k(t)dt
18 364 K. Laipaporn and K. Neammanee and h be defined as in Lemma 3.4. First, we consider T.Forδ>0, let f δ : R R be defined by 0 if t<z δ, f δ (t) = ( + t + δ)(t z +δ) if z δ t z +δ, 4δ( + t + δ) if t>z+δ. Note that f δ is a nondecreasing function, { f δ(t) +z δ if z δ t z +δ, 0 otherwise, (4.0) (4.) E Ŷf ey by (Ŷ ) 4E Ŷ ( + Ŷ + Ỹ Ŷ ) Ỹ Ŷ 4E Ŷ Ỹ Ŷ +4EŶ Ỹ Ŷ +4E Ŷ Ỹ Ŷ 4{EŶ } {E Ỹ Ŷ } +4{EŶ } {E Ỹ Ŷ 4 } O( )+O( ) { EŶ Ŷ r +4{E(Ŷ ) r } r r r r } r O( )+O( ) { ( ( + z)) r r EŶ } r O( ) + ( + z) r O( r 8 r (Ŷ ) and Δf Y e Y b Ef Y e Y b (Ŷ ) {E Ỹ Ŷ r } r ), (4.) i =0 i =0 i 3 =0 Ŷ z (i,i,i 3 ) 4 E( + Ŷ + Ỹ Ŷ ) Ỹ Ŷ i =0 i =0 i 3 =0 4 E( + Ŷ ) Ỹ Ŷ Y (i,i,i 3 ) i =0 i =0 i 3 =0 + 4 E( + Ŷ ) Ỹ Ŷ Y z (i,i,i 3 ) i =0 i =0 i 3 =0 + 4 E Ỹ Ŷ Y (i,i,i 3 ) i =0 i =0 i 3 =0 + 4 E Ỹ Ŷ Y z (i,i,i 3 ) i =0 i =0 i 3 =0 Ŷ z (i,i,i 3 )
19 Normal approximation of orthogonal array { E( + Ŷ ) } { E Ỹ Ŷ ( + 4 { E( + Ŷ ) } { E Ỹ Ŷ ( + 4 { E Ỹ Ŷ 4} { E( + 4 { E Ỹ Ŷ 4} { E( i =0 i =0 i 3 =0 Y (i,i,i 3 )) } i =0 i =0 i 3 =0 i =0 i =0 i 3 =0 Y z (i,i,i 3 )) } Y (i,i,i 3 )) } Y z (i,i,i 3 )) } i =0 i =0 i 3 =0 4 { E Ỹ Ŷ 4} { 4 E( Y (i,i,i 3 )) 4} 4 i =0 i =0 i 3 =0 + 4 { E Ỹ Ŷ 4} { 4 E( i =0 i =0 i 3 =0 Y z (i,i,i 3 )) 4} 4 + O( ) O( ). (4.3) Using the same argument as in Lemma.3 of [],we can show that E f δ (Ŷ + t)k(t)dt = EŶf δ (Ŷ ) Δf δ (Ŷ ). (4.4) Thus, from (4.)-(4.4), we have T = E I( Ỹ Ŷ < +z )I(z max(0,t) < Ŷ<z min(0,t))k(t)dt t ey by E I( Ỹ Ŷ < +z )I(z Ỹ Ŷ < Ŷ<z+ Ỹ Ŷ )K(t)dt t Y e Y b +z E I( Ỹ Ŷ < +z )( + z Ỹ Ŷ ) t ey by I(z Ỹ Ŷ < Ŷ<z+ Ỹ Ŷ )K(t)dt +z E f (Ŷ + t)i(z Ỹ Ŷ < Ŷ<z+ Ỹ Ŷ )K(t)dt ey by t ey by E Ŷf ) Y e Y (Ŷ (Ŷ ) b + Δf Y e Y b O( ( + z) r By Lemma 3.4, r 8 r ). (4.5) T ( + z) r O( ). (4.6)
20 366 K. Laipaporn and K. Neammanee By (3.4) and Lemma 3.() T 3 EI( Ỹ Ŷ +z ) K(t)dt EI( Ỹ Ŷ +z ) Ỹ Ŷ { P ( Ỹ Ŷ +z )} { E Ỹ Ŷ 4} C { E Ỹ Ŷ } ( + z) = ( + z) O( ). (4.7) From (4.9), (4.5)-(4.7), we have the main theorem. References [] A.B. Owen, A central limit theorem for Latin Hypercube sampling, J.R. Statist. Soc. Ser. B, 54 (99), [] A.B. Owen, Orthogonal array for computer experiments, integration and visualization, Statist. Sinica, (99), [3] A.B. Owen, Monte-Carlo variance of scrambled net uadrature, SIAM J. Numer. Anal., 34 (997), [4] A.B. Owen, Scrambled net variance for integrals of smooth functions, Ann. Statist., 5 (997), [5] A.D. Barbour and L.H.Y. Chen, An Introduction to Stein s method, Singapore University Press, 005. [6] B. Tang, Orthogonal array-based Latin hypercubes, J. Amer. Statist. Assoc., 88 (993), [7] C.M. Stein, Approximate computation of expectations, IMS, Hayward, CA., 986. [8] D. Raghavarao, Constructions and combinatorial problems in design of experiments, John Wiley, New York, 97. [9] H.D. Patterson, The errors of lattice sampling, J.R. Statist. Soc. Ser. B, 6 (954),
21 Normal approximation of orthogonal array 367 [0] H. Niederreiter, Random Number Generation and Quasi-Monte Carlo Methods, SIAM, Philadelphia, 99. [] K. Laipaporn and K. Neammanee, A non-uniform concentration in euality for randomized orthogonal array sampling designs, Thai. J. Math., 4, No. (006), [] K. Laipaporn and K. Neammanee, A uniform bound on a combinatorial central limit theorem for randomized orthogonal array sampling designs, (to appear in) Journal of stochastic analysis and application. [3] M.D. McKay, W.J. Conover and R.J. Beckman, A comparison of three methods for selecting values of input variables in the analysis of output from a computer code, Technometrics, (979), [4] M. Evans and T.Swartz, Approximating Integrals via Monte-Carlo and Deterministic Methods, Oxford Univ. Press, 000. [5] M.L. Stein, Large sample properties of simulations using Latin hypercube sampling, Ann. Statist., 9 (987), [6] P.J. Davis and P. Rabinowitz, Methods of Numerical Integration, nd ed. Academic Press, Orlando, FL., 984. [7] Q.A. Shao and L.H.Y. Chen, A non-uniform Berry-Esseen bound via Stein s method, Probab. Theory Relat. Fields, 0 (00), [8] W.L. Loh, A combinatorial central limit theorem for randomized orthogonal array sampling designs, Ann. Statist., 4 (996), Received: January 9, 007
A CENTRAL LIMIT THEOREM FOR NESTED OR SLICED LATIN HYPERCUBE DESIGNS
Statistica Sinica 26 (2016), 1117-1128 doi:http://dx.doi.org/10.5705/ss.202015.0240 A CENTRAL LIMIT THEOREM FOR NESTED OR SLICED LATIN HYPERCUBE DESIGNS Xu He and Peter Z. G. Qian Chinese Academy of Sciences
More informationA GENERAL THEORY FOR ORTHOGONAL ARRAY BASED LATIN HYPERCUBE SAMPLING
Statistica Sinica 26 (2016), 761-777 doi:http://dx.doi.org/10.5705/ss.202015.0029 A GENERAL THEORY FOR ORTHOGONAL ARRAY BASED LATIN HYPERCUBE SAMPLING Mingyao Ai, Xiangshun Kong and Kang Li Peking University
More informationStat 890 Design of computer experiments
Stat 890 Design of computer experiments Will introduce design concepts for computer experiments Will look at more elaborate constructions next day Experiment design In computer experiments, as in many
More informationarxiv: v1 [math.st] 23 Sep 2014
The Annals of Statistics 2014, Vol. 42, No. 5, 1725 1750 DOI: 10.1214/14-AOS1231 c Institute of Mathematical Statistics, 2014 arxiv:1409.6495v1 [math.st] 23 Sep 2014 A CENTRAL LIMIT THEOREM FOR GENERAL
More informationPoisson Approximation for Independent Geometric Random Variables
International Mathematical Forum, 2, 2007, no. 65, 3211-3218 Poisson Approximation for Independent Geometric Random Variables K. Teerapabolarn 1 and P. Wongasem Department of Mathematics, Faculty of Science
More information18Ï È² 7( &: ÄuANOVAp.O`û5 571 Based on this ANOVA model representation, Sobol (1993) proposed global sensitivity index, S i1...i s = D i1...i s /D, w
A^VÇÚO 1 Êò 18Ï 2013c12 Chinese Journal of Applied Probability and Statistics Vol.29 No.6 Dec. 2013 Optimal Properties of Orthogonal Arrays Based on ANOVA High-Dimensional Model Representation Chen Xueping
More informationInvertible Matrices over Idempotent Semirings
Chamchuri Journal of Mathematics Volume 1(2009) Number 2, 55 61 http://www.math.sc.chula.ac.th/cjm Invertible Matrices over Idempotent Semirings W. Mora, A. Wasanawichit and Y. Kemprasit Received 28 Sep
More informationBounds of the normal approximation to random-sum Wilcoxon statistics
R ESEARCH ARTICLE doi: 0.306/scienceasia53-874.04.40.8 ScienceAsia 40 04: 8 9 Bounds of the normal approximation to random-sum Wilcoxon statistics Mongkhon Tuntapthai Nattakarn Chaidee Department of Mathematics
More informationAnale. Seria Informatică. Vol. XIII fasc Annals. Computer Science Series. 13 th Tome 1 st Fasc. 2015
24 CONSTRUCTION OF ORTHOGONAL ARRAY-BASED LATIN HYPERCUBE DESIGNS FOR DETERMINISTIC COMPUTER EXPERIMENTS Kazeem A. Osuolale, Waheed B. Yahya, Babatunde L. Adeleke Department of Statistics, University of
More informationA Pointwise Approximation of Generalized Binomial by Poisson Distribution
Applied Mathematical Sciences, Vol. 6, 2012, no. 22, 1095-1104 A Pointwise Approximation of Generalized Binomial by Poisson Distribution K. Teerapabolarn Department of Mathematics, Faculty of Science,
More informationA 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 informationSome methods for sensitivity analysis of systems / networks
Article Some methods for sensitivity analysis of systems / networks WenJun Zhang School of Life Sciences, Sun Yat-sen University, Guangzhou 510275, China; International Academy of Ecology and Environmental
More informationMi-Hwa Ko. t=1 Z t is true. j=0
Commun. Korean Math. Soc. 21 (2006), No. 4, pp. 779 786 FUNCTIONAL CENTRAL LIMIT THEOREMS FOR MULTIVARIATE LINEAR PROCESSES GENERATED BY DEPENDENT RANDOM VECTORS Mi-Hwa Ko Abstract. Let X t be an m-dimensional
More informationCONSTRUCTION OF SLICED SPACE-FILLING DESIGNS BASED ON BALANCED SLICED ORTHOGONAL ARRAYS
Statistica Sinica 24 (2014), 1685-1702 doi:http://dx.doi.org/10.5705/ss.2013.239 CONSTRUCTION OF SLICED SPACE-FILLING DESIGNS BASED ON BALANCED SLICED ORTHOGONAL ARRAYS Mingyao Ai 1, Bochuan Jiang 1,2
More informationSupermodular ordering of Poisson arrays
Supermodular ordering of Poisson arrays Bünyamin Kızıldemir Nicolas Privault Division of Mathematical Sciences School of Physical and Mathematical Sciences Nanyang Technological University 637371 Singapore
More informationThe square root rule for adaptive importance sampling
The square root rule for adaptive importance sampling Art B. Owen Stanford University Yi Zhou January 2019 Abstract In adaptive importance sampling, and other contexts, we have unbiased and uncorrelated
More informationConstruction of Smooth Fractal Surfaces Using Hermite Fractal Interpolation Functions. P. Bouboulis, L. Dalla and M. Kostaki-Kosta
BULLETIN OF THE GREEK MATHEMATICAL SOCIETY Volume 54 27 (79 95) Construction of Smooth Fractal Surfaces Using Hermite Fractal Interpolation Functions P. Bouboulis L. Dalla and M. Kostaki-Kosta Received
More informationSELECTING LATIN HYPERCUBES USING CORRELATION CRITERIA
Statistica Sinica 8(1998), 965-977 SELECTING LATIN HYPERCUBES USING CORRELATION CRITERIA Boxin Tang University of Memphis and University of Western Ontario Abstract: Latin hypercube designs have recently
More informationWasserstein-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 informationBALANCING GAUSSIAN VECTORS. 1. Introduction
BALANCING GAUSSIAN VECTORS KEVIN P. COSTELLO Abstract. Let x 1,... x n be independent normally distributed vectors on R d. We determine the distribution function of the minimum norm of the 2 n vectors
More informationAPPROXIMATION OF GENERALIZED BINOMIAL BY POISSON DISTRIBUTION FUNCTION
International Journal of Pure and Applied Mathematics Volume 86 No. 2 2013, 403-410 ISSN: 1311-8080 (printed version); ISSN: 1314-3395 (on-line version) url: http://www.ijpam.eu doi: http://dx.doi.org/10.12732/ijpam.v86i2.14
More informationOptimal Fractional Factorial Plans for Asymmetric Factorials
Optimal Fractional Factorial Plans for Asymmetric Factorials Aloke Dey Chung-yi Suen and Ashish Das April 15, 2002 isid/ms/2002/04 Indian Statistical Institute, Delhi Centre 7, SJSS Marg, New Delhi 110
More informationOn the simplest expression of the perturbed Moore Penrose metric generalized inverse
Annals of the University of Bucharest (mathematical series) 4 (LXII) (2013), 433 446 On the simplest expression of the perturbed Moore Penrose metric generalized inverse Jianbing Cao and Yifeng Xue Communicated
More informationA NEW CLASS OF NESTED (NEARLY) ORTHOGONAL LATIN HYPERCUBE DESIGNS
Statistica Sinica 26 (2016), 1249-1267 doi:http://dx.doi.org/10.5705/ss.2014.029 A NEW CLASS OF NESTED (NEARLY) ORTHOGONAL LATIN HYPERCUBE DESIGNS Xue Yang 1,2, Jian-Feng Yang 2, Dennis K. J. Lin 3 and
More informationA Note on Poisson Approximation for Independent Geometric Random Variables
International Mathematical Forum, 4, 2009, no, 53-535 A Note on Poisson Approximation for Independent Geometric Random Variables K Teerapabolarn Department of Mathematics, Faculty of Science Burapha University,
More informationConstructions of digital nets using global function fields
ACTA ARITHMETICA 105.3 (2002) Constructions of digital nets using global function fields by Harald Niederreiter (Singapore) and Ferruh Özbudak (Ankara) 1. Introduction. The theory of (t, m, s)-nets and
More informationPRECISE ASYMPTOTIC IN THE LAW OF THE ITERATED LOGARITHM AND COMPLETE CONVERGENCE FOR U-STATISTICS
PRECISE ASYMPTOTIC IN THE LAW OF THE ITERATED LOGARITHM AND COMPLETE CONVERGENCE FOR U-STATISTICS REZA HASHEMI and MOLUD ABDOLAHI Department of Statistics, Faculty of Science, Razi University, 67149, Kermanshah,
More informationTHE 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 informationLow Discrepancy Sequences in High Dimensions: How Well Are Their Projections Distributed?
Low Discrepancy Sequences in High Dimensions: How Well Are Their Projections Distributed? Xiaoqun Wang 1,2 and Ian H. Sloan 2 1 Department of Mathematical Sciences, Tsinghua University, Beijing 100084,
More informationNormal 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 informationUsing Orthogonal Arrays in the Sensitivity Analysis of Computer Models
. Using Orthogonal Arrays in the Sensitivity Analysis of Computer Models Max D. Morris Department of Statistics, and Department of Industrial and Manufacturing Systems Engineering Iowa State University
More informationE(s 2 )-OPTIMALITY AND MINIMUM DISCREPANCY IN 2-LEVEL SUPERSATURATED DESIGNS
Statistica Sinica 12(2002), 931-939 E(s 2 )-OPTIMALITY AND MINIMUM DISCREPANCY IN 2-LEVEL SUPERSATURATED DESIGNS Min-Qian Liu and Fred J. Hickernell Tianjin University and Hong Kong Baptist University
More informationCONSTRUCTION OF NESTED (NEARLY) ORTHOGONAL DESIGNS FOR COMPUTER EXPERIMENTS
Statistica Sinica 23 (2013), 451-466 doi:http://dx.doi.org/10.5705/ss.2011.092 CONSTRUCTION OF NESTED (NEARLY) ORTHOGONAL DESIGNS FOR COMPUTER EXPERIMENTS Jun Li and Peter Z. G. Qian Opera Solutions and
More informationConstruction of column-orthogonal designs for computer experiments
SCIENCE CHINA Mathematics. ARTICLES. December 2011 Vol. 54 No. 12: 2683 2692 doi: 10.1007/s11425-011-4284-8 Construction of column-orthogonal designs for computer experiments SUN FaSheng 1,2, PANG Fang
More informationLatin Hypercube Sampling with Multidimensional Uniformity
Latin Hypercube Sampling with Multidimensional Uniformity Jared L. Deutsch and Clayton V. Deutsch Complex geostatistical models can only be realized a limited number of times due to large computational
More informationMORE NOTES FOR MATH 823, FALL 2007
MORE NOTES FOR MATH 83, FALL 007 Prop 1.1 Prop 1. Lemma 1.3 1. The Siegel upper half space 1.1. The Siegel upper half space and its Bergman kernel. The Siegel upper half space is the domain { U n+1 z C
More informationA Polynomial Chaos Approach to Robust Multiobjective Optimization
A Polynomial Chaos Approach to Robust Multiobjective Optimization Silvia Poles 1, Alberto Lovison 2 1 EnginSoft S.p.A., Optimization Consulting Via Giambellino, 7 35129 Padova, Italy s.poles@enginsoft.it
More informationMODERATE 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 informationNear-exact approximations for the likelihood ratio test statistic for testing equality of several variance-covariance matrices
Near-exact approximations for the likelihood ratio test statistic for testing euality of several variance-covariance matrices Carlos A. Coelho 1 Filipe J. Marues 1 Mathematics Department, Faculty of Sciences
More informationMonte Carlo Method for Numerical Integration based on Sobol s Sequences
Monte Carlo Method for Numerical Integration based on Sobol s Sequences Ivan Dimov and Rayna Georgieva Institute of Information and Communication Technologies, Bulgarian Academy of Sciences, 1113 Sofia,
More informationMinimizing the Number of Function Evaluations to Estimate Sobol Indices Using Quasi-Monte Carlo
Minimizing the Number of Function Evaluations to Estimate Sobol Indices Using Quasi-Monte Carlo Lluís Antoni Jiménez Rugama Joint work with: Fred J Hickernell (IIT), Clémentine Prieur (Univ Grenoble),
More informationon t0 t T, how can one compute the value E[g(X(T ))]? The Monte-Carlo method is based on the
SPRING 2008, CSC KTH - Numerical methods for SDEs, Szepessy, Tempone 203 Monte Carlo Euler for SDEs Consider the stochastic differential equation dx(t) = a(t, X(t))dt + b(t, X(t))dW (t) on t0 t T, how
More informationMOMENT 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 informationZeros of the Riemann Zeta-Function on the Critical Line
Zeros of the Riemann Zeta-Function on the Critical Line D.R. Heath-Brown Magdalen College, Oxford It was shown by Selberg [3] that the Riemann Zeta-function has at least c log zeros on the critical line
More informationOrthogonal and nearly orthogonal designs for computer experiments
Biometrika (2009), 96, 1,pp. 51 65 C 2009 Biometrika Trust Printed in Great Britain doi: 10.1093/biomet/asn057 Advance Access publication 9 January 2009 Orthogonal and nearly orthogonal designs for computer
More informationA new family of orthogonal Latin hypercube designs
isid/ms/2016/03 March 3, 2016 http://wwwisidacin/ statmath/indexphp?module=preprint A new family of orthogonal Latin hypercube designs Aloke Dey and Deepayan Sarkar Indian Statistical Institute, Delhi
More informationCONSTRUCTION OF OPTIMAL MULTI-LEVEL SUPERSATURATED DESIGNS. Hongquan Xu 1 and C. F. J. Wu 2 University of California and University of Michigan
CONSTRUCTION OF OPTIMAL MULTI-LEVEL SUPERSATURATED DESIGNS Hongquan Xu 1 and C. F. J. Wu University of California and University of Michigan A supersaturated design is a design whose run size is not large
More informationTHE SKOROKHOD OBLIQUE REFLECTION PROBLEM IN A CONVEX POLYHEDRON
GEORGIAN MATHEMATICAL JOURNAL: Vol. 3, No. 2, 1996, 153-176 THE SKOROKHOD OBLIQUE REFLECTION PROBLEM IN A CONVEX POLYHEDRON M. SHASHIASHVILI Abstract. The Skorokhod oblique reflection problem is studied
More informationOn the Error Bound in the Normal Approximation for Jack Measures (Joint work with Le Van Thanh)
On the Error Bound in the Normal Approximation for Jack Measures (Joint work with Le Van Thanh) Louis H. Y. Chen National University of Singapore International Colloquium on Stein s Method, Concentration
More informationJoshua N. Cooper Department of Mathematics, Courant Institute of Mathematics, New York University, New York, NY 10012, USA.
CONTINUED FRACTIONS WITH PARTIAL QUOTIENTS BOUNDED IN AVERAGE Joshua N. Cooper Department of Mathematics, Courant Institute of Mathematics, New York University, New York, NY 10012, USA cooper@cims.nyu.edu
More informationCHARACTERIZATIONS OF PSEUDODIFFERENTIAL OPERATORS ON THE CIRCLE
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 125, Number 5, May 1997, Pages 1407 1412 S 0002-9939(97)04016-1 CHARACTERIZATIONS OF PSEUDODIFFERENTIAL OPERATORS ON THE CIRCLE SEVERINO T. MELO
More informationIncomplete exponential sums over finite fields and their applications to new inversive pseudorandom number generators
ACTA ARITHMETICA XCIII.4 (2000 Incomplete exponential sums over finite fields and their applications to new inversive pseudorandom number generators by Harald Niederreiter and Arne Winterhof (Wien 1. Introduction.
More informationA NOTE ON THE COMPLETE MOMENT CONVERGENCE FOR ARRAYS OF B-VALUED RANDOM VARIABLES
Bull. Korean Math. Soc. 52 (205), No. 3, pp. 825 836 http://dx.doi.org/0.434/bkms.205.52.3.825 A NOTE ON THE COMPLETE MOMENT CONVERGENCE FOR ARRAYS OF B-VALUED RANDOM VARIABLES Yongfeng Wu and Mingzhu
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 informationRELATION BETWEEN SMALL FUNCTIONS WITH DIFFERENTIAL POLYNOMIALS GENERATED BY MEROMORPHIC SOLUTIONS OF HIGHER ORDER LINEAR DIFFERENTIAL EQUATIONS
Kragujevac Journal of Mathematics Volume 38(1) (2014), Pages 147 161. RELATION BETWEEN SMALL FUNCTIONS WITH DIFFERENTIAL POLYNOMIALS GENERATED BY MEROMORPHIC SOLUTIONS OF HIGHER ORDER LINEAR DIFFERENTIAL
More informationMean convergence theorems and weak laws of large numbers for weighted sums of random variables under a condition of weighted integrability
J. Math. Anal. Appl. 305 2005) 644 658 www.elsevier.com/locate/jmaa Mean convergence theorems and weak laws of large numbers for weighted sums of random variables under a condition of weighted integrability
More informationStein 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 informationTHE 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 informationHarmonic Mappings and Shear Construction. References. Introduction - Definitions
Harmonic Mappings and Shear Construction KAUS 212 Stockholm, Sweden Tri Quach Department of Mathematics and Systems Analysis Aalto University School of Science Joint work with S. Ponnusamy and A. Rasila
More informationA GENERAL CONSTRUCTION FOR SPACE-FILLING LATIN HYPERCUBES
Statistica Sinica 6 (016), 675-690 doi:http://dx.doi.org/10.5705/ss.0015.0019 A GENERAL CONSTRUCTION FOR SPACE-FILLING LATIN HYPERCUBES C. Devon Lin and L. Kang Queen s University and Illinois Institute
More informationOn Approximating a Generalized Binomial by Binomial and Poisson Distributions
International Journal of Statistics and Systems. ISSN 0973-675 Volume 3, Number (008), pp. 3 4 Research India Publications http://www.ripublication.com/ijss.htm On Approximating a Generalized inomial by
More informationf(x n ) [0,1[ s f(x) dx.
ACTA ARITHMETICA LXXX.2 (1997) Dyadic diaphony by Peter Hellekalek and Hannes Leeb (Salzburg) 1. Introduction. Diaphony (see Zinterhof [13] and Kuipers and Niederreiter [6, Exercise 5.27, p. 162]) is a
More informationORTHOGONAL DECOMPOSITION OF FINITE POPULATION STATISTICS AND ITS APPLICATIONS TO DISTRIBUTIONAL ASYMPTOTICS. and Informatics, 2 Bielefeld University
ORTHOGONAL DECOMPOSITION OF FINITE POPULATION STATISTICS AND ITS APPLICATIONS TO DISTRIBUTIONAL ASYMPTOTICS M. Bloznelis 1,3 and F. Götze 2 1 Vilnius University and Institute of Mathematics and Informatics,
More informationarxiv: v1 [math.pr] 10 Oct 2017
Yet another skew-elliptical family but of a different kind: return to Lemma 1 arxiv:1710.03494v1 [math.p] 10 Oct 017 Adelchi Azzalini Dipartimento di Scienze Statistiche Università di Padova Italia Giuliana
More informationCONSTRUCTION OF SLICED ORTHOGONAL LATIN HYPERCUBE DESIGNS
Statistica Sinica 23 (2013), 1117-1130 doi:http://dx.doi.org/10.5705/ss.2012.037 CONSTRUCTION OF SLICED ORTHOGONAL LATIN HYPERCUBE DESIGNS Jian-Feng Yang, C. Devon Lin, Peter Z. G. Qian and Dennis K. J.
More informationTHE ZERO-DISTRIBUTION AND THE ASYMPTOTIC BEHAVIOR OF A FOURIER INTEGRAL. Haseo Ki and Young One Kim
THE ZERO-DISTRIBUTION AND THE ASYMPTOTIC BEHAVIOR OF A FOURIER INTEGRAL Haseo Ki Young One Kim Abstract. The zero-distribution of the Fourier integral Q(u)eP (u)+izu du, where P is a polynomial with leading
More informationARCS IN FINITE PROJECTIVE SPACES. Basic objects and definitions
ARCS IN FINITE PROJECTIVE SPACES SIMEON BALL Abstract. These notes are an outline of a course on arcs given at the Finite Geometry Summer School, University of Sussex, June 26-30, 2017. Let K denote an
More informationEXISTENCE AND UNIQUENESS OF SOLUTIONS FOR THIRD ORDER NONLINEAR BOUNDARY VALUE PROBLEMS
Tόhoku Math. J. 44 (1992), 545-555 EXISTENCE AND UNIQUENESS OF SOLUTIONS FOR THIRD ORDER NONLINEAR BOUNDARY VALUE PROBLEMS ZHAO WEILI (Received October 31, 1991, revised March 25, 1992) Abstract. In this
More informationNotes 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 informationA Characterization of (3+1)-Free Posets
Journal of Combinatorial Theory, Series A 93, 231241 (2001) doi:10.1006jcta.2000.3075, available online at http:www.idealibrary.com on A Characterization of (3+1)-Free Posets Mark Skandera Department of
More informationPERMANENTLY WEAK AMENABILITY OF REES SEMIGROUP ALGEBRAS. Corresponding author: jabbari 1. Introduction
International Journal of Analysis and Applications Volume 16, Number 1 (2018), 117-124 URL: https://doi.org/10.28924/2291-8639 DOI: 10.28924/2291-8639-16-2018-117 PERMANENTLY WEAK AMENABILITY OF REES SEMIGROUP
More informationDyadic diaphony of digital sequences
Dyadic diaphony of digital sequences Friedrich Pillichshammer Abstract The dyadic diaphony is a quantitative measure for the irregularity of distribution of a sequence in the unit cube In this paper we
More informationValidating Sample Average Approximation Solutions with Negatively Dependent Batches
Validating Sample Average Approximation Solutions with Negatively Dependent Batches Jiajie Chen Department of Statistics, University of Wisconsin-Madison chen@stat.wisc.edu Cong Han Lim Department of Computer
More informationarxiv: v1 [cs.it] 12 Jun 2016
New Permutation Trinomials From Niho Exponents over Finite Fields with Even Characteristic arxiv:606.03768v [cs.it] 2 Jun 206 Nian Li and Tor Helleseth Abstract In this paper, a class of permutation trinomials
More informationSection 27. The Central Limit Theorem. Po-Ning Chen, Professor. Institute of Communications Engineering. National Chiao Tung University
Section 27 The Central Limit Theorem Po-Ning Chen, Professor Institute of Communications Engineering National Chiao Tung University Hsin Chu, Taiwan 3000, R.O.C. Identically distributed summands 27- Central
More informationHYPERBOLIC DERIVATIVES AND GENERALIZED SCHWARZ-PICK ESTIMATES
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 132, Number 11, Pages 339 3318 S 2-9939(4)7479-9 Article electronically published on May 12, 24 HYPERBOLIC DERIVATIVES AND GENERALIZED SCHWARZ-PICK
More informationOn 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 informationarxiv: v1 [stat.me] 10 Jul 2009
6th St.Petersburg Workshop on Simulation (2009) 1091-1096 Improvement of random LHD for high dimensions arxiv:0907.1823v1 [stat.me] 10 Jul 2009 Andrey Pepelyshev 1 Abstract Designs of experiments for multivariate
More informationThe Maximum Dimension of a Subspace of Nilpotent Matrices of Index 2
The Maximum Dimension of a Subspace of Nilpotent Matrices of Index L G Sweet Department of Mathematics and Statistics, University of Prince Edward Island Charlottetown, PEI C1A4P, Canada sweet@upeica J
More informationA regeneration proof of the central limit theorem for uniformly ergodic Markov chains
A regeneration proof of the central limit theorem for uniformly ergodic Markov chains By AJAY JASRA Department of Mathematics, Imperial College London, SW7 2AZ, London, UK and CHAO YANG Department of Mathematics,
More informationCentral Limit Theorem for Non-stationary Markov Chains
Central Limit Theorem for Non-stationary Markov Chains Magda Peligrad University of Cincinnati April 2011 (Institute) April 2011 1 / 30 Plan of talk Markov processes with Nonhomogeneous transition probabilities
More informationExtensible grids: uniform sampling on a space-filling curve
Extensible grids: uniform sampling on a space-filling curve Zhijian He Tsinghua University Art B. Owen Stanford University June 2014 Abstract We study the properties of points in [0, 1] d generated by
More informationKOLMOGOROV DISTANCE FOR MULTIVARIATE NORMAL APPROXIMATION. Yoon Tae Kim and Hyun Suk Park
Korean J. Math. 3 (015, No. 1, pp. 1 10 http://dx.doi.org/10.11568/kjm.015.3.1.1 KOLMOGOROV DISTANCE FOR MULTIVARIATE NORMAL APPROXIMATION Yoon Tae Kim and Hyun Suk Park Abstract. This paper concerns the
More informationTopologic Conjugation and Asymptotic Stability in Impulsive Semidynamical Systems
CADERNOS DE MATEMÁTICA 06, 45 60 May (2005) ARTIGO NÚMERO SMA#211 Topologic Conjugation and Asymptotic Stability in Impulsive Semidynamical Systems Everaldo de Mello Bonotto * Departamento de Matemática,
More informationInternational Journal of Pure and Applied Mathematics Volume 60 No ,
International Journal of Pure and Applied Mathematics Volume 60 No. 3 200, 259-267 ON CERTAIN CLASS OF SZÁSZ-MIRAKYAN OPERATORS IN EXPONENTIAL WEIGHT SPACES Lucyna Rempulska, Szymon Graczyk 2,2 Institute
More informationON HARMONIC FUNCTIONS ON SURFACES WITH POSITIVE GAUSS CURVATURE AND THE SCHWARZ LEMMA
ROCKY MOUNTAIN JOURNAL OF MATHEMATICS Volume 44, Number 5, 24 ON HARMONIC FUNCTIONS ON SURFACES WITH POSITIVE GAUSS CURVATURE AND THE SCHWARZ LEMMA DAVID KALAJ ABSTRACT. We prove some versions of the Schwarz
More informationSpace-Filling Designs for Computer Experiments
Chapter 5 Space-Filling Designs for Computer Experiments 5. Introduction This chapter and the next discusses how to select inputs at which to compute the output of a computer experiment to achieve specific
More informationKRUSKAL-WALLIS ONE-WAY ANALYSIS OF VARIANCE BASED ON LINEAR PLACEMENTS
Bull. Korean Math. Soc. 5 (24), No. 3, pp. 7 76 http://dx.doi.org/34/bkms.24.5.3.7 KRUSKAL-WALLIS ONE-WAY ANALYSIS OF VARIANCE BASED ON LINEAR PLACEMENTS Yicheng Hong and Sungchul Lee Abstract. The limiting
More informationarxiv: v1 [math.co] 8 Feb 2013
ormal numbers and normality measure Christoph Aistleitner arxiv:302.99v [math.co] 8 Feb 203 Abstract The normality measure has been introduced by Mauduit and Sárközy in order to describe the pseudorandomness
More informationMathematical Methods for Neurosciences. ENS - Master MVA Paris 6 - Master Maths-Bio ( )
Mathematical Methods for Neurosciences. ENS - Master MVA Paris 6 - Master Maths-Bio (2014-2015) Etienne Tanré - Olivier Faugeras INRIA - Team Tosca October 22nd, 2014 E. Tanré (INRIA - Team Tosca) Mathematical
More informationA collocation method for solving some integral equations in distributions
A collocation method for solving some integral equations in distributions Sapto W. Indratno Department of Mathematics Kansas State University, Manhattan, KS 66506-2602, USA sapto@math.ksu.edu A G Ramm
More informationRandom Variable. Pr(X = a) = Pr(s)
Random Variable Definition A random variable X on a sample space Ω is a real-valued function on Ω; that is, X : Ω R. A discrete random variable is a random variable that takes on only a finite or countably
More informationPositive definite solutions of some matrix equations
Available online at www.sciencedirect.com Linear Algebra and its Applications 49 (008) 40 44 www.elsevier.com/locate/laa Positive definite solutions of some matrix equations Aleksandar S. Cvetković, Gradimir
More informationMINIMUM MOMENT ABERRATION FOR NONREGULAR DESIGNS AND SUPERSATURATED DESIGNS
Statistica Sinica 13(2003), 691-708 MINIMUM MOMENT ABERRATION FOR NONREGULAR DESIGNS AND SUPERSATURATED DESIGNS Hongquan Xu University of California, Los Angeles Abstract: A novel combinatorial criterion,
More informationA NEW UPPER BOUND ON THE STAR DISCREPANCY OF (0,1)-SEQUENCES. Peter Kritzer 1. Abstract
INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 5(3 (2005, #A11 A NEW UPPER BOUND ON THE STAR DISCREPANCY OF (0,1-SEQUENCES Peter Kritzer 1 Department of Mathematics, University of Salzburg,
More informationA Connection Between Random Variables and Latin k-cubes
A Connection Between Random Variables and Latin k-cubes Ruben Michel Gadi Taubenfeld Andrew Berman September 28, 1993 Abstract The subject of latin squares is about 200 years old, and it abounds with many
More informationOn the construction of asymmetric orthogonal arrays
isid/ms/2015/03 March 05, 2015 http://wwwisidacin/ statmath/indexphp?module=preprint On the construction of asymmetric orthogonal arrays Tianfang Zhang and Aloke Dey Indian Statistical Institute, Delhi
More informationOn Systems of Diagonal Forms II
On Systems of Diagonal Forms II Michael P Knapp 1 Introduction In a recent paper [8], we considered the system F of homogeneous additive forms F 1 (x) = a 11 x k 1 1 + + a 1s x k 1 s F R (x) = a R1 x k
More informationA construction method for orthogonal Latin hypercube designs
Biometrika (2006), 93, 2, pp. 279 288 2006 Biometrika Trust Printed in Great Britain A construction method for orthogonal Latin hypercube designs BY DAVID M. STEINBERG Department of Statistics and Operations
More informationOn Expected Gaussian Random Determinants
On Expected Gaussian Random Determinants Moo K. Chung 1 Department of Statistics University of Wisconsin-Madison 1210 West Dayton St. Madison, WI 53706 Abstract The expectation of random determinants whose
More information