Alignment and integration of complex networks by hypergraph-based spectral clustering
Open accessThe DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
Abstract
Complex networks possess a rich, multiscale structure reflecting the dynamical and functional organization of the systems they model. Often there is a need to analyze multiple networks simultaneously, to model a system by more than one type of interaction, or to go beyond simple pairwise interactions, but currently there is a lack of theoretical and computational methods to address these problems. Here we introduce a framework for clustering and community detection in such systems using hypergraph representations. Our main result is a generalization of the Perron-Frobenius theorem from which we derive spectral clustering algorithms for directed and undirected hypergraphs. We illustrate our approach with applications for local and global alignment of protein-protein interaction networks between multiple species, for tripartite community detection in folksonomies, and for detecting clusters of overlapping regulatory pathways in directed networks.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Modularity and community structure in networks
Newman, M. E. J. (2006) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0601602103 · Cited by 12,256
Fortunato, S. (2010) · Physics Reports · doi:10.1016/j.physrep.2009.11.002 · Cited by 11,293 · cited 1×
“Although countless measures have been designed to de-fine clusters in a graph [5–7], perhaps the simplest definition is that a cluster is a subset of vertices with a high number of edges between them, relative to its size.”
BackgroundNetwork biology: understanding the cell's functional organization
Barabási, A.-L., & Oltvai, Z. N. (2004) · Nature Reviews Genetics · doi:10.1038/nrg1272 · Cited by 7,903 · cited 1×
“Protein-protein interaction networks represent binary, undirected associations be-tween proteins and they are, at present, the most extensively characterized molecular interaction networks in biology [11, 44].”
BackgroundNetwork motifs: simple building blocks of complex networks.
Milo, R., Shen-Orr, S., Itzkovitz, S., Kashtan, N., Chklovskii, D., & Alon, U. (2002) · Science · doi:10.1126/science.298.5594.824 · Cited by 7,368 · cited 1×
“…path length and clustering coefficient which are markedly different from those of regular lattices or uniformly distributed Erd˝os-R´enyi random graphs [1, 2], while at the microscopic scale, they contain network motifs, small subgraphs occurring sig-nificantly more often than expected by chance [3].”
BackgroundUncovering the overlapping community structure of complex networks in nature and society
Palla, G., Derényi, I., Farkas, I., & Vicsek, T. (2005) · Nature · doi:10.1038/nature03607 · Cited by 5,373 · cited 2×
“[35] G Palla, I Derényi, I Farkas, and T Vicsek, “Uncovering the overlapping community structure of complex networks in nature and society,” Nature 435, 814–818 (2005).”
BackgroundBioGRID: a general repository for interaction datasets
Stark, C. (2006) · Nucleic Acids Research · doi:10.1093/nar/gkj109 · Cited by 3,960 · cited 1×
“We obtained physical protein-protein interactions (PPI) for yeast from the BioGRID [58] database and physical and functional PPIs for human from the Bi-oGRID and STRING [59] databases.”
MethodResolution limit in community detection
Fortunato, S., & Barthélemy, M. (2007) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0605965104 · Cited by 3,024
An Introduction to Systems Biology: Design Principles of Biological Circuits
Alon, U. (2006) · doi:10.1201/9781420011432 · Cited by 2,825
Community Structure in Time-Dependent, Multiscale, and Multiplex Networks
Mucha, P. J., Richardson, T., Macon, K., Porter, M. A., & Onnela, J.-P. (2010) · Science · doi:10.1126/science.1184819 · Cited by 2,123 · cited 1×
“Another example for k = 3 concerns the analysis and clustering of multiply linked data [31, 32] or multislice networks [33].”
BackgroundDiscovering regulatory and signalling circuits in molecular interaction networks
Ideker, T., Ozier, O., Schwikowski, B., & Siegel, A. F. (2002) · Bioinformatics · doi:10.1093/bioinformatics/18.suppl_1.s233 · Cited by 1,197
Performance of modularity maximization in practical contexts
Good, B. H., de Montjoye, Y.-A., & Clauset, A. (2010) · Physical Review E · doi:10.1103/physreve.81.046106 · Cited by 937 · cited 1×
“(10)) does not suffer from a resolution limit problem where cluster size grows with network size irrespective of the presence of ‘natural’ clusters at smaller scales [36, 37].”
Background
Cited by
Kivela, M., Arenas, A., Barthelemy, M., Gleeson, J. P., Moreno, Y., & Porter, M. A. (2014) · Journal of Complex Networks · doi:10.1093/comnet/cnu016 · Cited by 3,235
The structure and dynamics of multilayer networks
Boccaletti, S., Bianconi, G., Criado, R., del Genio, C. I., Gómez-Gardeñes, J., Romance, M., Sendiña-Nadal, I., Wang, Z., & Zanin, M. (2014) · Physics Reports · doi:10.1016/j.physrep.2014.07.001 · Cited by 3,125
“le interaction networkscanbeextractedfromdifferentorganisms,theobjectivebeingtheidentificationofmodulesthat have been preserved across different evolution steps. Following this line of research, in Ref. [458] Authors foundcommonmodulesbymeansofaspectralclusteringalgorithmextendingthePerron-Frobeniustheorem. Amongtheresul…”
BackgroundMultilayer Networks: Structure and Function
Bianconi, G. (2018) · doi:10.1093/oso/9780198753919.001.0001 · Cited by 334
Eigenvector centrality of nodes in multiplex networks
Solá, L., Romance, M., Criado, R., Flores, J., García del Amo, A., & Boccaletti, S. (2013) · Chaos: An Interdisciplinary Journal of Nonlinear Science · doi:10.1063/1.4818544 · Cited by 321
Integrative multi-omics module network inference with lemon-tree
Bonnet, E., Calzone, L., & Michoel, T. (2015) · PLoS Computational Biology · doi:10.1371/journal.pcbi.1003983 · Cited by 98
Self-citation
Metadata
- Authors
- Michoel, T., & Nachtergaele, B.
- Venue
- Physical Review E
- Publisher
- American Physical Society (APS)
- Published
- 2012-11-26
- Volume
- 86
- Issue
- 5
- Pages
- 056111-056111
- ISSN
- 1539-3755 (ISSN-L)
- 1550-2376
- OpenAlex
- W2140360868
- Cited by
- 102
- References
- 11
- FWCI
- 3.65
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.