Finding Core-periphery Structure in Directed Networks: An Algorithm for Detecting Multiple-group Core-periphery Structure in Directed Netwoks

The core-periphery structure is a mesoscale topological structure that refers to the presence of a dense core and a sparse periphery. The core-periphery structure has been discovered in financial, biological, and technological networks. Various methods for detecting core-periphery structure have been proposed, exploring different discrete or...

Directed graph Laplacian applied on spectral clustering

The graph Laplacian is a tool which is commonly used in different applications, amongst which spectral clustering. This report contains a research in different def- initions for the graph Laplacian applied on directed graphs, since it is rarely used in applications neither occurs often in literature. Two definitions are discussed into more...

Rooted binary level-3 phylogenetic networks are encoded by quarnets

Phylogenetic networks generalize evolutionary trees and are commonly used to represent evolutionary relationships between species that undergo reticulate processes such as hybridization, recombination and lateral gene transfer. Recently, there has been great interest in knowing which networks are determined or encoded by their trinets, that are...