Given a motif M, the framework aims to find a cluster of the set of nodes S such that nodes of S participate in many instances of M and avoid cutting instances of M (that is only a subset of nodes in instances of M appears in S).
Mathematically, the aim is to minimise the motif conductance metric given as cutM(S, S’) / min[volM(S), volM(S’)] where S’ is complement of S, cutM(S, S’)= number...
Read more…(324 words)
Network Motifs - Simple Building Blocks of Complex Networksby Wiki
The paper presents the concept of “network motifs” to understand the structural design of a network or a graph.