• Title/Summary/Keyword: Markov 확률과정

Search Result 96, Processing Time 0.024 seconds

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.

Markov Modeling of Multiclass Loss Systems (멀티클래스 손실시스템의 마코프 모델링)

  • Na, Seong-Ryong
    • The Korean Journal of Applied Statistics
    • /
    • v.23 no.4
    • /
    • pp.747-757
    • /
    • 2010
  • This paper studies the Markov modeling of multiclass loss systems supporting several kinds of customers. The concept of unit for loss systems is introduced and the method of equal probability allocation among units is especially considered. Equilibrium equations and limiting distribution of the loss systems are studied and loss probabilities are computed. We analyze an example of a simple system to gain an insight about general systems.

A Study on the Fatigue Reliability of Structures by Markov Chain Model (Markov Chain Model을 이용한 구조물의 피로 신뢰성 해석에 관한 연구)

  • Y.S. Yang;J.H. Yoon
    • Journal of the Society of Naval Architects of Korea
    • /
    • v.28 no.2
    • /
    • pp.228-240
    • /
    • 1991
  • Many experimental data of fatigue crack propagation show that the fatigue crack propagation process is stochastic. Therefore, the study on the crack propagation must be based on the probabilistic approach. In the present paper, fatigue crack propagation process is assumed to be a discrete Markov process and the method is developed, which can evaluate the reliability of the structural component by using Markov chain model(Unit step B-model) suggested by Bogdanoff. In this method, leak failure, plastic collapse and brittle fracture of the critical component are taken as failure modes, and the effects of initial crack distribution, periodic and non-periodic inspection on the probability of failure are considered. In this method, an equivalent load value for random loading such as wave load is used to facilitate the analysis. Finally some calculations are carried out in order to show the usefulness and the applicability of this method. And then some remarks on this method are mentioned.

  • PDF

A study on the accuracy of a numerical iteration for Markov processes by using reliability models (신뢰도 모형을 이용한 마코프 과정의 수치적 반복법의 정확성에 대한 연구)

  • Hyeonah Park;Seongryong Na
    • The Korean Journal of Applied Statistics
    • /
    • v.37 no.4
    • /
    • pp.445-453
    • /
    • 2024
  • For Markov processes whose stationary probabilities are difficult to obtain in the analytical form, approximate solutions can be considered using numerical methods such as a matrix operation method or an iterative calculation method. In this paper we perform the study to verify the accuracy of a numerical iteration formula which calculate the stationary probabilities of Markov chains or processes. Especially, the convergence and accuracy of the numerical method are investigated by using Markov models for system availability. We compare the values of the system availability based on the numerical calculation and those based on the complicated but analytical solutions. We also calculate the iteration numbers necessary for the convergence of the numerical solutions. The accuracy and usefulness of the numerical iterative calculation method can be ascertained through this study.

Asymmetric Information and Bargaining Delays (비대칭적 정보와 협상지연)

  • Choi, Chang-Kon
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.14 no.4
    • /
    • pp.1683-1689
    • /
    • 2013
  • Applying Markov Stochastic Process theory, this paper attempts to suggest a tentative model explaining how private information may cause bargaining delay. It is shown that the bargaining delay is critically dependent on the specification of information. It turns out that the delay tends to be longer in bargaining where information is imperfect. This means that bargaining models frequently can have an infinite delay under imperfect information while they have finite delay of bargaining before reaching the agreements if information is perfect. Other interesting result is that bargaining delay may depend on who makes the offer first. And it is also shown that bargaining tends to end earlier if both players (seller and buyer) can make offers in turn than the case where only one side make a offer.

