Network Motifs Detection Using Random Networks with Prescribed Subgraph Frequencies

• Type: Article in International Conference Proceedings Book
• Date: 2017

Authors

Silva, MEP (Author) Other; Paredes, P (Author) Other; Pedro Ribeiro (Author) FCUP

Conference proceedings International

Title: COMPLEX NETWORKS VIII

Pages: 17-29

8th Conference on Complex Networks (CompleNet)

Inter Univ Ctr, Dubrovnik, CROATIA, MAR 21-24, 2017

Indexing

ISI Web of Knowledge - 11 Citations

Scopus - 8 Citations

Other information

Authenticus ID: P-00P-J46

DOI: 10.1007/978-3-319-54241-6_2

Abstract (EN): In order to detect network motifs we need to evaluate the exceptionality of subgraphs in a given network. This is usually done by comparing subgraph frequencies on both the original and an ensemble of random networks keeping certain structural properties. The classical null model implies preserving the degree sequence. In this paper our focus is on a richer model that approximately fixes the frequency of subgraphs of size K - 1 to compute motifs of size K. We propose a method for generating random graphs under this model, and we provide algorithms for its efficient computation. We show empirical results of our proposed methodology on neurobiological networks, showcasing its efficiency and its differences when comparing to the traditional null model.

Language: English

Type (Professor's evaluation): Scientific

No. of pages: 13