• Title/Summary/Keyword: markov chain

Search Result 886, Processing Time 0.026 seconds

Economic Adjustment Design For $\bar{X}$ Control Chart: A Markov Chain Approach

  • Yang, Su-Fen
    • International Journal of Quality Innovation
    • /
    • v.2 no.2
    • /
    • pp.136-144
    • /
    • 2001
  • The Markov Chain approach is used to develop an economic adjustment model of a process whose quality can be affected by a single special cause, resulting in changes of the process mean by incorrect adjustment of the process when it is operating according to its capability. The $\bar{X}$ control chart is thus used to signal the special cause. It is demonstrated that the expressions for the expected cycle time and the expected cycle cost are easier to obtain by the proposed approach than by adopting that in Collani, Saniga and Weigang (1994). Furthermore, this approach would be easily extended to derive the expected cycle cost and the expected cycle time for the case of multiple special causes or multiple control charts. A numerical example illustrates the proposed method and its application.

  • PDF

SITE-DEPENDENT IRREGULAR RANDOM WALK ON NONNEGATIVE INTEGERS

  • Konsowa, Mokhtar-H.;Okasha, Hassan-M.
    • Journal of the Korean Statistical Society
    • /
    • v.32 no.4
    • /
    • pp.401-409
    • /
    • 2003
  • We consider a particle walking on the nonnegative integers and each unit of time it makes, given it is at site k, either a jump of size m distance units to the right with probability $p_{k}$ or it goes back (falls down) to its starting point 0, a retaining barrier, with probability $v_{k}\;=\;1\;-\;p_{k}$. This is a Markov chain on the integers $mZ^{+}$. We show that if $v_{k}$ has a nonzero limit, then the Markov chain is positive recurrent. However, if $v_{k}$ speeds to 0, then we may get transient Markov chain. A critical speeding rate to zero is identified to get transience, null recurrence, and positive recurrence. Another type of random walk on $Z^{+}$ is considered in which a particle moves m distance units to the right or 1 distance unit to left with probabilities $p_{k}\;and\;q_{k}\;=\;1\;-\;p_{k}$, respectively. A necessary condition to having a stationary distribution and positive recurrence is obtained.

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.

Comparison of graph clustering methods for analyzing the mathematical subject classification codes

  • Choi, Kwangju;Lee, June-Yub;Kim, Younjin;Lee, Donghwan
    • Communications for Statistical Applications and Methods
    • /
    • v.27 no.5
    • /
    • pp.569-578
    • /
    • 2020
  • Various graph clustering methods have been introduced to identify communities in social or biological networks. This paper studies the entropy-based and the Markov chain-based methods in clustering the undirected graph. We examine the performance of two clustering methods with conventional methods based on quality measures of clustering. For the real applications, we collect the mathematical subject classification (MSC) codes of research papers from published mathematical databases and construct the weighted code-to-document matrix for applying graph clustering methods. We pursue to group MSC codes into the same cluster if the corresponding MSC codes appear in many papers simultaneously. We compare the MSC clustering results based on the several assessment measures and conclude that the Markov chain-based method is suitable for clustering the MSC codes.

Use of Markov Chain Monte Carlo in Estimating the Economy Model

  • Lee, Seung Moon
    • Journal of Integrative Natural Science
    • /
    • v.1 no.2
    • /
    • pp.127-132
    • /
    • 2008
  • This project follows the heterogeneous agent market segmented model of Landon-Lane and Occhino (2007) with using Korean data, M1 and GDP deflator from 1882:I to 2007:II. This paper estimates parameters with Monte Carlo Markov Chain. The fraction of traders, ${\lambda}$, in Korea is 15.64%. The quarterly preferences discount factor's, ${\beta}$, posterior mean is 0.9922. The posterior mean of the inverse of the elasticity of the labor supply to the real wage, ${\varphi}$, is 0.0316. The elasticity of the labor supply to the real wage has a very large value. By Hansen (1985) and Christiano and Eichenbaum (1992) and Cooley and Hansen (1989), models having large elasticity of the aggregate labor supply better match macroeconomic data.

  • PDF

