“…For polynomial maps, it has been shown that the connectivity of a map's Julia set is tightly related to the structure of its critical orbits (i.e., the orbits of the map's critical points). Due to extensive work spanning almost one century, from Julia [8] and Fatou [9] until recent developments [10,11], we now have the following: For a single iterated logistic map [12,13], the Fatou-Julia Theorem implies that the Julia set is either totally connected, for values of c in the Mandelbrot set (i.e., if the orbit of the critical point 0 is bounded), or totally disconnected, for values of c outside of the Mandelbrot set (i.e., if the orbit of the critical point 0 is unbounded). In previous work, the authors showed that this dichotomy breaks in the case of random iterations of two maps [19].…”