Centrality properties of directed module members in social networks

Simple item page
dc.creatorPollner, Peter
dc.creatorPalla, Gergely
dc.creatorAbel, Daniel
dc.creatorVicsek, Andras
dc.creatorFarkas, Illes J.
dc.creatorDerenyi, Imre
dc.creatorVicsek, Tamas
dc.date2008-09-03
dc.date.accessioned2026-07-07T10:00:24Z
dc.date.available2026-07-07T10:00:24Z
dc.descriptionSeveral recent studies of complex networks have suggested algorithms for locating network communities, also called modules or clusters, which are mostly defined as groups of nodes with dense internal connections. Along with the rapid development of these clustering techniques, the ability of revealing overlaps between communities has become very important as well. An efficient search technique for locating overlapping modules is provided by the Clique Percolation Method (CPM) and its extension to directed graphs, the CPMd algorithm. Here we investigate the centrality properties of directed module members in social networks obtained from e-mail exchanges and from sociometric questionnaires. Our results indicate that nodes in the overlaps between modules play a central role in the studied systems. Furthermore, the two different types of networks show interesting differences in the relation between the centrality measures and the role of the nodes in the directed modules.
dc.descriptionThe free academic research software, CFinder, used for the publication is available at the website of the publication: http://www.cfinder.org
dc.identifierhttps://arxiv.org/abs/0809.0669
dc.identifierhttp://arxiv.org/abs/0809.0669
dc.identifierPhysica A: Statistical Mechanics and its Applications 387, (Issues 19-20), page: 4959-4966 (2008)
dc.identifierdoi:10.1016/j.physa.2008.04.025
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/168314
dc.subjectPhysics and Society
dc.titleCentrality properties of directed module members in social networks
dc.typetext

Files

Collections

arXiv