Calculation of Number of Motifs on Three Nodes Using Random Sampling of Frames in Networks with Directed Links

被引：0
|
作者：
Yudin, E. B. [1 ]
Yudina, M. N. [2 ]
机构：
[1] Russian Acad Sci, Siberian Branch, Sobolev Inst Math, Omsk, Russia
[2] Omsk State Tech Univ, Omsk, Russia
来源：
2017 SIBERIAN SYMPOSIUM ON DATA SCIENCE AND ENGINEERING (SSDSE) | 2017年
关键词：
network motifs; occurrence of motifs; statistical modeling;
D O I：
暂无
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
The task of development of efficient algorithms for estimating the frequency of occurrence of non-isomorphic connected subnets (motifs) on a given number of nodes is an important task of network theory. Combinatorial and logical nature of this problem makes the calculation time-consuming and/or causes high consumption of RAM when estimating networks with hundreds of thousands of nodes. In order to solve the problem this paper develops a random sampling of frames method (MSF), based on a statistical approach, and an algorithm to estimate the occurrence of 3-motifs in networks with directed links is proposed. We suggest implementing the algorithm with the help of parallel computing. The results of numerical data experiments are given. When comparing the developed algorithm with other known algorithms its significant advantages in terms of accuracy, speed and consumption of RAM are revealed in some cases.
引用
收藏
页码：23 / 26
页数：4
相关论文
共 50 条
12345