Spectral Analysis and Long-Term Behavior of Discrete-Time Markov Chains
DOI:
https://doi.org/10.21928/uhdjst.v10n2y2026.pp188-197Keywords:
Discrete-Time Markov Chains, Spectral Analysis, Stationary Distribution, Convergence Rate, Spectral Gap, Eigenvalues, Periodicity, Mixing Time, MATLABAbstract
This paper develops a spectral-probabilistic framework for examining the long-term dynamics of finite discrete-time Markov chains (DTMCs). The framework combines stochastic interpretation with eigenvalue-eigenvector analysis, explicit structural validation, probability propagation, and convergence diagnostics implemented in MATLAB. The principal four-state benchmark has transition matrix P and initial distribution x0 = [1, 0, 0, 0]. For the empirical tolerance ε = 10⁻3, the benchmark trajectory reaches stationarity within 13 steps, with stationary distribution π = (0.2313, 0.2916, 0.2676, 0.2094), subdominant spectral radius ρ = 0.5911, and spectral gap γ = 0.4089. The 13-step result is explicitly tied to the stated initial condition and tolerance. A formal worst-case calculation over all initial distributions gives the same 13-step threshold for this benchmark at ε = 10⁻3. A conservative spectral-gap reference scale is about 21 steps; because the benchmark is not assumed reversible, this value is reported as a comparison scale rather than as a direct theorem for the matrix. Additional synthetic matrices representing slow mixing, periodicity, and near-decomposability demonstrate that the diagnostic procedure distinguishes structurally different regimes. The study is therefore presented as a synthetic numerical benchmark rather than as a validated real-world reliability, deterioration, or risk model.
References
[1] V. Knights, O. Petrovskа and M. Prchkovska. “Mathematical analysis of stochastic transition matrices in markov models using monte carlo and MCMC simulation”. Journal of Natural Sciences and Mathematics of UT, vol. 10, no. 19-20, pp. 100-110, 2025.
[2] L. Huzsvai, E. Kovács, G. Tuba, C. Juhász, D. Jug and J. Zsembeli. “Discrete-time markov chain method for predicting probability of crop yield variability”. Earth, vol. 6, no. 4, p. 142, 2025.
[3] R. K. Gupta, D. Khan and S. Banerjee. “Markovian Brand switching model for long-term steady-state market shares: A study on toothpaste market”. In: Decision Making Under Uncertainty Via Optimization, Modelling, and Analysis. Springer Nature, Singapore, pp. 567-581, 2025.
[4] D. S. S. Mohan, K. V. S. Chakresh, K. S. Reddy and Y. Sailaja. “A Real-Time System for Portfolio Optimization Using Markov Chain Steady-State Analysis”. In: 2025 9th International Conference on Computational System and Information Technology for Sustainable Solutions (CSITSS). IEEE, pp. 1-6, 2025.
[5] A. Raju. “Applications of Markov chains in climate change modelling: A comprehensive review of advances, challenges, and future directions”. Ecological Modelling, vol. 514, p. 111470, 2026.
[6] S. Han, Z. Grieser, S. Yoshikawa, T. Noro, T. Suda and K. Ho. “Spare Strategy Analysis and Design for Large-Scale Satellite Constellation Using Markov Chain”. arXiv [preprint], 2025.
[7] W. Shao, T. Cai and X. Yan. “Advances on stability analysis for discrete-time Markovian jump impulsive stochastic systems with hybrid switching dynamics”. Neurocomputing, vol. 652, p. 131128, 2025.
[8] J. Wang, M. Ye, Y. Kuang, R. Yang, W. Zhou, H. Li and F. Wu. “Long-term feature extraction via frequency prediction for efficient reinforcement learning”. IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 47, pp. 3094-3110, 2025.
[9] A. Habib and M. W. Grenn. “The Effects of Digital Twins Development on System’s Long-Term Performance, Potential Capabilities, and Possible Benefits”. In: International Conference on Enterprise Information Systems (ICEIS). pp. 300-307, 2025.
[10] A. Nazerian, M. Asllani, M. Tyloo and F. Sorrentino. “Open networks in discrete time: Passing vs blocking behavior”. Chaos: An Interdisciplinary. Journal of Nonlinear Science, vol. 35, no. 12, p. 123113, 2025.
[11] S. Feng, L. Li and D. Yuan. “A markov chain monte carlo-based hybrid noise inference for continuous wavelet power spectra: With applications to solar and stellar oscillatory signals”. The Astrophysical Journal Supplement Series, vol. 285, no. 1, p. 17, 2026.
[12] Z. T. Hornberger, D. M. King and S. H. Jacobson. “A framework for analyzing the periodically-observed time-homogeneous Poisson process”. Journal of the Operational Research Society, vol. 76, no. 12, pp. 2532-2547, 2025.
[13] B. I. García-Maya, Y. Morales-Huerta and R. Salgado-García. “Disease spread model in structurally complex spaces: An open Markov chain approach”. Journal of Computational Biology, vol. 32, no. 4, pp. 394-416, 2025.
[14] Q. Wang. “Spectral Purification in Reversible Markov Chains: Hidden Parameters, Observable Equivalence, and Finite-Time Rigidity”. arXiv [preprint], 2026.
[15] A. Branquinho, A. Foulquié-Moreno and M. Mañas. “Spectral Theory for Markov Chains with Transition Matrix Admitting a Stochastic Bidiagonal Factorization”. arXiv [preprint], 2026.
[16] A. Thiam. “Statistical Limit Theorems for Axiom A Diffeomorphisms: Exponential Mixing, Central Limit Theorem, and Large Deviations”. arXiv [preprint], 2026.
[17] B. Nettasinghe, S. Chatterjee, R. Tipireddy and M. M. Halappanavar. “Extending Conformal Prediction to Hidden Markov Models with Exact Validity Via De Finetti’s Theorem for Markov Chains”. In: International Conference on Machine Learning. PMLR, pp. 25890- 25903, 2023.
[18] H. Hennion and L. Hervé, (Eds). “Limit Theorems for Markov Chains and Stochastic Properties of Dynamical Systems by Quasi- Compactness”. Springer, Berlin, Heidelberg, 2002.
[19] R. Benita, M. Elad and J. Keshet. “Spectral analysis of diffusion models with application to schedule design”. Advances in Neural Information Processing Systems, vol. 38, pp. 2073-2127, 2026.
Downloads
Published
Issue
Section
License
Copyright (c) 2026 Abdul Salam Hemat, Abdulullah Abid, Ahmad Ali Mehrad

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.