Generation of Test Case in Interactive System using Markov Chain (마코프 연쇄를 이용한 대화형 시스템의 시험 사례 생성)

  • 이상준;김병기
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 1998.10c
    • /
    • pp.246-248
    • /
    • 1998
  • 본 논문에서는 대화형 시스템을 시험하기 위한 시험 사례를 마코프 연쇄의 통계적 확률 과정으로 생성하는 방안을 제시한다. 객체지향 방법론의 통합안인 UML에서는 클래스도(Class Diagram)가 표현할 수 없었던 시스템의 동적인 관점을 상태 전이도(State Transition Diagram)는 구체적으로 표현할 수 있다. 시스템의 사용법을 상태 전이도로 표현하고, 상태간의 전이 확률(Transition Probability)을 계산하여 사용법 연쇄(Usage Chain)를 구성한다. 사용법 연쇄는 다음 상태가 과거의 상태에 영향을 받지 않고 현시점의 상태에만 의존하는 이산 시간형 확률과정인 마코프 연쇄(Markov Chain)가 된다. 본 논문에서는 사용법 연쇄를 분석하여 상태 전이도의 상태와 원호가 어떤 범위에서 시험될 것인지 결정되었을 때, 사용법 연쇄의 전이 확률이 높은 순서별로 연결하여 시험 사례를 생성하는 방안을 제시하고, 예제를 설명한다.

  • PDF

Test of homogeneity for transition probabilities in panel Markov chains (패널 마코프 체인의 전이확률에 대한 동질성 검정)

  • Lee, Sung Duck;Jo, Na Rae
    • The Korean Journal of Applied Statistics
    • /
    • v.30 no.1
    • /
    • pp.147-157
    • /
    • 2017
  • The test of transition probabilities in panel Markov chains are introduced. We deal with the hypotheses whether panel Markov chains have the same transition probabilities or not for all times. We suggest a LR test statistic for the test and its limit distribution is derived. We perform a simulation study to examine the limit distribution of test statistics when the number of the individuals are large.

A Simulation Model for the Intermittent Hydrologic Process (II) - Markov Chain and Continuous Probability Distribution - (간헐(間歇) 수문과정(水文過程)의 모의발생(模擬發生) 모형(模型)(II) - Markov 연쇄와 연속확률분포(連續確率分布) -)

  • Lee, Jae Joon;Lee, Jung Sik
    • KSCE Journal of Civil and Environmental Engineering Research
    • /
    • v.14 no.3
    • /
    • pp.523-534
    • /
    • 1994
  • The purpose of this study is to develop computer simulation model that produce precipitation patterns from stochastic model. In the paper(I) of this study, the alternate renewal process(ARP) is used for the daily precipitation series. In this paper(Il), stochastic simulation models for the daily precipitation series are developed by combining Markov chain for the precipitation occurrence process and continuous probability distribution for the precipitation amounts on the wet days. The precipitation occurrence is determined by first order Markov chain with two states(dry and wet). The amounts of precipitation, given that precipitation has occurred, are described by a Gamma, Pearson Type-III, Extremal Type-III, and 3 parameter Weibull distribution. Since the daily precipitation series shows seasonal variation, models are identified for each month of the year separately. To illustrate the application of the simulation models, daily precipitation data were taken from records at the seven locations of the Nakdong and Seomjin river basin. Simulated data were similar to actual data in terms of distribution for wet and dry spells, seasonal variability, and precipitation amounts.

  • PDF

Analysis of the Korean Baseball League using a Markov Chain Model (마르코프 연쇄를 이용한 한국 프로야구 경기 분석)

  • Moon, Hyung Woo;Woo, Yong Tae;Shin, Yang Woo
    • The Korean Journal of Applied Statistics
    • /
    • v.26 no.4
    • /
    • pp.649-659
    • /
    • 2013
  • We use a Markov chain model to analyze the Korean Baseball League. We derive the distributions of the number of runs scored and the number of batters that complete their turn at bat in a baseball game using the time inhomogeneous Markov chain. The model is tested with real data produced from the 2011 Korean Baseball League.

A Study on Markov Chains Applied to informetrics (마코프모형의 계량정보학적 응용연구)

  • Moon, Kyung-Hwa
    • Journal of Information Management
    • /
    • v.30 no.2
    • /
    • pp.31-52
    • /
    • 1999
  • This paper is done by studying two experimental cases which utilize the stochastic theory of Markov Chains, which is used for forecasting the future and by analyzing recent trend of studies. Since the study of Markov Chains is not applied to the Informetrics to a high degree in Korea. It is also proposed that there is a necessity for further study on Markov Chains and its activation.

  • PDF