組合數學研討會

主講者: Dr. Douglas Stones (Monash University)
講題: The trouble with network motifs: an analytical perspective
時間: 2013-01-18 (Fri.)  15:30 - 17:00
地點: 數學所 617 研討室 (台大院區)
Abstract: Network motifs are network sub-structures which occur with a significantly higher frequency than in randomised networks. It is thought that network motifs play a more important role than arbitrary sub-structures. Mainstream methods for discovering network motifs rely implicitly on assumptions of independence between candidates and a normal distribution of the frequency counts. We show that this is simply not true: different candidates have different distributions. Furthermore, we show that definitions which have been conflated in the literature, e.g. frequency-based vs. concentration-based statistics and high-frequency vs. low-probability motifs, can lead to diametrically opposite conclusions and, indeed, to ill-defined concepts.
  || Close window ||