• Title/Summary/Keyword: Markov chain approximation

Search Result 33, Processing Time 0.021 seconds

Valuation of American Option Prices Under the Double Exponential Jump Diffusion Model with a Markov Chain Approximation (이중 지수 점프확산 모형하에서의 마코브 체인을 이용한 아메리칸 옵션 가격 측정)

  • Han, Gyu-Sik
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.38 no.4
    • /
    • pp.249-253
    • /
    • 2012
  • This paper suggests a numerical method for valuation of American options under the Kou model (double exponential jump diffusion model). The method is based on approximation of underlying asset price using a finite-state, time-homogeneous Markov chain. We examine the effectiveness of the proposed method with simulation results, which are compared with those from the conventional numerical method, the finite difference method for PIDE (partial integro-differential equation).

Valuation of European and American Option Prices Under the Levy Processes with a Markov Chain Approximation

  • Han, Gyu-Sik
    • Management Science and Financial Engineering
    • /
    • v.19 no.2
    • /
    • pp.37-42
    • /
    • 2013
  • This paper suggests a numerical method for valuation of European and American options under the two L$\acute{e}$vy Processes, Normal Inverse Gaussian Model and the Variance Gamma model. The method is based on approximation of underlying asset price using a finite-state, time-homogeneous Markov chain. We examine the effectiveness of the proposed method with simulation results, which are compared with those from the existing numerical method, the lattice-based method.

Gaussian Approximation of Stochastic Lanchester Model for Heterogeneous Forces (혼합 군에 대한 확률적 란체스터 모형의 정규근사)

  • Park, Donghyun;Kim, Donghyun;Moon, Hyungil;Shin, Hayong
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.42 no.2
    • /
    • pp.86-95
    • /
    • 2016
  • We propose a new approach to the stochastic version of Lanchester model. Commonly used approach to stochastic Lanchester model is through the Markov-chain method. The Markov-chain approach, however, is not appropriate to high dimensional heterogeneous force case because of large computational cost. In this paper, we propose an approximation method of stochastic Lanchester model. By matching the first and the second moments, the distribution of each unit strength can be approximated with multivariate normal distribution. We evaluate an approximation of discrete Markov-chain model by measuring Kullback-Leibler divergence. We confirmed high accuracy of approximation method, and also the accuracy and low computational cost are maintained under high dimensional heterogeneous force case.

Approximating Exact Test of Mutual Independence in Multiway Contingency Tables via Stochastic Approximation Monte Carlo

  • Cheon, Soo-Young
    • The Korean Journal of Applied Statistics
    • /
    • v.25 no.5
    • /
    • pp.837-846
    • /
    • 2012
  • Monte Carlo methods have been used in exact inference for contingency tables for a long time; however, they suffer from ergodicity and the ability to achieve a desired proportion of valid tables. In this paper, we apply the stochastic approximation Monte Carlo(SAMC; Liang et al., 2007) algorithm, as an adaptive Markov chain Monte Carlo, to the exact test of mutual independence in a multiway contingency table. The performance of SAMC has been investigated on real datasets compared to with existing Markov chain Monte Carlo methods. The numerical results are in favor of the new method in terms of the quality of estimates.

A Markov Approximation-Based Approach for Network Service Chain Embedding (Markov Approximation 프레임워크 기반 네트워크 서비스 체인 임베딩 기법 연구)

  • Chuan, Pham;Nguyen, Minh N.H.;Hong, Choong Seon
    • Journal of KIISE
    • /
    • v.44 no.7
    • /
    • pp.719-725
    • /
    • 2017
  • To reduce management costs and improve performance, the European Telecommunication Standards Institute (ETSI) introduced the concept of network function virtualization (NFV), which can implement network functions (NFs) on cloud/datacenters. Within the NFV architecture, NFs can share physical resources by hosting NFs on physical nodes (commodity servers). For network service providers who support NFV architectures, an efficient resource allocation method finds utility in being able to reduce operating expenses (OPEX) and capital expenses (CAPEX). Thus, in this paper, we analyzed the network service chain embedding problem via an optimization formulation and found a close-optimal solution based on the Markov approximation framework. Our simulation results show that our approach could increases on average CPU utilization by up to 73% and link utilization up to 53%.

