• Communications of the Korean Mathematical Society
• /
• v.23 no.1
• /
• pp.133-140
• /
• 2008

Let {${\xi}_k,\;k\;{\in}\;{\mathbb{Z}}$} be a strictly stationary associated sequence of H-valued random variables with $E{\xi}_k\;=\;0$ and $E{\parallel}{\xi}_k{\parallel}^2\;<\;{\infty}$ and {$a_k,\;k\;{\in}\;{\mathbb{Z}}$} a sequence of linear operators such that ${\sum}_{j=-{\infty}}^{\infty}\;{\parallel}a_j{\parallel}_{L(H)}\;<\;{\infty}$. For a linear process $X_k\;=\;{\sum}_{j=-{\infty}}^{\infty}\;a_j{\xi}_{k-j}$ we derive that {$X_k} fulfills the functional central limit theorem.

• Journal of the Korean Mathematical Society
• /
• v.41 no.5
• /
• pp.883-894
• /
• 2004

We discuss in this paper the strong convergence for weighted sums of negative associated (in abbreviation: NA) arrays. Meanwhile, the central limit theorem for weighted sums of NA variables and linear process based on NA variables is also considered. As corollary, we get the results on iid of Li et al. ([10]) in NA setting.

• Communications for Statistical Applications and Methods
• /
• v.13 no.2
• /
• pp.429-440
• /
• 2006

In statistical computing, it is often for researchers to need the distribution of a weighted sum of noncentral chi-square variables. In this case, it is very limited to know its exact distribution. There are many works to contribute to this topic, e.g. Imhof (1961) and Solomon-Stephens (1977). Imhof's method gives good approximation to the true distribution, but it is not easy to apply even though we consider the development of computer technology Solomon-Stephens's three moment chi-square approximation is relatively easy and accurate to apply. However, they skipped many details, and their simulation is limited to a weighed sum of central chi-square random variables. This paper gives details on Solomon-Stephens's method. We also extend their simulation to the weighted sum of non-central chi-square distribution. We evaluated approximated powers for homogeneous test and compared them with the true powers. Solomon-Stephens's method shows very good approximation for the case.

• Bulletin of the Korean Mathematical Society
• /
• v.47 no.3
• /
• pp.467-482
• /
• 2010

For a double array of random elements {$V_{mn};m{\geq}1,\;n{\geq}1$} in a real separable Banach space, some mean convergence theorems and weak laws of large numbers are established. For the mean convergence results, conditions are provided under which $k_{mn}^{-\frac{1}{r}}\sum{{u_m}\atop{i=1}}\sum{{u_n}\atop{i=1}}(V_{ij}-E(V_{ij}|F_{ij})){\rightarrow}0$ in $L_r$ (0 < r < 2). The weak law results provide conditions for $k_{mn}^{-\frac{1}{r}}\sum{{T_m}\atop{i=1}}\sum{{\tau}_n\atop{j=1}}(V_{ij}-E(V_{ij}|F_{ij})){\rightarrow}0$ in probability where {$T_m;m\;{\geq}1$} and {${\tau}_n;n\;{\geq}1$} are sequences of positive integer-valued random variables, {$k_{mn};m{{\geq}}1,\;n{\geq}1$} is an array of positive integers. The sharpness of the results is illustrated by examples.

• Journal of applied mathematics & informatics
• /
• v.28 no.3_4
• /
• pp.1025-1034
• /
• 2010

