Motivic clustering schemes for directed graphs

Abstract
Motivated by the concept of network motifs we construct certain clustering methods (functors) which are parametrized by a given collection of motifs (or representers).
View on arXivComments on this paper