Average run length calculation of the EWMA control chart using the first passage time of the Markov process (Markov 과정의 최초통과시간을 이용한 지수가중 이동평균 관리도의 평균런길이의 계산)

  • Park, Changsoon
    • The Korean Journal of Applied Statistics
    • /
    • v.30 no.1
    • /
    • pp.1-12
    • /
    • 2017
  • Many stochastic processes satisfy the Markov property exactly or at least approximately. An interested property in the Markov process is the first passage time. Since the sequential analysis by Wald, the approximation of the first passage time has been studied extensively. The Statistical computing technique due to the development of high-speed computers made it possible to calculate the values of the properties close to the true ones. This article introduces an exponentially weighted moving average (EWMA) control chart as an example of the Markov process, and studied how to calculate the average run length with problematic issues that should be cautioned for correct calculation. The results derived for approximation of the first passage time in this research can be applied to any of the Markov processes. Especially the approximation of the continuous time Markov process to the discrete time Markov chain is useful for the studies of the properties of the stochastic process and makes computational approaches easy.

An approximation method for sojourn time distributions in general queueing netowkrs (일반적인 큐잉네트워크에서의 체류시간분포의 근사화)

  • 윤복식
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.19 no.3
    • /
    • pp.93-109
    • /
    • 1994
  • Even though sojourn time distributions are essential information in analyzing queueing networks, there are few methods to compute them accurately in non-product form queueing networks. In this study, we model the location process of a typical customer as a GMPH semi-Markov chain and develop computationally useful formula for the transition function and the first-passage time distribution in the GMPH semi-Markov chain. We use the formula to develop an effcient method for approximating sojourn time distributions in the non-product form queueing networks under quite general situation. We demonstrate its validity through numerical examples.

  • PDF

Bayesian and maximum likelihood estimations from exponentiated log-logistic distribution based on progressive type-II censoring under balanced loss functions

  • Chung, Younshik;Oh, Yeongju
    • Communications for Statistical Applications and Methods
    • /
    • v.28 no.5
    • /
    • pp.425-445
    • /
    • 2021
  • A generalization of the log-logistic (LL) distribution called exponentiated log-logistic (ELL) distribution on lines of exponentiated Weibull distribution is considered. In this paper, based on progressive type-II censored samples, we have derived the maximum likelihood estimators and Bayes estimators for three parameters, the survival function and hazard function of the ELL distribution. Then, under the balanced squared error loss (BSEL) and the balanced linex loss (BLEL) functions, their corresponding Bayes estimators are obtained using Lindley's approximation (see Jung and Chung, 2018; Lindley, 1980), Tierney-Kadane approximation (see Tierney and Kadane, 1986) and Markov Chain Monte Carlo methods (see Hastings, 1970; Gelfand and Smith, 1990). Here, to check the convergence of MCMC chains, the Gelman and Rubin diagnostic (see Gelman and Rubin, 1992; Brooks and Gelman, 1997) was used. On the basis of their risks, the performances of their Bayes estimators are compared with maximum likelihood estimators in the simulation studies. In this paper, research supports the conclusion that ELL distribution is an efficient distribution to modeling data in the analysis of survival data. On top of that, Bayes estimators under various loss functions are useful for many estimation problems.

Maximum penalized likelihood estimation for a stress-strength reliability model using complete and incomplete data

  • Hassan, Marwa Khalil
    • Communications for Statistical Applications and Methods
    • /
    • v.25 no.4
    • /
    • pp.355-371
    • /
    • 2018
  • The two parameter negative exponential distribution has many practical applications in queuing theory such as the service times of agents in system, the time it takes before your next telephone call, the time until a radioactive practical decays, the distance between mutations on a DNA strand, and the extreme values of annual snowfall or rainfall; consequently, has many applications in reliability systems. This paper considers an estimation problem of stress-strength model with two parameter negative parameter exponential distribution. We introduce a maximum penalized likelihood method, Bayes estimator using Lindley approximation to estimate stress-strength model and compare the proposed estimators with regular maximum likelihood estimator for complete data. We also introduce a maximum penalized likelihood method, Bayes estimator using a Markov chain Mote Carlo technique for incomplete data. A Monte Carlo simulation study is performed to compare stress-strength model estimates. Real data is used as a practical application of the proposed model.

OPTIMAL CONSUMPTION/INVESTMENT AND LIFE INSURANCE WITH REGIME-SWITCHING FINANCIAL MARKET PARAMETERS

  • LEE, SANG IL;SHIM, GYOOCHEOL
    • Journal of the Korean Society for Industrial and Applied Mathematics
    • /
    • v.19 no.4
    • /
    • pp.429-441
    • /
    • 2015
  • We study optimal consumption/investment and life insurance purchase rules for a wage earner with mortality risk under regime-switching financial market conditions, in a continuous time-horizon. We apply the Markov chain approximation method and suggest an efficient algorithm using parallel computing to solve the simultaneous Hamilton-Jaccobi-Bellman equations arising from the optimization problem. We provide numerical results under the utility functions of the constant relative risk aversion type, with which we illustrate the effects of regime switching on the optimal policies by comparing them with those in the absence of regime switching.