Abstract
Community detection in directed networks appears as one of the most relevant topics in the field of network analysis. One common theme in some formalizations is that flows should tend to stay within communities and could be centered round core nodes called "kernels". Hence, we expecttriads to play an important role in the detection of that kind of community. Triads for directed graph are directed sub-graphs of 3 nodes involving at least 2 links between them. To identify communities in directed networks, this paper proposes an undirected edge-weighting scheme based on directed triads. We also propose a new metric on quality of the communities that is based on the triad density of communities. To validate our approach, an experiment was conducted on some networks which show that it has better performance on triad-based density over some state-of-the-art methods.