This talk is concerned with certain invariant processes over infinite trees. The main focus will be on the class of factor of IID processes which have received a growing attention recently due to their connection to certain randomized local algorithms and random regular graphs.

Entropy inequalities for these processes played a central role in a couple of remarkable results in the past few years. I will talk about how one can find and prove new entropy inequalities.