Statistical approach to calculation of number of network motifs

摘要

The development of efficient algorithms for the analysis of network motifs is a direction in Network Science, which is of great importance in the study of communication networks, social, biological and other networks. Detection and calculation of number of network motifs are closely related to the counting of typical isomorphic subgraphs in large graphs. The article proposes to accelerate this process by using the Monte Carlo method. Examples of counting of typical subgraphs with 3 and 4 vertices in the undirected graph are given. The proposed approach can also be extended to analysis of directed graphs.