Skip to main content
Fig. 10 | Applied Network Science

Fig. 10

From: Establish the expected number of induced motifs on unlabeled graphs through analytical models

Fig. 10

a A 4-nodes path where present and absent edges are denoted with black and red lines, respectively. b From left to right: the matrix \(M_{\mathcal {CA}}\) of combinations of absent edges of the 4-nodes path, where \(M_{\mathcal {CA}}[c,x]\) is the number of edges in combination c to which node x is incident; node degrees of the 4-node path; the matrix \(M_{\mathcal {D}}\) of node degrees of motifs in the TIAS of the 4-nodes path, resulted by adding node degrees of the 4-nodes path (2,2,1,1) to each row of \(M_{\mathcal {CA}}\)

Back to article page