Nonstationary Markov Chain Model for Multi-site Daily Rainfall Simulation (비정상성 Markov Chain Model을 이용한 다지점 일강수량 모의)

  • Moon, Jang-Won;Kwon, Hyun-Han;Moon, Young-Il
    • Proceedings of the Korea Water Resources Association Conference
    • /
    • 2010.05a
    • /
    • pp.1495-1499
    • /
    • 2010
  • 최근에 기후변화 영향 분석을 위한 강수모의발생 기법에 대한 연구가 중요한 문제로 대두되고 있다. 기본적으로 모의된 강수량이 유역단위에서 의미 있는 값으로 수문모형에 입력자료로 활용되기 위해서는 강수지점간의 공간상관성의 유지가 매우 중요하다. 즉 지역적인 수문학적 거동을 유역단위에서 평가하기 위해서는 유역상관성을 고려할 수 있는 다지점(multisite) 모형의 개발이 필수적이다. 이러한 점에서 본 연구에서는 다지점 강수모의기법을 개발하였으며 비정상성 해석이 가능하도록 동역학적 강수모형을 구성하였다. 이를 한강유역 강수지점에 적용하여 모형의 적합성을 평가하였다.

  • PDF

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.

Markov Chain Approach to Forecast in the Binomial Autoregressive Models

  • Kim, Hee-Young;Park, You-Sung
    • Communications for Statistical Applications and Methods
    • /
    • v.17 no.3
    • /
    • pp.441-450
    • /
    • 2010
  • In this paper we consider the problem of forecasting binomial time series, modelled by the binomial autoregressive model. This paper considers proposed by McKenzie (1985) and is extended to a higher order by $Wei{\ss}$(2009). Since the binomial autoregressive model is a Markov chain, we can apply the earlier work of Bu and McCabe (2008) for integer valued autoregressive(INAR) model to the binomial autoregressive model. We will discuss how to compute the h-step-ahead forecast of the conditional probabilities of $X_{T+h}$ when T periods are used in fitting. Then we obtain the maximum likelihood estimator of binomial autoregressive model and use it to derive the maximum likelihood estimator of the h-step-ahead forecast of the conditional probabilities of $X_{T+h}$. The methodology is illustrated by applying it to a data set previously analyzed by $Wei{\ss}$(2009).

Analytic Throughput Model for Network Coded TCP in Wireless Mesh Networks

  • Zhang, Sanfeng;Lan, Xiang;Li, Shuang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.9
    • /
    • pp.3110-3125
    • /
    • 2014
  • Network coding improves TCP's performance in lossy wireless networks. However, the complex congestion window evolution of network coded TCP (TCP-NC) makes the analysis of end-to-end throughput challenging. This paper analyzes the evolutionary process of TCP-NC against lossy links. An analytic model is established by applying a two-dimensional Markov chain. With maximum window size, end-to-end erasure rate and redundancy parameter as input parameters, the analytic model can reflect window evolution and calculate end-to-end throughput of TCP-NC precisely. The key point of our model is that by the novel definition of the states of Markov chain, both the number of related states and the computation complexity are substantially reduced. Our work helps to understand the factors that affect TCP-NC's performance and lay the foundation of its optimization. Extensive simulations on NS2 show that the analytic model features fairly high accuracy.

Stochastic simulation based on copula model for intermittent monthly streamflows in arid regions

  • Lee, Taesam;Jeong, Changsam;Park, Taewoong
    • Proceedings of the Korea Water Resources Association Conference
    • /
    • 2015.05a
    • /
    • pp.488-488
    • /
    • 2015
  • Intermittent streamflow is common phenomenon in arid and semi-arid regions. To manage water resources of intermittent streamflows, stochactic simulation data is essential; however the seasonally stochastic modeling for intermittent streamflow is a difficult task. In this study, using the periodic Markov chain model, we simulate intermittent monthly streamflow for occurrence and the periodic gamma autoregressive and copula models for amount. The copula models were tested in a previous study for the simulation of yearly streamflow, resulting in successful replication of the key and operational statistics of historical data; however, the copula models have never been tested on a monthly time scale. The intermittent models were applied to the Colorado River system in the present study. A few drawbacks of the PGAR model were identified, such as significant underestimation of minimum values on an aggregated yearly time scale and restrictions of the parameter boundaries. Conversely, the copula models do not present such drawbacks but show feasible reproduction of key and operational statistics. We concluded that the periodic Markov chain based the copula models is a practicable method to simulate intermittent monthly streamflow time series.

  • PDF