Graph-theoretic bound on number of A.C.I.M. for random transformation

Upper and lower bounds are given for the number of ergodic absolutely continuous invariant measures for a general random map. They are based on a communication graph describing the interaction of deterministic transformations used to define the random one. In particular, the case of piecewise expanding transformations is discussed