Kurzbeschreibung: In this talk, we investigate the geometric and dimensional properties of some generalisations of Random Graph Directed Markov Systems by estimating their almost-sure Hausdorff, (upper/lower) box counting and packing dimensions by the mean of two different types of expected topological pressure functions.