• Title/Summary/Keyword: Ornstein-Uhlenbeck process

Search Result 14, Processing Time 0.021 seconds

Cusum of squares test for discretely observed sample from diusion processesy

  • Lee, Sang-Yeol;Lee, Tae-Wook;Na, Ok-Young
    • Journal of the Korean Data and Information Science Society
    • /
    • v.21 no.1
    • /
    • pp.179-183
    • /
    • 2010
  • In this paper, we consider the change point problem in diusion processes based on discretely observed sample. Particularly, we consider the change point test for the dispersion parameter when the drift has unknown parameters. In performing a test, we employ the cusum of squares test based on the residuals. It is shown that the test has a limiting distribution of the sup of a Brownian bridge. A simulation result as to the Ornstein-Uhlenbeck process is provided for illustration. It demonstrates the validity of our test.

ROBUST PORTFOLIO OPTIMIZATION UNDER HYBRID CEV AND STOCHASTIC VOLATILITY

  • Cao, Jiling;Peng, Beidi;Zhang, Wenjun
    • Journal of the Korean Mathematical Society
    • /
    • v.59 no.6
    • /
    • pp.1153-1170
    • /
    • 2022
  • In this paper, we investigate the portfolio optimization problem under the SVCEV model, which is a hybrid model of constant elasticity of variance (CEV) and stochastic volatility, by taking into account of minimum-entropy robustness. The Hamilton-Jacobi-Bellman (HJB) equation is derived and the first two orders of optimal strategies are obtained by utilizing an asymptotic approximation approach. We also derive the first two orders of practical optimal strategies by knowing that the underlying Ornstein-Uhlenbeck process is not observable. Finally, we conduct numerical experiments and sensitivity analysis on the leading optimal strategy and the first correction term with respect to various values of the model parameters.

PRICING AMERICAN LOOKBACK OPTIONS UNDER A STOCHASTIC VOLATILITY MODEL

  • Donghyun Kim;Junhui Woo;Ji-Hun Yoon
    • Bulletin of the Korean Mathematical Society
    • /
    • v.60 no.2
    • /
    • pp.361-388
    • /
    • 2023
  • In this study, we deal with American lookback option prices on dividend-paying assets under a stochastic volatility (SV) model. By using the asymptotic analysis introduced by Fouque et al. [17] and the Laplace-Carson transform (LCT), we derive the explicit formula for the option prices and the free boundary values with a finite expiration whose volatility is driven by a fast mean-reverting Ornstein-Uhlenbeck process. In addition, we examine the numerical implications of the SV on the American lookback option with respect to the model parameters and verify that the obtained explicit analytical option price has been obtained accurately and efficiently in comparison with the price obtained from the Monte-Carlo simulation.

Asymptotic Analyses of a Statistical Multiplexor with Heterogeneous ATM Sources

  • Lee, Hyong-Woo;Mark, Jon-Wei
    • Journal of Electrical Engineering and information Science
    • /
    • v.2 no.3
    • /
    • pp.29-40
    • /
    • 1997
  • Two asymptotic analyses of the queue length distribution at a statistical multiplexor supporting heterogeneous exponential on-off sources are considered. The first analysis is performed by approximating the cell generation rates as a multi-dimensional Ornstein-Uhlenbeck process and then applying the Benes queueing formula. In the second analysis, w state with a system of linear equations derived from the exact expressions of the dominant eigenvalue of the matrix governing the queue length distribution. Assuming that there are a large number of sources, we obtain asymptotic approximations to the dominant eigenvalue. Based on the analyses, we define a traffic descriptor to include the mean and the variance of the cell generation rate and a burstiness measure. A simple expression for the quality of service (QoS) in cell loss rate is derived in terms of the traffic descriptor parameters and the multiplexor parameters (output link capacity and buffer size). The result is then used to quantify the factors determining the required capacity of a call taking the statistical multiplexing gain into consideration. As an application of the analyses, we can use the required capacity calculation for simple yet effective connection admission control(CAC) algorithms.

  • PDF