Application of the One-Step Second-Derivative Method for Solving the Transient Distribution in Markov Chain

Markov chains are an application of stochastic models in operation research, helping the analysis and optimization of processes with random events and transitions. The method that will be deployed to obtain the transient solution to a Markov chain problem is an important part of this process. The present paper introduces a novel Ordinary Differential Equation (ODE) approach to solve the Markov chain problem. The probability distribution of a continuous-time Markov chain with an infinitesimal generator at a given time is considered, which is a resulting solution of the Chapman-Kolmogorov differential equation. This study presents a one-step second-derivative method with better accuracy in solving the first-order Initial Value Problems (IVPs) compared to other approaches found in the literature, which is verified by the obtained solutions. The determination of the transient solutions for Markov chains is presented using the proposed method. The results show better accuracy in solving the transient distribution in Markov chains, which implies that there is an improved assurance in adopting this approach in future studies of the Markov chain modeling process for predicting future events based on the current state of a process. Future studies on Markov chain modeling could adopt the introduced method to predict future events based on the current state of a process.

Authors

Publication Details

Journal
Engineering Technology & Applied Science Research
Published
2025-04-03
DOI
https://doi.org/10.48084/etasr.9485
Primary Topic
Simulation Techniques and Applications
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Application of the One-Step Second-Derivative Method for Solving the Transient Distribution in Markov Chain

Zeina Mueen
Engineering Technology & Applied Science Research
Simulation Techniques and Applications
article

Application of the One-Step Second-Derivative Method for Solving the Transient Distribution in Markov Chain

Zeina Mueen
article en

Abstract

Markov chains are an application of stochastic models in operation research, helping the analysis and optimization of processes with random events and transitions. The method that will be deployed to obtain the transient solution to a Markov chain problem is an important part of this process. The present paper introduces a novel Ordinary Differential Equation (ODE) approach to solve the Markov chain problem. The probability distribution of a continuous-time Markov chain with an infinitesimal generator at a given time is considered, which is a resulting solution of the Chapman-Kolmogorov differential equation. This study presents a one-step second-derivative method with better accuracy in solving the first-order Initial Value Problems (IVPs) compared to other approaches found in the literature, which is verified by the obtained solutions. The determination of the transient solutions for Markov chains is presented using the proposed method. The results show better accuracy in solving the transient distribution in Markov chains, which implies that there is an improved assurance in adopting this approach in future studies of the Markov chain modeling process for predicting future events based on the current state of a process. Future studies on Markov chain modeling could adopt the introduced method to predict future events based on the current state of a process.

Engineering Technology & Applied Science ResearchVol. 15(2)
Openalex Percentile: Top 92%
Simulation Techniques and Applications
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.