scholarly journals A new approach to estimating the expected first hitting time of evolutionary algorithms

2008 ◽  
Vol 172 (15) ◽  
pp. 1809-1832 ◽  
Author(s):  
Yang Yu ◽  
Zhi-Hua Zhou
Keyword(s):  
Evolutionary Algorithms ◽  
Hitting Time ◽  
First Hitting Time ◽  
New Approach

scholarly journals WHY DOES A HUMAN DIE? A STRUCTURAL APPROACH TO COHORT-WISE MORTALITY PREDICTION UNDER SURVIVAL ENERGY HYPOTHESIS

2020 ◽  
pp. 1-29
Author(s):  
Yasutaka Shimizu ◽  
Yuki Minami ◽  
Ryunosuke Ito
Keyword(s):  
Initial Energy ◽  
Mortality Prediction ◽  
Hitting Time ◽  
Parametric Family ◽  
Cumulative Probability ◽  
First Hitting Time ◽  
New Approach ◽  
Probability Of Death ◽  
Inhomogeneous Diffusion ◽  
Mortality Function

Abstract We propose a new approach to mortality prediction under survival energy hypothesis (SEH). We assume that a human is born with initial energy, which changes stochastically in time and the human dies when the energy vanishes. Then, the time of death is represented by the first hitting time of the survival energy (SE) process to zero. This study assumes that SE follows a time-inhomogeneous diffusion process and defines the mortality function, which is the first hitting time distribution function of the SE process. Although SEH is a fictitious construct, we illustrate that this assumption has the potential to yield a good parametric family of cumulative probability of death, and the parametric family yields surprisingly good predictions for future mortality rates.

First hitting time analysis of continuous evolutionary algorithms based on average gain

2016 ◽  
Vol 19 (3) ◽  
pp. 1323-1332 ◽  
Author(s):  
Zhang Yushan ◽  
Huang Han ◽  
Hao Zhifeng ◽  
Hu Guiwu
Keyword(s):  
Evolutionary Algorithms ◽  
Hitting Time ◽  
First Hitting Time ◽  
Time Analysis ◽  
Average Gain

scholarly journals Randomization in the first hitting time problem

2009 ◽  
Vol 79 (23) ◽  
pp. 2422-2428 ◽  
Author(s):  
Ken Jackson ◽  
Alexander Kreinin ◽  
Wanhe Zhang
Keyword(s):  
Hitting Time ◽  
First Hitting Time ◽  
Time Problem

The Study on Convergence and Convergence Rate of Genetic Algorithm Based on an Absorbing Markov Chain

2012 ◽  
Vol 239-240 ◽  
pp. 1511-1515 ◽  
Author(s):  
Jing Jiang ◽  
Li Dong Meng ◽  
Xiu Mei Xu
Keyword(s):  
Genetic Algorithm ◽  
Markov Chain ◽  
Convergence Rate ◽  
Hitting Time ◽  
Sufficient Condition ◽  
First Hitting Time ◽  
Absorbing Markov Chain ◽  
Expected Hitting Time ◽  
Optimization Efficiency ◽  
Theoretical Issues

The study on convergence of GA is always one of the most important theoretical issues. This paper analyses the sufficient condition which guarantees the convergence of GA. Via analyzing the convergence rate of GA, the average computational complexity can be implied and the optimization efficiency of GA can be judged. This paper proposes the approach to calculating the first expected hitting time and analyzes the bounds of the first hitting time of concrete GA using the proposed approach.

Sign in / Sign up

Export Citation Format

Share Document