Higher-order organization of complex networks

@article{Benson2016HigherorderOO,
  title={Higher-order organization of complex networks},
  author={Austin R. Benson and David F. Gleich and Jure Leskovec},
  journal={Science},
  year={2016},
  volume={353},
  pages={163 - 166}
}
Resolving a network of hubs Graphs are a pervasive tool for modeling and analyzing network data throughout the sciences. Benson et al. developed an algorithmic framework for studying how complex networks are organized by higher-order connectivity patterns (see the Perspective by Pržulj and Malod-Dognin). Motifs in transportation networks reveal hubs and geographical elements not readily achievable by other methods. A motif previously suggested as important for neuronal networks is part of a… Expand
Community Detection in Complex Networks via Clique Conductance
TLDR
This paper develops a novel community-detection method based on cliques, i.e., local complete subnetworks, and shows that the proposed method is guaranteed to detect near-optimal clusters in the bipartition case. Expand
Gauss’s law for networks directly reveals community boundaries
TLDR
It is shown that identifying community boundaries rather than communities results in a more accurate decomposition of the network into informative components, which forms the basis of the “Laplacian modularity” quality function for community detection that is applicable to general network types. Expand
Higher-order clustering in networks
TLDR
Higher-order clustering coefficients are introduced that measure the closure probability of higher-order network cliques and provide a more comprehensive view of how the edges of complex networks cluster. Expand
Motif-Preserving Dynamic Local Graph Cut
TLDR
This paper proposes a local graph clustering framework that captures structure-rich subgraphs, taking into consideration the information of high-order structures in temporal networks, and is able to model various user-defined temporal network structures and find clusters with minimum conductance in a polylogarithmic time complexity. Expand
HiSCF: leveraging higher-order structures for clustering analysis in biological networks
TLDR
The promising performance of HiSCF demonstrates that the consideration of higher-order network motifs gains new insight into the analysis of biological networks, such as the identification of overlapping protein complexes and the inference of new signaling pathways, and also reveals the rich higher- order organizational structures presented in biological networks. Expand
Higher-order Clustering in Complex Heterogeneous Networks
TLDR
A framework for higher-order spectral clustering in heterogeneous networks through the notions of typed graphlets and typed-graphlet conductance is proposed and the effectiveness of the framework quantitatively is demonstrated for three important applications including clustering, compression, and link prediction. Expand
The Emergence of Informative Higher Scales in Complex Networks
TLDR
This work derives from first principles a measure known as effective information and describes its behavior in common network models, showing how subgraphs of nodes can be grouped into macro-nodes, reducing the size of a network while increasing its effective information. Expand
Higher-Order Clustering for Heterogeneous Networks via Typed Motifs
Higher-order connectivity patterns such as small induced subgraphs called graphlets (network motifs) are vital to understand the important components (modules/functional units) governing theExpand
COMICS: a community property-based triangle motif clustering scheme
TLDR
Results show that the community property-based triangle motif clustering scheme (COMICS) outperforms others in both runtime and accuracy, and the triangle motif structures can bridge network structures and statistical data in the academic collaboration area. Expand
Simplicial closure and higher-order link prediction
TLDR
It is shown that there is a rich variety of structure in the authors' datasets but datasets from the same system types have consistent patterns of higher-order structure, and it is found that tie strength and edge density are competing positive indicators ofhigher-order organization. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 184 REFERENCES
Overlapping Communities Explain Core–Periphery Organization of Networks
TLDR
It is discovered that communities in social, information, and food web networks have a single central dominant core while communities in protein-protein interaction as well as product copurchasing networks have small overlaps and form many local cores. Expand
Clustering and Community Detection in Directed Networks: A Survey
TLDR
An in-depth comparative review of the methods presented so far for clustering directed networks along with the relevant necessary methodological background and also related applications is offered. Expand
Maps of random walks on complex networks reveal community structure
TLDR
An information theoretic approach is introduced that reveals community structure in weighted and directed networks of large-scale biological and social systems and reveals a directional pattern of citation from the applied fields to the basic sciences. Expand
Revealing the Hidden Language of Complex Networks
TLDR
This work discovers that the interaction between a small number of roles, played by nodes in a network, can characterize a network's structure and also provide a clear real-world interpretation, and develops a framework for analysing and comparing networks, which outperforms all existing ones. Expand
Community Structure in Large Networks: Natural Cluster Sizes and the Absence of Large Well-Defined Clusters
TLDR
This paper employs approximation algorithms for the graph-partitioning problem to characterize as a function of size the statistical and structural properties of partitions of graphs that could plausibly be interpreted as communities, and defines the network community profile plot, which characterizes the "best" possible community—according to the conductance measure—over a wide range of size scales. Expand
Enrichment and aggregation of topological motifs are independent organizational principles of integrated interaction networks.
TLDR
This work introduces a novel method for assessing the statistical significance of network motif aggregation and for identifying clusters of overlapping network motifs and identified novel functional network themes for a set of motifs which are not enriched yet aggregate significantly and challenges the conventional view that network motif enrichment is the most basic organizational principle of complex networks. Expand
Network motifs: simple building blocks of complex networks.
TLDR
Network motifs, patterns of interconnections occurring in complex networks at numbers that are significantly higher than those in randomized networks, are defined and may define universal classes of networks. Expand
Efficient Detection of Network Motifs
  • S. Wernicke
  • Computer Science, Medicine
  • IEEE/ACM Transactions on Computational Biology and Bioinformatics
  • 2006
TLDR
Experiments on a testbed of biological networks show the new algorithms to be orders of magnitude faster than previous approaches, allowing for the detection of larger motifs in bigger networks than previously possible and thus facilitating deeper insight into the field. Expand
Detecting communities of triangles in complex networks using spectral optimization
TLDR
The results show that the information reported by the analysis of modules of triangles complements the information of the classical modularity analysis. Expand
Modeling interactome: scale-free or geometric?
TLDR
It is shown that the structure of PPI networks is better modeled by a geometric random graph than by a scale-free model, and a random geometric model provides a much more accurate model of the PPI data. Expand
...
1
2
3
4
5
...