The DOI matches its Crossref record; 48 of the 48 references it cites were found in a registry or an index.
Subgraph centrality and clustering in complex hyper-networks
Open accessAbstract
The representation of complex systems as networks is inappropriate for the study of certain problems. We show several examples of social, biological, ecological and technological systems where the use of complex networks gives very limited information about the structure of the system. Consequently, we extend the concepts of subgraph centrality and clustering for complex networks represented by hypergraphs: complex hyper-networks. The first parameter characterizes the node participation in different sub-hypergraphs and the second one characterizes the transitivity in the hyper-network through the proportion of hyper-triangles to paths of length two. Another measure characterizing the formation of triples of mutually adjacent groups in the hyper-network is also introduced. All of these characteristics are studied in three different hyper-networks: a scientific collaboration hyper-network, an ecological competition hyper-network and the hyper-network formed by the American corporate elite in 1999.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Collective dynamics of ‘small-world’ networks
Watts, D. J., & Strogatz, S. H. (1998) · Nature · doi:10.1038/30918 · Cited by 43,060
Statistical mechanics of complex networks
Albert, R., & Barabási, A.-L. (2002) · Reviews of Modern Physics · doi:10.1103/revmodphys.74.47 · Cited by 20,471
The Structure and Function of Complex Networks
Newman, M. E. J. (2003) · SIAM Review · doi:10.1137/s003614450342480 · Cited by 18,719
Social Network Analysis: Methods and Applications
Wasserman, S., & Faust, K. (1994) · doi:10.1017/cbo9780511815478 · Cited by 17,557
Community structure in social and biological networks
Girvan, M., & Newman, M. E. J. (2002) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.122653799 · Cited by 15,502
Graph Theory with Applications
Bondy, J. A., & Murty, U. S. R. (1976) · doi:10.1007/978-1-349-03521-2 · Cited by 9,043
Strogatz, S. H. (2001) · Nature · doi:10.1038/35065725 · Cited by 8,302
Network 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
Network 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
(2017) · The SAGE Encyclopedia of Communication Research Methods · doi:10.4135/9781483381411.n575 · Cited by 6,008
Cited by
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
What are higher-order networks?
Bick, C., Gross, E., Harrington, H. A., & Schaub, M. T. (2023) · SIAM Review · doi:10.1137/21m1414024 · Cited by 420
Higher-order molecular organization as a source of biological function
Gaudelet, T., Malod-Dognin, N., & Pržulj, N. (2018) · Bioinformatics · doi:10.1093/bioinformatics/bty570 · Cited by 46
Metadata
- Authors
- Estrada, E., & Rodríguez-Velázquez, J. A.
- Venue
- Physica A: Statistical Mechanics and its Applications
- Publisher
- Elsevier BV
- Published
- 2006-05
- Volume
- 364
- Pages
- 581-594
- ISSN
- 0378-4371 (ISSN-L)
- OpenAlex
- W2051510684
- Cited by
- 323
- References
- 48
- FWCI
- 2.89
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Subgraph centrality and clustering in complex hyper-networks. https://app.cochat.ai/papers/10.1016/j.physa.2005.12.002
- The paper
- Estrada, E., & Rodríguez-Velázquez, J. A. (2006). Subgraph centrality and clustering in complex hyper-networks. Physica A: Statistical Mechanics and its Applications. https://doi.org/10.1016/j.physa.2005.12.002
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.
