Establish the Expected Number of Injective Motifs on Unlabeled Graphs Through Analytical Models
Network motifs have a central role in explaining the functionality of complex systems. Establishing motif significance requires the computation of the expected number of their occurrences according to a random graph model. Few models have been proposed to analytically derive the expected number of non-induced occurrences of a motif. In this paper we present an analytical model to compute the expected number of occurrences of induced motifs in unlabeled graphs. We will illustrate two different algorithms for computing the occurrence probability of induced motifs. We evaluate the performance of our algorithms for calculating the expected number of induced motifs with up to 10 nodes.
KeywordsInjective motifs Networks Random graphs Analytical models
- 5.Johnson, N.L., Kotz, S., Kemp, A.W.: Univariate Discrete Distributions. Wiley (1992)Google Scholar
- 8.Micale, G., Pulvirenti, A., Ferro, A., Giugno, R., Shasha, D.: Fast methods for finding significant motifs on labelled multi-relational networks. J. Complex Netw. cnz008 (2019)Google Scholar
- 9.Milo, R., Kashtan, N., Itzkovitz, S., et al.: On the uniform generation of random graphs with prescibed degree sequences. Cond. Mat. 0312028, 1–4 (2004)Google Scholar