The DOI matches its Crossref record; 64 of the 64 references it cites were found in a registry or an index.
Basic notions for the analysis of large two-mode networks
Open accessAbstract
Many large real-world networks actually have a two-mode nature: their nodes may be separated into two classes, the links being between nodes of different classes only. Despite this, and despite the fact that many ad hoc tools have been designed for the study of special cases, very few exist to analyse (describe, extract relevant information) such networks in a systematic way. We propose here an extension of the most basic notions used nowadays to analyse large one-mode networks (the classical case) to the two-mode case. To achieve this, we introduce a set of simple statistics, which we discuss by comparing their values on a representative set of real-world networks and on their random versions. This makes it possible to evaluate their relevance in capturing properties of interest in two-mode 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
Collective dynamics of ‘small-world’ networks
Watts, D. J., & Strogatz, S. H. (1998) · Nature · doi:10.1038/30918 · Cited by 43,060
Emergence of Scaling in Random Networks
Barabási, A.-L., & Albert, R. (1999) · Science · doi:10.1126/science.286.5439.509 · Cited by 36,135 · cited 2×
“Another issue which received recently much attention, see for instance Faloutsos et al. (1999) and Barabasi and Albert (1999), is the fact that the degree distribution 3 of most large real-world networks is highly heterogeneous, often well fitted by a power law: p k ∼ k − α for an exponent α…”
BackgroundStatistical 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. S., & Faust, K. (1994) · Cited by 17,993
Bollobás, B. (1985) · Cited by 6,196
Erdős, P., & Rényi, A. (2022) · Publicationes Mathematicae Debrecen · doi:10.5486/pmd.1959.6.3-4.12 · Cited by 5,337
The small-world problem: (400002009-005)
Milgram, S. (1967) · PsycEXTRA Dataset · doi:10.1037/e400002009-005 · Cited by 4,790
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
On power-law relationships of the Internet topology
Faloutsos, M., Faloutsos, P., & Faloutsos, C. (1999) · Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication · doi:10.1145/316188.316229 · Cited by 4,196
Cited by
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
Triadic closure in two-mode networks: Redefining the global and local clustering coefficients
Opsahl, T. (2013) · Social Networks · doi:10.1016/j.socnet.2011.07.001 · Cited by 488
Hypergraphs and Cellular Networks
Klamt, S., Haus, U.-U., & Theis, F. (2009) · PLoS Computational Biology · doi:10.1371/journal.pcbi.1000385 · Cited by 480
BioTIME: A database of biodiversity time series for the Anthropocene
Dornelas, M., Antão, L. H., Moyes, F., Bates, A. E., Magurran, A. E., Adam, D., Akhmetzhanova, A. A., Appeltans, W., Arcos, J. M., Arnold, H., et al. (2018) · Global Ecology and Biogeography · doi:10.1111/geb.12729 · Cited by 431
Social network analysis: An overview
Tabassum, S., Pereira, F. S. F., Fernandes, S., & Gama, J. (2018) · WIREs Data Mining and Knowledge Discovery · doi:10.1002/widm.1256 · Cited by 419
The statistical physics of real-world networks
Cimini, G., Squartini, T., Saracco, F., Garlaschelli, D., Gabrielli, A., & Caldarelli, G. (2019) · Nature Reviews Physics · doi:10.1038/s42254-018-0002-6 · Cited by 378
Exponential random graph models for multilevel networks
Wang, P., Robins, G., Pattison, P., & Lazega, E. (2013) · Social Networks · doi:10.1016/j.socnet.2013.01.004 · Cited by 374
Mining Massive Fine-Grained Behavior Data to Improve Predictive Analytics1
Martens, D., Provost, F., Clark, J., & de Fortuny, E. J. (2016) · MIS Quarterly · doi:10.25300/misq/2016/40.4.04 · Cited by 140
“In bigraphs, sometimes also referred to as affiliation or two-mode networks (Borgatti and Everett 1997; Breiger 1974; Latapy et al. 2008), there are two types of nodes with edges only between nodes of different types.”
BackgroundAdverse drug events: database construction and in silico prediction
Cheng, F., Li, W., Wang, X., Zhou, Y., Wu, Z., Shen, J., & Tang, Y. (2013) · Journal of Chemical Information and Modeling · doi:10.1021/ci4000079 · Cited by 124
Hot Off the Wiki: Structures and Dynamics of Wikipedia’s Coverage of Breaking News Events
Keegan, B., Gergle, D., & Contractor, N. (2013) · American Behavioral Scientist · doi:10.1177/0002764212469367 · Cited by 120
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
Kolli, S., & Khajeheian, D. (2020) · Contemporary Applications of Actor Network Theory · doi:10.1007/978-981-15-7066-7_12 · Cited by 27
'Is' to 'Was': Coordination and Commemoration in Posthumous Activity on Wikipedia Biographies
Keegan, B. C., & Brubaker, J. R. (2015) · Proceedings of the 18th ACM Conference on Computer Supported Cooperative Work & Social Computing · doi:10.1145/2675133.2675238 · Cited by 20
Metadata
- Authors
- Latapy, M., Magnien, C., & Vecchio, N. D.
- Venue
- Social Networks
- Publisher
- Elsevier BV
- Published
- 2008-01
- Volume
- 30
- Issue
- 1
- Pages
- 31-48
- ISSN
- 0378-8733 (ISSN-L)
- OpenAlex
- W2027684023
- Cited by
- 617
- References
- 64
- FWCI
- 4.69
- 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.