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
The Large-Scale Organization of Metabolic Networks
Jeong, H., Tombor, B., Albert, R., Oltvai, Z. N., & Barabási, A.-L. (2000) · Nature · doi:10.1038/35036627 · Cited by 4,972
Diameter of the World-Wide Web
Albert, R., Jeong, H., & Barabási, A.-L. (1999) · Nature · doi:10.1038/43601 · Cited by 4,260
The architecture of complex weighted networks
Barrat, A., Barthélemy, M., Pastor-Satorras, R., & Vespignani, A. (2004) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0400087101 · Cited by 4,218
Dorogovtsev, S. N., & Mendes, J. F. F. (2002) · Advances in Physics · doi:10.1080/00018730110112519 · Cited by 3,171
(1973) · North-Holland Mathematical Library · doi:10.1016/s0924-6509(09)x7013-3 · Cited by 2,937
On power-law relationships of the Internet topology
Faloutsos, M., Faloutsos, P., & Faloutsos, C. (1999) · ACM SIGCOMM Computer Communication Review · doi:10.1145/316194.316229 · Cited by 2,613
Defining and identifying communities in networks
Radicchi, F., Castellano, C., Cecconi, F., Loreto, V., & Parisi, D. (2004) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0400054101 · Cited by 2,450
Self-similar community structure in a network of human interactions
Guimerà, R., Danon, L., Díaz-Guilera, A., Giralt, F., & Arenas, A. (2003) · Physical Review E · doi:10.1103/physreve.68.065103 · Cited by 1,515
Simple rules yield complex food webs
Williams, R. J., & Martinez, N. D. (2000) · Nature · doi:10.1038/35004572 · Cited by 1,487
Superfamilies of Evolved and Designed Networks
Milo, R., Itzkovitz, S., Kashtan, N., Levitt, R., Shen-Orr, S., Ayzenshtat, I., Sheffer, M., & Alon, U. (2004) · Science · doi:10.1126/science.1089167 · Cited by 1,412
The web of human sexual contacts
Liljeros, F., Edling, C., Amaral, L. A. N., Stanley, E., & Åberg, Y. (2001) · RePEc: Research Papers in Economics · Cited by 1,389
The web of human sexual contacts
Liljeros, F., Edling, C. R., Amaral, L. A. N., Stanley, H. E., & Åberg, Y. (2001) · Nature · doi:10.1038/35082140 · Cited by 1,318
Subgraph centrality in complex networks
Estrada, E., & Rodríguez-Velázquez, J. A. (2005) · Physical Review E · doi:10.1103/physreve.71.056103 · Cited by 1,260
Self-citationThe small world of human language
Cancho, R. F. I., & Solé, R. V. (2001) · Proceedings of the Royal Society of London. Series B: Biological Sciences · doi:10.1098/rspb.2001.1800 · Cited by 1,046
Welsh, D. J. A. (1974) · Bulletin of the London Mathematical Society · doi:10.1112/blms/6.2.218b · Cited by 1,046
Handbook of Graphs and Networks: From the Genome to the Internet
(2002) · Wiley eBooks · doi:10.1002/3527602755 · Cited by 949
From the Cover: The structure of scientific collaboration networks
Newman, M. E. J. (2001) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.021544898 · Cited by 837
The Small World of the American Corporate Elite, 1982-2001
Davis, G. F., Yoo, M., & Baker, W. E. (2003) · Strategic Organization · doi:10.1177/14761270030013002 · Cited by 728
Finger-length ratios and sexual orientation
Williams, T. J., Pepitone, M. E., Christensen, S. E., Cooke, B. M., Huberman, A. D., Breedlove, N. J., Breedlove, T. J., Jordan, C. L., & Breedlove, S. M. (2000) · Nature · doi:10.1038/35006555 · Cited by 581
Global organization of the Wordnet lexicon
Sigman, M., & Cecchi, G. A. (2002) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.022341799 · Cited by 281
Minimal cut sets in biochemical reaction networks
Klamt, S., & Gilles, E. D. (2004) · Bioinformatics · doi:10.1093/bioinformatics/btg395 · Cited by 275
Scale-Free Behavior in Protein Domain Networks
Wuchty, S. (2001) · Molecular Biology and Evolution · doi:10.1093/oxfordjournals.molbev.a003957 · Cited by 262
Network clustering coefficient without degree-correlation biases
Soffer, S. N., & Vázquez, A. (2005) · Physical Review E · doi:10.1103/physreve.71.057101 · Cited by 257
Itzkovitz, S., Milo, R., Kashtan, N., Ziv, G., & Alon, U. (2003) · Physical Review E · doi:10.1103/physreve.68.026127 · Cited by 218
SCHNEEBERGER, A., MERCER, C. H., GREGSON, S. A. J., FERGUSON, N. M., NYAMUKAPA, C. A., ANDERSON, R. M., JOHNSON, A. M., & GARNETT, G. P. (2004) · Sexually Transmitted Diseases · doi:10.1097/00007435-200406000-00012 · Cited by 209
Topological generalizations of network motifs
Kashtan, N., Itzkovitz, S., Milo, R., & Alon, U. (2004) · Physical Review E · doi:10.1103/physreve.70.031909 · Cited by 194
Yodzis, P. (2000) · Ecology · doi:10.1890/0012-9658(2000)081[0261:deifw]2.0.co;2 · Cited by 176
Structure, culture and Simmelian ties in entrepreneurial firms
Krackhardt, D., & Kilduff, M. (2002) · Social Networks · doi:10.1016/s0378-8733(02)00008-4 · Cited by 160
Chemical Reaction Networks: A Graph-Theoretical Approach
Темкин, О. Н., Zeigarnik, A. V., & Bonchev, D. (1996) · Medical Entomology and Zoology · Cited by 150
Clustering of correlated networks
Dorogovtsev, S. N. (2004) · Physical Review E · doi:10.1103/physreve.69.027104 · Cited by 103
Hyper-edges and multidimensional centrality
Bonacich, P., Holdren, A., & Johnston, M. (2004) · Soc. Networks · doi:10.1016/j.socnet.2004.01.001 · Cited by 94
Pathways database system: an integrated system for biological pathways
Krishnamurthy, L., Nadeau, J., Özsoyoğlu, G., Ozsoyoglu, M., Schaeffer, G., Tasan, M., & Xu, W. (2003) · Bioinformatics · doi:10.1093/bioinformatics/btg113 · Cited by 93
Discovering Hidden Groups in Communication Networks
Baumes, J., Goldberg, M., Magdon‐Ismail, M., et al. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-25952-7_28 · Cited by 86
Subgraphs and network motifs in geometric networks
Itzkovitz, S., & Alon, U. S. (2005) · Physical Review E · doi:10.1103/physreve.71.026117 · Cited by 81
Higher order clustering coefficients in Barabási–Albert networks
Fronczak, A., Hołyst, J. A., Jedynak, M., & Sienkiewicz, J. (2002) · Physica A Statistical Mechanics and its Applications · doi:10.1016/s0378-4371(02)01336-5 · Cited by 80
On the Laplacian Spectrum and Walk-regular Hypergraphs
Rodriguez-Velazquez, J. A. (2003) · Linear and Multilinear Algebra · doi:10.1080/0308108031000084374 · Cited by 79
Higher order clustering coefficients in Barabási–Albert networks
Fronczak, A., Hołyst, J. A., Jedynak, M., et al. (n.d.) · RePEc: Research Papers in Economics · Cited by 53
Generic Properties of Chemical Networks: Artificial Chemistry Based on Graph Rewriting
Benkö, G., Flamm, C., & Stadler, P. F. (2003) · Lecture notes in computer science · doi:10.1007/978-3-540-39432-7_2 · Cited by 21
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
Networks beyond pairwise interactions: Structure and dynamics
Battiston, F., Cencetti, G., Iacopini, I., Latora, V., Lucas, M., Patania, A., Young, J.-G., & Petri, G. (2020) · Physics Reports · doi:10.1016/j.physrep.2020.05.004 · Cited by 1,602
Hypergraphs and Cellular Networks
Klamt, S., Haus, U.-U., & Theis, F. (2009) · PLoS Computational Biology · doi:10.1371/journal.pcbi.1000385 · Cited by 480
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
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.