Network Motifs Detection Using Random Networks with Prescribed Subgraph Frequencies

• Tipo: Artigo em Livro de Atas de Conferência Internacional
• Data: 2017

Autores

Silva, MEP (Autor) Outra; Paredes, P (Autor) Outra; Pedro Ribeiro (Autor) FCUP

Ata de Conferência Internacional

Título: COMPLEX NETWORKS VIII

Páginas: 17-29

8th Conference on Complex Networks (CompleNet)

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

Indexação

ISI Web of Knowledge - 11 Citações

Scopus - 8 Citações

Outras Informações

ID Authenticus: 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.

Idioma: Inglês

Tipo (Avaliação Docente): Científica

Nº de páginas: 13