• Communications for Statistical Applications and Methods
• /
• v.9 no.1
• /
• pp.129-139
• /
• 2002

Default Bayesian method for detecting the changes in sequences of independent exponential random variates and independent Poisson random variates is considered. Noninformative priors are assumed for all the parameters in both of change models. Default Bayes factors, AIBF, MIBF, FBF, to check whether there is any change or not on each sequence and the posterior probability densities of change at each time point are derived. Theoretical results discussed in this paper are applied to some numerical data.

• Journal of the Chungcheong Mathematical Society
• /
• v.26 no.3
• /
• pp.501-516
• /
• 2013

The well-known Vlasov-Poisson equation describes plasma physics as nonlinear first-order partial differential equations. Because of the nonlinear condition from the self consistency of the Vlasov-Poisson equation, many problems occur: the existence, the numerical solution, the convergence of the numerical solution, and so on. To solve the problems, a viscosity term (a second-order partial differential equation) is added. In a viscosity term, the Vlasov-Poisson equation changes into a parabolic equation like the Fokker-Planck equation. Therefore, the Schauder fixed point theorem and the classical results on parabolic equations can be used for analyzing the Vlasov-Poisson equation. The sequence and the convergence results are obtained from linearizing the Vlasove-Poisson equation by using a fixed point theorem and Gronwall's inequality. In numerical experiments, an implicit first-order scheme is used. The numerical results are tested using the changed viscosity terms.

• Journal of the Korean Data and Information Science Society
• /
• v.14 no.2
• /
• pp.385-391
• /
• 2003

A sequence of n Bernoulli trials which violates the constant success probability assumption is termed as "Poisson trials". In this paper, the recurrence formula for the r-th central moment of number of successes with n Poisson trials is derived. Romanovsky's method, based on the differentiation of characteristic function, is used in the derivation of recurrence formula for the central moments of conventional binomial distribution. Romanovsky's method is applied to that of Poisson trials in this paper. Some central moment calculation results are given to compare the central moments of Poisson trials with those of conventional binomial distribution.

• The KIPS Transactions:PartC
• /
• v.10C no.7
• /
• pp.899-914
• /
• 2003

It is generally accepted that self-similar (or fractal) processes may provide better models for teletraffic in modern telecommunication networks than Poisson Processes. If this is not taken into account, it can lead to inaccurate conclusions about performance of telecommunication networks. Thus, an important requirement for conducting simulation studies of telecommunication networks is the ability to generate long synthetic stochastic self-similar sequences. Three generators of pseudo-random self-similar sequences, based on the FFT〔20〕, RMD〔12〕 and SRA methods〔5, 10〕, are compared and analysed in this paper. Properties of these generators were experimentally studied in the sense of their statistical accuracy and times required to produce sequences of a given (long) length. While all three generators show similar levels of accuracy of the output data (in the sense of relative accuracy of the Horst parameter), the RMD- and SRA-based generators appear to be much faster than the generator based on FFT. Our results also show that a robust method for comparative studies of self-similarity in pseudo-random sequences is needed.

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

We consider the problem of testing for change and estimating the unknown change-point in a sequence of time-ordered observations from the binomial and Poisson distributions. Including the likelihood ratio test, Gombay and Horvath (1990) tests are studied and the proposed change-point estimator is derived from their test statistic. A power study of tests and a comparison study of change-point estimators are done via simulation.

• The KIPS Transactions:PartC
• /
• v.12C no.2 s.98
• /
• pp.281-288
• /
• 2005

It is generally accepted that self-similar (or fractal) Processes may provide better models for teletraffic in modem computer networks than Poisson processes. f this is not taken into account, it can lead to inaccurate conclusions about performance of computer networks. Thus, an important requirement for conducting simulation studies of telecommunication networks is the ability to generate long synthetic stochastic self-similar sequences. A generator of pseudo-random self similar sequences, based on the SRA (successive random addition) method, is implemented and analysed in this paper. Properties of this generator were experimentally studied in the sense of its statistical accuracy and the time required to produce sequences of a given (long) length. This generator shows acceptable level of accuracy of the output data (in the sense of relative accuracy of the Hurst parameter) and is fast. The theoretical algorithmic complexity is O(n).

• Journal of the Korean Statistical Society
• /
• v.23 no.2
• /
• pp.367-378
• /
• 1994

Let P and Q be probability measures of a measurable space $(\Omega, F)$, and ${F_n}_{n \geq 1}$ be a sequence of increasing sub $\sigma$-fields which generates F. For each $n \geq 1$, let $P_n$ and $Q_n$ be the restrictions of P and Q to $F_n$, respectively. Under the assumption that $Q_n \ll P_n$ for every $n \geq 1$, a zero-one condition is derived for P and Q to have the dichotomy, i.e., either $Q \ll P$ or $Q \perp P$. Then using this condition and the Kolmogorov's zero-one law, we give new and simple proofs of the dichotomy theorems for a pair of Gaussian measures and Poisson processes with examples.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.2 no.1
• /
• pp.27-39
• /
• 1998

We describe a fast numerical method for non-separable elliptic equations in self-adjoin form on irregular adaptive domains. One of the most successful results in numerical PDE is developing rapid elliptic solvers for separable EPDEs, for example, Fourier transformation methods for Poisson problem on a square, however, it is known that there is no rapid elliptic solvers capable of solving a general nonseparable problems. It is the purpose of this paper to present an iterative solver for linear EPDEs in self-adjoint form. The scheme discussed in this paper solves a given non-separable equation using a sequence of solutions of Poisson equations, therefore, the most important key for such a method is having a good Poison solver. High performance is achieved by using a fast high-order adaptive Poisson solver which requires only about 500 floating point operations per gridpoint in order to obtain machine precision for both the computed solution and its partial derivatives. A few numerical examples have been presented.

• The KIPS Transactions:PartC
• /
• v.11C no.5
• /
• pp.621-632
• /
• 2004

Recent measurement studies of real teletraffic data in modern telecommunication networks have shown that self-similar (or fractal) processes may provide better models of teletraffic in modern telecommunication networks than Poisson processes. If this is not taken into account, it can lead to inaccurate conclusions about performance of telecommunication networks. Thus, an important requirement for conducting simulation studies of telecommunication networks is the ability to generate long synthetic stochastic self-similar sequences. A new generator of pseu-do-random self-similar sequences, based on the fractional Gaussian nois and a wavelet transform, is proposed and analysed in this paper. Specifically, this generator uses Daubechies wavelets. The motivation behind this selection of wavelets is that Daubechies wavelets lead to more accurate results by better matching the self-similar structure of long range dependent processes, than other types of wavelets. The statistical accuracy and time required to produce sequences of a given (long) length are experimentally studied. This generator shows a high level of accuracy of the output data (in the sense of the Hurst parameter) and is fast. Its theoretical algorithmic complexity is 0(n).

• Journal of the Korean Statistical Society
• /
• v.36 no.2
• /
• pp.237-256
• /
• 2007

This paper studies the problem of option pricing in an incomplete market. The market incompleteness comes from the discontinuity of the underlying asset price process which is, in particular, assumed to be a compound Poisson process. To find a reasonable price for a European contingent claim, we first find the unique minimal martingale measure and get a price by taking an expectation of the payoff under this measure. To get a closed-form price, we use an asymptotic expansion. In case where the minimal martingale measure is a signed measure, we use a sequence of martingale measures (probability measures) that converges to the equivalent martingale measure in the limit to compute the price. Again, we get a closed form of asymptotic option price. It is the Black-Scholes price and a correction term, when the distribution of the return process has nonzero skewness up to the first order.