Fig. 1
From: ProMotE: an efficient algorithm for counting independent motifs in uncertain network topologies
An example to explain three frequency measures. a A hypothetical deterministic network Go with seven nodes and eight edges. b A motif pattern M with four nodes and three edges. c - h Six possible embeddings of motif pattern M in network Go denoted with the embedding set \(\mathcal {H} =\{H_{1}, H_{2}, H_{3}, H_{4}, H_{5}, H_{6}\}\). i A triangle pattern. j An embedding set of triangle pattern