Directed network modules

Abstract

A search technique locating network modules, i.e., internally densely connected groups of nodes in directed networks is introduced by extending the Clique Percolation Method originally proposed for undirected networks. After giving a suitable definition for directed modules we investigate their percolation transition in the Erdos-Renyi graph both analytically and numerically. We also analyse four real-world directed networks, including Google's own webpages, an email network, a word association graph and the transcriptional regulatory network of the yeast Saccharomyces cerevisiae. The obtained directed modules are validated by additional information available for the nodes. We find that directed modules of real-world graphs inherently overlap and the investigated networks can be classified into two major groups in terms of the overlaps between the modules. Accordingly, in the word-association network and among Google's webpages the overlaps are likely to contain in-hubs, whereas the modules in the email and transcriptional regulatory networks tend to overlap via out-hubs.

21 pages, 10 figures, version 2: added two paragaphs

References in corpus (16)

• Emergence of scaling in random networks
• Statistical mechanics of complex networks
• Community structure in social and biological networks
• Modularity and community structure in networks
• Uncovering the overlapping community structure of complex networks in nature and society
• Hierarchical organization of modularity in metabolic networks
• The large-scale organization of metabolic networks
• The worldwide air transportation network: Anomalous centrality, community structure, and cities' global roles
• Quantifying social group evolution
• Self-similarity of complex networks
• Identity and Search in Social Networks
• Scale-free topology of e-mail networks
• CFinder: Locating cliques and overlapping modules in biological networks
• Dynamics of market correlations: Taxonomy and portfolio analysis
• Clique percolation in random networks
• Preferential attachment of communities: the same principle, but a higher level

Cited by in corpus (28)

• Clustering and Community Detection in Directed Networks: A Survey
• Controlling edge dynamics in complex networks
• Robustness of community structure in networks
• Extending the definition of modularity to directed graphs with overlapping communities
• Topological strata of weighted complex networks
• Clique Graphs and Overlapping Communities
• Potential Theory for Directed Networks
• Quantifying and identifying the overlapping community structure in networks
• Alignment and integration of complex networks by hypergraph-based spectral clustering
• Clique percolation in random graphs
• Cooperation in the snowdrift game on directed small-world networks under self-questioning and noisy conditions
• Evolution of ethnocentrism on undirected and directed Barabási-Albert networks
• Impact of hierarchical modular structure on ranking of individual nodes in directed networks
• Map Equation Centrality: Community-aware Centrality based on the Map Equation
• Percolation on random networks with arbitrary k-core structure
• Griffiths phases in infinite-dimensional, non-hierarchical modular networks
• Clique percolation
• Cycle and flow trusses in directed networks
• Analysing and controlling the tax evasion dynamics via majority-vote model
• Emergence of scale-free close-knit friendship structure in online social networks
• Model-independent methods for embedding directed networks into Euclidean and hyperbolic spaces
• Ordered community detection in directed networks
• Centrality properties of directed module members in social networks
• Heterogeneous message passing for heterogeneous networks
• Comparing the sensitivity of social networks, web graphs, and random graphs with respect to vertex removal
• A Deep Latent Space Model for Graph Representation Learning
• An iterative spectral algorithm for digraph clustering
• Statistics of remote regions of networks