Diclique clustering in a directed random graph

Mindaugas Bloznelis, Lasse Leskelä

We discuss a notion of clustering for directed graphs, which describes how likely two followers of a node are to follow a common target. The associated network motifs, called dicli…