Community Landscapes: An Integrative Approach to Determine Overlapping Network Module Hierarchy, Identify Key Nodes and Predict Network Dynamics

@article{Kovcs2010CommunityLA,
  title={Community Landscapes: An Integrative Approach to Determine Overlapping Network Module Hierarchy, Identify Key Nodes and Predict Network Dynamics},
  author={Istv{\'a}n A. Kov{\'a}cs and Robin Palotai and Mate S. Szalay and P{\'e}ter Csermely},
  journal={PLoS ONE},
  year={2010},
  volume={5}
}
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… Expand
A method for detecting modules in quantitative bipartite networks
TLDR
The algorithm introduced here must be seen as a considerable improvement over the current standard of algorithms for binary networks due to its higher sensitivity, which is likely to lead to be useful for detecting modules in the typically noisy data of ecological networks. Expand
Identifying and Characterizing Nodes Important to Community Structure Using the Spectrum of the Graph
TLDR
A centrality metric is proposed to measure the importance of network nodes to community structure using the spectrum of the adjacency matrix and an index to distinguish two kinds of important nodes in communities, i.e., “community core” and “bridge” is proposed. Expand
Structural Vulnerability Analysis of Overlapping Communities in Complex Networks
TLDR
This paper proposes the concept of generating edges and provides an optimal algorithm for detecting the Minimal Generating Edge Set (MGES) in a network community and suggests genEdge, an effective solution based on this MGES. Expand
Finding Statistically Significant Communities in Networks
TLDR
OSLOM (Order Statistics Local Optimization Method), the first method capable to detect clusters in networks accounting for edge directions, edge weights, overlapping communities, hierarchies and community dynamics, is presented. Expand
Discovering Network Structure Beyond Communities
TLDR
The results of applying the proposed exploratory method for discovering groups of nodes characterized by common network properties suggest the possibility that most group structures lurk undiscovered in the fast-growing inventory of social, biological, and technological networks of scientific interest. Expand
Discovering Link Communities in Complex Networks by an Integer Programming Model and a Genetic Algorithm
TLDR
This paper forms the link community partition problem into an integer programming model which allows us to partition a complex network into overlapping communities and proposes a genetic algorithm for link community detection which can partition a network into overlap communities without knowing the number of communities. Expand
Perturbation Centrality and Turbine: A Novel Centrality Measure Obtained Using a Versatile Network Dynamics Tool
TLDR
Turbine is introduced, a generic framework enabling fast simulation of any algorithmically definable dynamics on very large networks and a novel centrality measure: perturbation centrality is defined, inspired by communicating vessels. Expand
The map equation for link community
  • Youngdo Kim, H. Jeong
  • Mathematics, Physics
  • Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2011
TLDR
The map equation method is extended, which was originally developed for node communities, to find link communities in networks, and the results show that this method can identify the overlapping role of nodes effectively. Expand
Detecting Network Communities: An Application to Phylogenetic Analysis
TLDR
It is concluded that the network-based method can be used as a powerful tool for retrieving modularity information from weighted networks, which is useful for phylogenetic analysis. Expand
Defining and identifying cograph communities in complex networks
Community or module detection is a fundamental problem in complex networks. Most of the traditional algorithms available focus only on vertices in a subgraph that are densely connected amongExpand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 615 REFERENCES
Structure of Heterogeneous Networks
TLDR
It is shown that exploiting additional sources of evidence corresponding to links between, as well as among, different entity types yields new insights into network structure, and is extended to the popular modularity-maximization method for community detection. Expand
Uncovering the overlapping community structure of complex networks in nature and society
TLDR
After defining a set of new characteristic quantities for the statistics of communities, this work applies an efficient technique for exploring overlapping communities on a large scale and finds that overlaps are significant, and the distributions introduced reveal universal features of networks. Expand
Impact of hierarchical modular structure on ranking of individual nodes in directed networks
Many systems, ranging from biological and engineering systems to social systems, can be modeled as directed networks, with links representing directed interaction between two nodes. To assess theExpand
Detecting groups of similar components in complex networks
We study how to detect groups in a complex network each of which consists of component nodes sharing a similar connection pattern. Based on the mixture models and the exploratory analysis set up byExpand
Hierarchical structure and the prediction of missing links in networks
TLDR
This work presents a general technique for inferring hierarchical structure from network data and shows that the existence of hierarchy can simultaneously explain and quantitatively reproduce many commonly observed topological properties of networks. Expand
Link communities reveal multiscale complexity in networks
TLDR
It is implied that link communities are fundamental building blocks that reveal overlap and hierarchical organization in networks to be two aspects of the same phenomenon. Expand
Multi-scale modularity in complex networks
  • R. Lambiotte
  • Computer Science, Physics
  • 8th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks
  • 2010
TLDR
It is argued for the use of more flexible quality functions incorporating a resolution parameter that allows us to reveal the natural scales of the system. Expand
Detect overlapping and hierarchical community structure in networks
TLDR
This paper proposes an algorithm (EAGLE) to detect both the overlapping and hierarchical properties of complex community structure together and deals with the set of maximal cliques and adopts an agglomerative framework. Expand
Extending the definition of modularity to directed graphs with overlapping communities
TLDR
This paper starts from the definition of a modularity function, given by Newman to evaluate the goodness of network community decompositions, and extends it to the more general case of directed graphs with overlapping community structures. Expand
CASCADE: a novel quasi all paths-based network analysis algorithm for clustering biological interactions
TLDR
A novel clustering methodology for PPI networks wherein the biological and topological influence of each protein on other proteins is modeled using the probability distribution that the series of interactions necessary to link a pair of distant proteins in the network occur within a time constant. Expand
...
1
2
3
4
5
...