Using the technique of evolving sets, we explore connection between entropy growth and transience for simple random walks on connected infinite graphs with bounded degree. In particular show that a walk starting at vertex x0, if after n steps, En is least Cn where C independent then transient. We also give an example which demonstrates condition being x0 necessary.

This study was conducted to investigate the prediction of growth performance using linear regression and artificial neural network (ANN) in broiler chicken. Artificial neural networks (ANNs) are powerful tools for modeling systems in a wide range of applications. The ANN model with a back propagation algorithm successfully learned the relationship between the inputs of metabolizable energy (kca...