摘要
In this paper, we define a model of random dynamical systems(RDS) on graphs and prove that they are actually homogeneous discrete-time Markov chains. Moreover, a necessary and sufficient condition is obtained for that two state vectors can communicate with each other in a random dynamical system(tLDS).
基金
Foundation item: Supported by the Science Foundation of Donghua University