There is a plethora of notions of randomness for Cantor space ($\phantom{}^\omega 2$) (Schnorr randomness, Martin-Löf randomness, weak 2-randomness, the various forms of higher randomness such as $\Delta^1_1$ randomness, and so on). See, for example, André Nies, Computability and Randomness (Oxford: Oxford University Press, 2009), Rodney Downey and Denis Hirschfeldt, Algorithmic Randomness and Complexity (Berlin: Springer, 2010), or any number of other texts. And these can be extended in obvious ways to $\mathbb{R}$, $\phantom{}^\omega \omega$, and some other Polish spaces.
I have been unable, however, to find any discussions of how to extend notions of randomness to $\phantom{}^\alpha 2$ for $\alpha > \omega$, either for $\alpha$ a large countable ordinal or (more ambitiously) where $\vert \alpha \vert > \beth_1$. Any pointers to work on this question would be greatly appreciated.