Title :
Statistical approach to calculation of number of network motifs
Author :
Yudin, E.B. ; Zadorozhnyi, V.N.
Author_Institution :
Omsk State Tech. Univ., Omsk, Russia
Abstract :
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.
Keywords :
Monte Carlo methods; directed graphs; network theory (graphs); statistical analysis; Monte Carlo method; communication networks; directed graph analysis; isomorphic subgraphs; network motifs; network science; statistical approach; undirected graph; Acceleration; Accuracy; Algorithm design and analysis; Bioinformatics; Internet; Monte Carlo methods; Uniform resource locators; algorithm analysis; network motifs; subgraph counting;
Conference_Titel :
Control and Communications (SIBCON), 2015 International Siberian Conference on
Conference_Location :
Omsk
Print_ISBN :
978-1-4799-7102-2
DOI :
10.1109/SIBCON.2015.7147296