Let {$X_n$, $n\;{\in}\;\mathbb{Z}_+^d$} be a field of identically distributed and negatively associated random variables with mean zero and set $S_n\;=\;{\sum}_{k{\leq}n}\;X_k$, $n\;{\in}\;\mathbb{Z}_+^d$, $d\;{\geq}\;2$. We investigate precise asymptotics for ${\sum}_n|n|^{r/p-2}P(|S_n|\;{\geq}\;{\epsilon}|n|^{1/p}$ and ${\sum}_n\;\frac{(\log\;|n|)^{\delta}}{|n|}P(|S_n|\;{\geq}\;{\epsilon}\;\sqrt{|n|\log|n|)}$, ($0\;{\leq}\;{\delta}\;{\leq}\;1$) as ${\epsilon}{\searrow}0$.

• Communications for Statistical Applications and Methods
• /
• v.16 no.3
• /
• pp.549-556
• /
• 2009

Let $\{(X_{ni}|1{\leq}i{\leq}n,\;n{\geq}1)\}$ be an array of rowwise negatively associated random variables. In this paper we discuss $n^{{\alpha}p-2}h(n)max_{1{\leq}k{\leq}n}|{\sum}_{i=1}^kX_{ni}|/n^{\alpha}{\rightarrow}0$ completely as $n{\rightarrow}{\infty}$ under not necessarily identically distributed with suitable conditions for ${\alpha}$>1/2, 0${\alpha}p{\geq}1$ and a slowly varying function h(x)>0 as $x{\rightarrow}{\infty}$. In addition, we obtain the complete convergence of moving average process based on negative association random variables which extends the result of Zhang (1996).

• Journal of the Korean Statistical Society
• /
• v.21 no.2
• /
• pp.167-177
• /
• 1992

In this paper, we investigate the limiting distribution of $M_n = max (X_1, X-2, \cdots, X_n)$ in the infinite moving average process ${X_t = \sum c_i Z_{t-i}}$ generated from i.i.d. negative binomial variables $Z_i$'s. While no limit result is possible, nonetheless asymptotic bounds are derived. We also present the tail behavior of $X_t$, i.e., weighted sum of i.i.d. random variables. This continues a study made by Rootzen (1986) for discrete innovation sequences.

• Journal of applied mathematics & informatics
• /
• v.27 no.3_4
• /
• pp.829-842
• /
• 2009

Let {$X_{ni}|1\;{\le}\;i\;{\le}\;n$, $n\;{\ge}\;1$} be an array of rowwise negatively associated random variables and let $\alpha$ > 1/2, 0 < p < 2 ${\alpha}p\;{\ge}\;1$. In this paper we discuss $n^{{\alpha}p-2}h(n)$ max $_{1\;{\le}\;k{\le}n}\;|\;{\sum}^k_{i=1}\;X_{ni}|/n^{\alpha}\;{\to}\;0$ completely as $n\;{\to}\;{\infty}$ under not necessarily identically distributed with a suitable conditions and h(x) > 0 is a slowly varying function as $x\;{\to}\;{\infty}$. In addition, we obtained that $n^{{\alpha}p-2}h(n)$ max $_{1\;{\le}\;k{\le}n}\;|\;{\sum}^k_{i=1}\;X_{ni}|/n^{\alpha}\;{\to}\;0$ completely as $n\;{\to}\;{\infty}$ if and only if $E|X_{11}|^ph(|X_{11}|^{1/\alpha})\;<\;{\infty}$ and $EX_{11}\;=\;0$ under identically distributed case and some corollaries are obtained.

• International Journal of Aeronautical and Space Sciences
• /
• v.5 no.2
• /
• pp.1-8
• /
• 2004

Real-Time Kinematic GPS positioning is widely used for many applications.Resolving ambiguities is the key to precise positioning. Integer ambiguity resolution isthe process of resolving the unknown cycle ambiguities of double difference carrierphase data as integers. Two important issues of resolving are efficiency andreliability. In the conventional search techniques, we generally used chi-squarerandom variables for decision variables. Mathematically, a chi-square random variableis the sum of mutually independent, squared zero-mean unit-variance normal(Gaussian) random variables. With this base knowledge, we can separate decisionvariables to several normal random variables. We showed it with related equationsand conceptual diagrams. With this separation, we can improve the computationalefficiency of the process without losing the needed performance. If we averageseparated normal random variables sequentially, averaged values are also normalrandom variables. So we can use them as decision variables, which prevent from asudden increase of some decision variable. With the method using averaged decisionvalues, we can get the solution more quicklv and more reliably.To verify the performance of our proposed algorithm, we conducted simulations.We used some visual diagrams that are useful for intuitional approach. We analyzedthe performance of the proposed algorithm and compared it to the conventionalmethods.

• The Journal of the Korea Contents Association
• /
• v.6 no.4
• /
• pp.63-68
• /
• 2006

For the almost co티am convergent series $S_n$ of independent random variables, by investigating the limiting behavior of the tail series, $T_n=S-S_{n-1}=\sum_{i=n}^{\infty}X_i$, the rate of convergence of the series $S_n$ to a random variable S is studied in this paper. More specifically, the equivalence between the tail series weak law of large numbers and a limit law is established for a quasi-monotone decreasing sequence, thereby extending a result of Previous work to the wider class of the norming constants.