Estimation of First Passage Time Probabilities at Second Transition respecting Evolutionary MCMC Algorithms
Keywords:Evolutionary Algorithms, First Passage Time, Regular Markov Chain, Conditional Bivariate Distribution
With regard to genetic algorithms with bit mutation, the target is to offer novel algorithm to obtain experiential and theoretic results for first passage time probabilities estimation at second transition. The estimating proposed formula is true with regard to any regular Markov Chain.
Abou El-Enien, U. (2015). Why unified statistics theory by MCMC towards estimation of stationary transition probabilities of stochastic matrix?. Journal of Computer and Mathematical Sciences, 6(7), 411-415. http://www.compmath-journal.org/dnload/Usama-H-Abou-El-Enien/CMJV06I07P0411.pdf
Abou El-Enien, U. (2016). Why unified statistics theory by MCMC towards estimation of stationary joint probabilities of stochastic matrix?. International Journal of Engineering Research and Management, 3(3), 100-102. https://www.ijerm.com/vol/Volume-03-Issue-03
Abou El-Enien, U. (2019). Why estimation algorithm of first passage time transition probabilities concerns genetic algorithms without bit mutation?. Computer Reviews Journal, 4(1), 146-148.
El-Nady, Kh. , Abou El-Enien, U. , & Badr, A. (2011). Why are genetic algorithms MCMC2 Markov Chain Monte Carlo. AMSE Journals, Advances in Modelling and Analysis B, 54(1), 1-16. http://amsemodelling.com/publications/advances_in_modelling/Advances_in_ModellingB.pdf
How to Cite
Copyright (c) 2020 Usama Hanafy Abou El-Enien
This work is licensed under a Creative Commons Attribution 4.0 International License.