• Journal of Korean Institute of Industrial Engineers
• /
• v.33 no.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.

• 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.

• Communications for Statistical Applications and Methods
• /
• v.21 no.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
• /
• v.30 no.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.

• International conference on construction engineering and project management
• /
• 2022.06a
• /
• 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.

• Journal of the military operations research society of Korea
• /
• v.11 no.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.

• Journal of the Korean Mathematical Society
• /
• v.60 no.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).

• Bulletin of the Korean Mathematical Society
• /
• v.54 no.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.

• 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.

• Journal of applied mathematics & informatics
• /
• v.30 no.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.