pith. sign in

arxiv: 0902.3728 · v3 · submitted 2009-02-21 · ⚛️ physics.soc-ph · cond-mat.stat-mech

LinkRank: Finding communities in directed networks

classification ⚛️ physics.soc-ph cond-mat.stat-mech
keywords networksdirectedmodularitycommunitieslinkrankmethodnetworkundirected
0
0 comments X
read the original abstract

To identify communities in directed networks, we propose a generalized form of modularity in directed networks by introducing a new quantity LinkRank, which can be considered as the PageRank of links. This generalization is consistent with the original modularity in undirected networks and the modularity optimization methods developed for undirected networks can be directly applied to directed networks by optimizing our new modularity. Also, a model network, which can be used as a benchmark network in further community studies, is proposed to verify our method. Our method is supposed to find communities effectively in citation- or reference-based directed networks.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.