9,280 research outputs found
ModuLand plug-in for Cytoscape: determination of hierarchical layers of overlapping network modules and community centrality
Summary: The ModuLand plug-in provides Cytoscape users an algorithm for
determining extensively overlapping network modules. Moreover, it identifies
several hierarchical layers of modules, where meta-nodes of the higher
hierarchical layer represent modules of the lower layer. The tool assigns
module cores, which predict the function of the whole module, and determines
key nodes bridging two or multiple modules. The plug-in has a detailed
JAVA-based graphical interface with various colouring options. The ModuLand
tool can run on Windows, Linux, or Mac OS. We demonstrate its use on protein
structure and metabolic networks. Availability: The plug-in and its user guide
can be downloaded freely from: http://www.linkgroup.hu/modules.php. Contact:
[email protected] Supplementary information: Supplementary
information is available at Bioinformatics online.Comment: 39 pages, 1 figure and a Supplement with 9 figures and 10 table
Uncovering the overlapping community structure of complex networks in nature and society
Many complex systems in nature and society can be described in terms of
networks capturing the intricate web of connections among the units they are
made of. A key question is how to interpret the global organization of such
networks as the coexistence of their structural subunits (communities)
associated with more highly interconnected parts. Identifying these a priori
unknown building blocks (such as functionally related proteins, industrial
sectors and groups of people) is crucial to the understanding of the structural
and functional properties of networks. The existing deterministic methods used
for large networks find separated communities, whereas most of the actual
networks are made of highly overlapping cohesive groups of nodes. Here we
introduce an approach to analysing the main statistical features of the
interwoven sets of overlapping communities that makes a step towards uncovering
the modular structure of complex systems. After defining a set of new
characteristic quantities for the statistics of communities, we apply an
efficient technique for exploring overlapping communities on a large scale. We
find that overlaps are significant, and the distributions we introduce reveal
universal features of networks. Our studies of collaboration, word-association
and protein interaction graphs show that the web of communities has non-trivial
correlations and specific scaling properties.Comment: The free academic research software, CFinder, used for the
publication is available at the website of the publication:
http://angel.elte.hu/clusterin
Community landscapes: an integrative approach to determine overlapping network module hierarchy, identify key nodes and predict network dynamics
Background: Network communities help the functional organization and
evolution of complex networks. However, the development of a method, which is
both fast and accurate, provides modular overlaps and partitions of a
heterogeneous network, has proven to be rather difficult. Methodology/Principal
Findings: Here we introduce the novel concept of ModuLand, an integrative
method family determining overlapping network modules as hills of an influence
function-based, centrality-type community landscape, and including several
widely used modularization methods as special cases. As various adaptations of
the method family, we developed several algorithms, which provide an efficient
analysis of weighted and directed networks, and (1) determine pervasively
overlapping modules with high resolution; (2) uncover a detailed hierarchical
network structure allowing an efficient, zoom-in analysis of large networks;
(3) allow the determination of key network nodes and (4) help to predict
network dynamics. Conclusions/Significance: The concept opens a wide range of
possibilities to develop new approaches and applications including network
routing, classification, comparison and prediction.Comment: 25 pages with 6 figures and a Glossary + Supporting Information
containing pseudo-codes of all algorithms used, 14 Figures, 5 Tables (with 18
module definitions, 129 different modularization methods, 13 module
comparision methods) and 396 references. All algorithms can be downloaded
from this web-site: http://www.linkgroup.hu/modules.ph
Detection of node group membership in networks with group overlap
Most networks found in social and biochemical systems have modular
structures. An important question prompted by the modularity of these networks
is whether nodes can be said to belong to a single group. If they cannot, we
would need to consider the role of "overlapping communities." Despite some
efforts in this direction, the problem of detecting overlapping groups remains
unsolved because there is neither a formal definition of overlapping community,
nor an ensemble of networks with which to test the performance of group
detection algorithms when nodes can belong to more than one group. Here, we
introduce an ensemble of networks with overlapping groups. We then apply three
group identification methods--modularity maximization, k-clique percolation,
and modularity-landscape surveying--to these networks. We find that the
modularity-landscape surveying method is the only one able to detect
heterogeneities in node memberships, and that those heterogeneities are only
detectable when the overlap is small. Surprisingly, we find that the k-clique
percolation method is unable to detect node membership for the overlapping
case.Comment: 12 pages, 6 figures. To appear in Euro. Phys. J
ĂlĆlĂ©nyek kollektĂv viselkedĂ©sĂ©nek statisztikus fizikĂĄja = Statistical physics of the collective behaviour of organisms
Experiments: We have carried out quantitative experiments on the collective motion of cells as a function of their density. A sharp transition could be observed from the random motility in sparse cultures to the flocking of dense islands of cells. Using ultra light GPS devices developed by us, we have determined the existing hierarchical relations within a flock of 10 homing pigeons. Modelling: From the simulations of our new model of flocking we concluded that the information exchange between particles was maximal at the critical point, in which the interplay of such factors as the level of noise, the tendency to follow the direction and the acceleration of others results in large fluctuations. Analysis: We have proposed a novel link-density based approach to finding overlapping communities in large networks. The algorithm used for the implementation of this technique is very efficient for most real networks, and provides full statistics quickly. Correspondingly, we have developed a by now popular, user-friendly, freely downloadable software for finding overlapping communities. Extending our method to the time-dependent regime, we found that large groups in evolving networks persist for longer if they are capable of dynamically altering their membership, thus, an ability to change the group composition results in better adaptability. We also showed that knowledge of the time commitment of members to a given community can be used for estimating the community's lifetime. Experiments: We have carried out quantitative experiments on the collective motion of cells as a function of their density. A sharp transition could be observed from the random motility in sparse cultures to the flocking of dense islands of cells. Using ultra light GPS devices developed by us, we have determined the existing hierarchical relations within a flock of 10 homing pigeons. Modelling: From the simulations of our new model of flocking we concluded that the information exchange between particles was maximal at the critical point, in which the interplay of such factors as the level of noise, the tendency to follow the direction and the acceleration of others results in large fluctuations. Analysis: We have proposed a novel link-density based approach to finding overlapping communities in large networks. The algorithm used for the implementation of this technique is very efficient for most real networks, and provides full statistics quickly. Correspondingly, we have developed a by now popular, user-friendly, freely downloadable software for finding overlapping communities. Extending our method to the time-dependent regime, we found that large groups in evolving networks persist for longer if they are capable of dynamically altering their membership, thus, an ability to change the group composition results in better adaptability. We also showed that knowledge of the time commitment of members to a given community can be used for estimating the community's lifetime
Model selection and hypothesis testing for large-scale network models with overlapping groups
The effort to understand network systems in increasing detail has resulted in
a diversity of methods designed to extract their large-scale structure from
data. Unfortunately, many of these methods yield diverging descriptions of the
same network, making both the comparison and understanding of their results a
difficult challenge. A possible solution to this outstanding issue is to shift
the focus away from ad hoc methods and move towards more principled approaches
based on statistical inference of generative models. As a result, we face
instead the more well-defined task of selecting between competing generative
processes, which can be done under a unified probabilistic framework. Here, we
consider the comparison between a variety of generative models including
features such as degree correction, where nodes with arbitrary degrees can
belong to the same group, and community overlap, where nodes are allowed to
belong to more than one group. Because such model variants possess an
increasing number of parameters, they become prone to overfitting. In this
work, we present a method of model selection based on the minimum description
length criterion and posterior odds ratios that is capable of fully accounting
for the increased degrees of freedom of the larger models, and selects the best
one according to the statistical evidence available in the data. In applying
this method to many empirical unweighted networks from different fields, we
observe that community overlap is very often not supported by statistical
evidence and is selected as a better model only for a minority of them. On the
other hand, we find that degree correction tends to be almost universally
favored by the available data, implying that intrinsic node proprieties (as
opposed to group properties) are often an essential ingredient of network
formation.Comment: 20 pages,7 figures, 1 tabl
- âŠ