• 대한산업공학회지
• /
• 제33권4호
• /
• pp.402-409
• /
• 2007

Markov Chains has proven to be effective in predicting human behaviors in the areas of web site assess, multimedia educational system, and driving environment. In order to extend an application area of predicting human behaviors using Markov Chains, this study was conducted to investigate whether Markov Chains could be used to predict human behavior in selecting mobile phone menu item. Compared to the aforementioned application areas, this study has different aspects in using Markov Chains : m-order 1-step Markov Model and the concept of Power Law of Learning. The results showed that human behaviors in predicting mobile phone menu selection were well fitted into with m-order 1-step Markov Model and Power Law of Learning in allocating history path vector weights. In other words, prediction of mobile phone menu selection with Markov Chains was capable of user's actual menu selection.

• 정보관리연구
• /
• 제30권2호
• /
• pp.31-52
• /
• 1999

계량정보학 연구영역의 하나인 운영연구(Operation Research ; OR)중 미래예측이라는 목적을 가지고 있는 마코프모형(Markov Chains)의 통계기법을 활용한 두가지 실험사례를 살펴보고, 최근의 연구경향을 분석함으로써 도서관 시스템 운영과 설계에 마코프모형을 응용할 수 있는 네가지 방안을 제시하였다. 계량정보학의 한 분야로 적용되고 있는 마코프모형에 관한 국내연구가 활발하지 못한 상태이므로, 국내 계량정보학에서의 마코프모형 연구의 필요성과 활성화를 제안하였다.

• Communications for Statistical Applications and Methods
• /
• 제21권6호
• /
• pp.513-520
• /
• 2014

We study numerical methods to obtain the stationary probabilities of continuous-time Markov chains whose embedded chains are periodic. The power method is applied to the balance equations of the periodic embedded Markov chains. The power method can have the convergence speed of exponential rate that is ambiguous in its application to original continuous-time Markov chains since the embedded chains are discrete-time processes. An illustrative example is presented to investigate the numerical iteration of this paper. A numerical study shows that a rapid and stable solution for stationary probabilities can be achieved regardless of periodicity and initial conditions.

• Journal of applied mathematics & informatics
• /
• 제30권1_2호
• /
• pp.83-92
• /
• 2012

In this paper, a generalized Shannon-McMillan theorem for the nonhomogeneous Markov chains indexed by an infinite tree which has a uniformly bounded degree is discussed by constructing a nonnegative martingale and analytical methods. As corollaries, some Shannon-Mcmillan theorems for the nonhomogeneous Markov chains indexed by a homogeneous tree and the nonhomogeneous Markov chain are obtained. Some results which have been obtained are extended.

• 국제학술발표논문집
• /
• The 9th International Conference on Construction Engineering and Project Management
• /
• pp.1043-1050
• /
• 2022

Markov chains and Monte Carlo Simulation were applied to account for the probabilistic nature of pavement deterioration over time using data collected in the field. The primary purpose of this study was to evaluate pavement network performance of Western Australia (WA) by applying the existing pavement management tools relevant to WA road construction networks. Two approaches were used to analyze the pavement networks: evaluating current pavement performance data to assess WA State Road networks and predicting the future states using past and current pavement data. The Markov chains process and Monte Carlo Simulation methods were used to predicting future conditions. The results indicated that Markov chains and Monte Carlo Simulation prediction models perform well compared to pavement performance data from the last four decades. The results also revealed the impact of design, traffic demand, and climate and construction standards on urban pavement performance. This study recommends an appropriate and effective pavement engineering management system for proper pavement design and analysis, preliminary planning, future pavement maintenance and rehabilitation, service life, and sustainable pavement construction functionality.

• 한국국방경영분석학회지
• /
• 제11권1호
• /
• pp.111-129
• /
• 1985

Markov chains with large transition probability matrices occur in many applications such as manpowr models. Under certain conditions the state space of a stationary discrete parameter finite Markov chain may be partitioned into subsets, each of which may be treated as a single state of a smaller chain that retains the Markov property. Such a chain is said to be 'lumpable' and the resulting lumped chain is a special case of more general functions of Markov chains. There are several reasons why one might wish to lump. First, there may be analytical benefits, including relative simplicity of the reduced model and development of a new model which inherits known or assumed strong properties of the original model (the Markov property). Second, there may be statistical benefits, such as increased robustness of the smaller chain as well as improved estimates of transition probabilities. Finally, the identification of lumps may provide new insights about the process under investigation.

• 대한수학회지
• /
• 제60권3호
• /
• pp.537-564
• /
• 2023

In this paper, we are mainly concerned with two-sided estimates for transition probabilities of symmetric Markov chains on ℤ^d, whose one-step transition probability is comparable to |x - y|^-dϕ_j (|x - y|)^-1 with ϕ_j being a positive regularly varying function on [1, ∞) with index α ∈ [2, ∞). For upper bounds, we directly apply the comparison idea and the Davies method, which considerably improves the existing arguments in the literature; while for lower bounds the relation with the corresponding continuous time symmetric Markov chains are fully used. In particular, our results answer one open question mentioned in the paper by Murugan and Saloff-Coste (2015).

• 대한수학회보
• /
• 제54권1호
• /
• pp.17-28
• /
• 2017

In this paper, we deal with a class of mean-field backward stochastic differential equations (BSDEs) related to finite state, continuous time Markov chains. We obtain the existence and uniqueness theorem and a comparison theorem for solutions of one-dimensional mean-field BSDEs under Lipschitz condition.

• 응용통계연구
• /
• 제30권1호
• /
• pp.147-157
• /
• 2017

패널 마코프 체인의 구조를 소개하고 우도함수를 도출하여 전이확률을 추정하였다. 패널 마코프 체인의 전이확률의 동질성 검정통계량으로 LR 통계량을 제안하고 그 극한분포를 제시하였다. 동질성 검정통계량의 극한분포를 패널의 수를 달리하여 모의실험하였으며 패널의 수가 50개 이상인 경우 동질성 검정통계량의 분포가 카이제곱분포를 따르는 것을 확인하였다. 정상적인 경우 검정통계량이 우수한 검정력을 가지는 것을 보였고, 확률보행과정과 같이 비정상적인 경우 검정통계량이 전이확률의 비동질성을 잘 반영하는 것을 확인하였다.

• Journal of applied mathematics & informatics
• /
• 제30권3_4호
• /
• pp.541-553
• /
• 2012

In this paper, we study some limit properties of the harmonic mean of random transition probability for a second-order nonhomogeneous Markov chain on the generalized gambling system indexed by a tree by constructing a nonnegative martingale. As corollary, we obtain the property of the harmonic mean and the arithmetic mean of random transition probability for a second-order nonhomogeneous Markov chain indexed by a double root tree.