82,683 research outputs found
A link density clustering algorithm based on automatically selecting density peaks for overlapping community detection
Peer reviewedPostprin
Fragmenting networks by targeting collective influencers at a mesoscopic level
A practical approach to protecting networks against epidemic processes such
as spreading of infectious diseases, malware, and harmful viral information is
to remove some influential nodes beforehand to fragment the network into small
components. Because determining the optimal order to remove nodes is a
computationally hard problem, various approximate algorithms have been proposed
to efficiently fragment networks by sequential node removal. Morone and Makse
proposed an algorithm employing the non-backtracking matrix of given networks,
which outperforms various existing algorithms. In fact, many empirical networks
have community structure, compromising the assumption of local tree-like
structure on which the original algorithm is based. We develop an immunization
algorithm by synergistically combining the Morone-Makse algorithm and coarse
graining of the network in which we regard a community as a supernode. In this
way, we aim to identify nodes that connect different communities at a
reasonable computational cost. The proposed algorithm works more efficiently
than the Morone-Makse and other algorithms on networks with community
structure.Comment: 5 figures, 3 tables, and SI include
A generalised significance test for individual communities in networks
Many empirical networks have community structure, in which nodes are densely
interconnected within each community (i.e., a group of nodes) and sparsely
across different communities. Like other local and meso-scale structure of
networks, communities are generally heterogeneous in various aspects such as
the size, density of edges, connectivity to other communities and significance.
In the present study, we propose a method to statistically test the
significance of individual communities in a given network. Compared to the
previous methods, the present algorithm is unique in that it accepts different
community-detection algorithms and the corresponding quality function for
single communities. The present method requires that a quality of each
community can be quantified and that community detection is performed as
optimisation of such a quality function summed over the communities. Various
community detection algorithms including modularity maximisation and graph
partitioning meet this criterion. Our method estimates a distribution of the
quality function for randomised networks to calculate a likelihood of each
community in the given network. We illustrate our algorithm by synthetic and
empirical networks.Comment: 20 pages, 4 figures and 4 table
- …