作者: Youngdo Kim , Hawoong Jeong
DOI: 10.1103/PHYSREVE.84.026110
关键词: Metadata 、 Node (computer science) 、 Clique percolation method 、 Mathematics 、 Community structure 、 Evolving networks 、 Complex network 、 Random walk 、 Graph theory 、 Data mining
摘要: Community structure exists in many real-world networks and has been reported being related to several functional properties of the networks. The conventional approach was partitioning nodes into communities, while some recent studies start links instead find overlapping communities efficiently. We extended map equation method, which originally developed for node link This method is tested on various kinds compared with metadata networks, results show that our can identify role effectively. advantage this community scheme be quantitatively by measuring unknown information left besides structure. It used decide whether or not should scheme. Furthermore, easily directed weighted since it based random walk.