Mixed Random Sampling of Frames method for counting number of motifs

被引:0
|
作者
Yudina, M. N. [1 ]
Zadorozhnyi, V. N. [1 ]
Yudin, E. B. [2 ]
机构
[1] Omsk State Tech Univ, 11 Mira Ave, Omsk 644050, Russia
[2] Russian Acad Sci, Sobolev Inst Math, Siberian Branch, 4 Acad Koptyug Ave, Novosibirsk 630090, Russia
基金
俄罗斯基础研究基金会;
关键词
frequencies of network motifs; statistical sampling algorithms; motif discovery; efficient unbiased estimations; NETWORK MOTIFS;
D O I
10.1088/1742-6596/1260/2/022013
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
The problem of calculating the frequencies of network motifs on three and four nodes in large networks is considered. Telecommunications networks, cell molecular networks are investigated. The sizes of the investigated networks are hundreds of thousands of nodes and connections. These networks are represented in the form of directed and undirected simple graphs. Exact calculating requires huge computational resources for such large graphs. A method for calculating the frequencies of network motifs using the Monte Carlo method with control of an accuracy of calculations is proposed. The proposed effective method minimizes the value of the coefficient of variation.
引用
收藏
页数:8
相关论文
共 50 条
  • [1] Calculation of Number of Motifs on Three Nodes Using Random Sampling of Frames in Networks with Directed Links
    Yudin, E. B.
    Yudina, M. N.
    [J]. 2017 SIBERIAN SYMPOSIUM ON DATA SCIENCE AND ENGINEERING (SSDSE), 2017, : 23 - 26
  • [2] Sampling Methods for Counting Temporal Motifs
    Liu, Paul
    Benson, Austin R.
    Charikar, Moses
    [J]. PROCEEDINGS OF THE TWELFTH ACM INTERNATIONAL CONFERENCE ON WEB SEARCH AND DATA MINING (WSDM'19), 2019, : 294 - 302
  • [3] Tiered Sampling: An Efficient Method for Counting Sparse Motifs in Massive Graph Streams
    De Stefani, Lorenzo
    Terolli, Erisa
    Upfal, Eli
    [J]. ACM TRANSACTIONS ON KNOWLEDGE DISCOVERY FROM DATA, 2021, 15 (05)
  • [4] MIXED METHOD OF RANDOM NUMBER GENERATION - TUTORIAL
    OVERSTREET, C
    NANCE, RE
    [J]. COMPUTERS AND THE HUMANITIES, 1975, 9 (02): : 83 - 86
  • [5] Counting Triangles in Large Graphs by Random Sampling
    Wu, Bin
    Yi, Ke
    Li, Zhenguo
    [J]. IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2016, 28 (08) : 2013 - 2026
  • [6] RANDOM NUMBER SAMPLING METHOD FOR ESTIMATION OF LACTIC-ACID BACTERIA
    ORDONEZ, JA
    [J]. JOURNAL OF APPLIED BACTERIOLOGY, 1979, 46 (02): : 351 - 353
  • [7] COUNTING THE NUMBER OF HAMILTON CYCLES IN RANDOM DIGRAPHS
    FRIEZE, A
    SUEN, S
    [J]. RANDOM STRUCTURES & ALGORITHMS, 1992, 3 (03) : 235 - 241
  • [8] The sampling of noise for random number generation
    Petrie, CS
    Connelly, JA
    [J]. ISCAS '99: PROCEEDINGS OF THE 1999 IEEE INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS, VOL 6: CIRCUITS ANALYSIS, DESIGN METHODS, AND APPLICATIONS, 1999, : 26 - 29
  • [9] Mixed random systematic sampling designs
    Huang, KC
    [J]. METRIKA, 2004, 59 (01) : 1 - 11
  • [10] Mixed random systematic sampling designs
    Kuo-Chung Huang
    [J]. Metrika, 2004, 59 : 1 - 11