Before revision:  We provide approximations to the algorithmic probability and Kolmogorov complexity of motifs connected to the asymptotic topological propertiesof networks .
After revision:  We provide exact theoretical calculations, numerical approximations and error estimations of entropy, algorithmic probability and Kolmogorov complexity of motifs connected to the asymptotic topological propertiesof networks .