Random chain recurrent sets for random dynamical systems

Simple item page
dc.contributor.authorChen, X.
dc.contributor.authorDuan, J.
dc.date.issued2009
dc.description.abstractIt is known by the Conley’s theorem that the chain recurrent set CR(’) of a deterministic flow’ on a compact metric space is the complement of the union of sets B(A) A, where A varies over the collection of attractors and B(A) is the basin of attraction of A. It has recently been shown that a similar decomposition result holds for random dynamical systems (RDSs) on non-compact separable complete metric spaces, but under a so-called absorbing condition. In the present article, the authors introduce a notion of random chain recurrent sets for RDSs, and then prove the random Conley’s theorem on non-compact separable complete metric spaces without the absorbing condition.
dc.description.statementofresponsibilityXiaopeng Chen and Jinqiao Duana
dc.identifier.citationDynamics and Stability of Systems, 2009; 24(4):537-546
dc.identifier.doi10.1080/14689360903164173
dc.identifier.issn1468-9367
dc.identifier.issn1468-9375
dc.identifier.urihttp://hdl.handle.net/2440/66776
dc.language.isoen
dc.publisherTaylor & Francis Ltd
dc.rights(c) 2009 Taylor & Francis
dc.source.urihttps://doi.org/10.1080/14689360903164173
dc.subjectchain recurrent sets
dc.subjectattractors
dc.subjectConley’s theorem
dc.subjectrandom dynamical systems
dc.subjectcocycle
dc.titleRandom chain recurrent sets for random dynamical systems
dc.typeJournal article
pubs.publication-statusPublished

Files

Collections

Mathematical Sciences publications