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
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. 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
Random graphs with arbitrary degree distributions and their applications
Newman, M. E. J., Strogatz, S. H., & Watts, D. J. (2001) · Physical Review E · doi:10.1103/physreve.64.026118 · Cited by 3,648
Newman, M. E. J. (2003) · Physical Review E · doi:10.1103/physreve.67.026126 · Cited by 3,087
Scientific collaboration networks. II. Shortest paths, weighted networks, and centrality
Newman, M. E. J. (2001) · Physical Review E · doi:10.1103/physreve.64.016132 · Cited by 2,613
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
Newman, M. E. J. (2004) · Physical Review E · doi:10.1103/physreve.70.056131 · Cited by 2,476
Models and Methods in Social Network Analysis
(2005) · Cambridge University Press eBooks · doi:10.1017/cbo9780511811395 · Cited by 2,441
A critical point for random graphs with a given degree sequence
Molloy, M., & Reed, B. (1995) · Random Structures & Algorithms · doi:10.1002/rsa.3240060204 · Cited by 2,351
Scientific collaboration networks. I. Network construction and fundamental results
Newman, M. E. J. (2001) · Physical Review E · doi:10.1103/physreve.64.016131 · Cited by 2,076
Collaboration and Creativity: The Small World Problem
Uzzi, B., & Spiro, J. (2005) · American Journal of Sociology · doi:10.1086/432782 · Cited by 1,885 · cited 2×
“…et al., 2004; Young-Choon, 1998), recommendation networks ( e.g. , Perugini et al., 2003), theatre performances ( e.g. , Agneessens et al., 2004; Uzzi and Spiro, 2005), politic activism ( e.g. , Boudourides and Botetzagias, 2004), student course registrations ( e.g. , Holme et al., 2004), word…”
BackgroundMethodThe small-world phenomenon: an algorithmic perspective
Kleinberg, J. (2000) · Proceedings of the thirty-second annual ACM symposium on Theory of computing · doi:10.1145/335305.335325 · Cited by 1,882
Kleinberg, J. M. (2000) · Nature · doi:10.1038/35022643 · Cited by 1,737
Co-clustering documents and words using bipartite spectral graph partitioning
Dhillon, I. S. (2001) · Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/502512.502550 · Cited by 1,697
The Duality of Persons and Groups
Breiger, R. L. (1974) · Social Forces · doi:10.1093/sf/53.2.181 · Cited by 1,360
Random graph models of social networks
Newman, M. E. J., Watts, D. J., & Strogatz, S. H. (2002) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.012582999 · Cited by 1,326
Network analysis of 2-mode data
Borgatti, S. P., & Everett, M. G. (1997) · Social Networks · doi:10.1016/s0378-8733(96)00301-2 · Cited by 1,128
The 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
The asymptotic number of labeled graphs with given degree sequences
Bender, E. A., & Canfield, E. R. (1978) · Journal of Combinatorial Theory, Series A · doi:10.1016/0097-3165(78)90059-6 · Cited by 970
Handbook of Graphs and Networks: From the Genome to the Internet
(2002) · Wiley eBooks · doi:10.1002/3527602755 · Cited by 949
Recent developments in exponential random graph (p*) models for social networks
Robins, G., Snijders, T., Wang, P., Handcock, M., & Pattison, P. (2007) · Social Networks · doi:10.1016/j.socnet.2006.08.003 · Cited by 832
The Size of the Giant Component of a Random Graph with a Given Degree Sequence
MOLLOY, M., & REED, B. (1998) · Combinatorics, Probability and Computing · doi:10.1017/s0963548398003526 · Cited by 831
Selected Studies of the Principle of Relative Frequency in Language
Kingsley Zipf, G. (1932) · Harvard University Press eBooks · doi:10.4159/harvard.9780674434929 · Cited by 686
(2005) · Lecture Notes in Computer Science · doi:10.1007/b106453 · Cited by 636
Centrality in affiliation networks
Faust, K. (1997) · Social Networks · doi:10.1016/s0378-8733(96)00300-0 · Cited by 535
Who Is the Best Connected Scientist?A Study of Scientific Coauthorship Networks
Newman, M. E. J. (2004) · Lecture Notes in Physics · doi:10.1007/978-3-540-44485-5_16 · Cited by 379
Characterization and modeling of weighted networks
Barthélemy, M., Barrat, A., Pastor-Satorras, R., & Vespignani, A. (2005) · Physica A: Statistical Mechanics and its Applications · doi:10.1016/j.physa.2004.08.047 · Cited by 371
Technique for Analyzing Overlapping Memberships
Bonacich, P. (1972) · Sociological Methodology · doi:10.2307/270732 · Cited by 354
Small Worlds Among Interlocking Directors: Network Structure and Distance in Bipartite Graphs
Robins, G., & Alexander, M. (2004) · Computational & Mathematical Organization Theory · doi:10.1023/b:cmot.0000032580.12184.c0 · Cited by 344
Bipartite graphs as models of complex networks
Guillaume, J.-L., & Latapy, M. (2006) · Physica A: Statistical Mechanics and its Applications · doi:10.1016/j.physa.2006.04.047 · Cited by 282
Self-citationBipartite structure of all complex networks
Guillaume, J.-L., & Latapy, M. (2004) · Information Processing Letters · doi:10.1016/j.ipl.2004.03.007 · Cited by 255
Self-citationDynamic Social Network Modeling and Analysis: Workshop Summary and Papers
(2003) · National Academies Press eBooks · doi:10.17226/10735 · Cited by 252
Cycles and clustering in bipartite networks
Lind, P. G., González, M. C., & Herrmann, H. J. (2005) · Physical Review E · doi:10.1103/physreve.72.056127 · Cited by 237
Efficient and Simple Generation of Random Simple Connected Graphs with Prescribed Degree Sequence
Viger, F., & Latapy, M. (2005) · Lecture Notes in Computer Science · doi:10.1007/11533719_45 · Cited by 228
Self-citationThe scale-free topology of market investments
Garlaschelli, D., Battiston, S., Castri, M., Servedio, V. D. P., & Caldarelli, G. (2005) · Physica A: Statistical Mechanics and its Applications · doi:10.1016/j.physa.2004.11.040 · Cited by 227
Generalized blockmodeling of two-mode network data
Doreian, P., Batagelj, V., & Ferligoj, A. (2004) · Social Networks · doi:10.1016/j.socnet.2004.01.002 · Cited by 199
Statistical properties of corporate board and director networks
Battiston, S., & Catanzaro, M. (2004) · The European Physical Journal B - Condensed Matter · doi:10.1140/epjb/e2004-00127-8 · Cited by 171
Clustering in Peer-to-Peer File Sharing Workloads
Le Fessant, F., Handurukande, S., Kermarrec, A. M., & Massoulié, L. (2005) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-30183-7_21 · Cited by 165
Emergent Properties of a New Financial Market: American Venture Capital Syndication, 1960–2005
Kogut, B., Urso, P., & Walker, G. (2007) · Management Science · doi:10.1287/mnsc.1060.0620 · Cited by 158
Korean university life in a network perspective: Dynamics of a large affiliation network
Holme, P., Park, S. M., Kim, B. J., & Edling, C. (2006) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2006.04.066 · Cited by 154
Finding Social Groups: A Meta-Analysis of the Southern Women Data
Freeman, L. C. (2003) · Cited by 123
8. Logit Models for Affiliation Networks
Skvoretz, J. V., & Faust, K. (1999) · Sociological Methodology · doi:10.1111/0081-1750.00066 · Cited by 109
Complex network study of Brazilian soccer players
Onody, R. N., & de Castro, P. A. (2004) · Physical Review E · doi:10.1103/physreve.70.037103 · Cited by 104
Regular blockmodels of multiway, multimode matrices
Borgatti, S. P., & Everett, M. G. (1992) · Social Networks · doi:10.1016/0378-8733(92)90015-y · Cited by 97
Exploiting semantic proximity in peer-to-peer content searching
Voulgaris, S., Kermarrec, A.-M., Massoulié, L., & van Steen, M. R. (2004) · IEEE Workshop on Future Trends of Distributed Computing Systems (FTDCS) · doi:10.1109/ftdcs.2004.1316622 · Cited by 92
Human sexual contact network as a bipartite graph
Ergün, G. (2002) · Physica A Statistical Mechanics and its Applications · doi:10.1016/s0378-4371(02)00628-3 · Cited by 58
Bipartite producer–consumer networks and the size distribution of firms
Dahui, W., Li, Z., & Di, Z. (2005) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2005.08.006 · Cited by 54
Faust, K., Willert, K. E., Rowlee, D. D., et al. (2002) · Social Networks · doi:10.1016/s0378-8733(02)00005-9 · Cited by 50
Correspondence analysis of two-mode network data
Roberts, J. M. (2000) · Social Networks · doi:10.1016/s0378-8733(00)00017-4 · Cited by 40
Epistemic Communities: Description and Hierarchic Categorization
Roth, C., & Bourgine, P. (2005) · Mathematical Population Studies · doi:10.1080/08898480590931404 · Cited by 33
Epistemic communities: Description and hierarchic categorizationPreprint
Roth, C., & Bourgine, P. (n.d.) · Cited by 32
The Small World Network Structure of Boards of DirectorsPreprint
Conyon, M. J., & Muldoon, M. R. (2004) · SSRN Electronic Journal · doi:10.2139/ssrn.546963 · Cited by 25
Choices of Theatre Events: p* Models for Affiliation Networks with Attributes
Agneessens, F., Roose, H., & Waege, H. (2002) · Ghent University Academic Bibliography (Ghent University) · Cited by 20
Construction of bipartite and unipartite weighted networks from collections of journal papersPreprint
Morris, S. A., & Yen, G. G. (2005) · arXiv (Cornell University) · doi:10.48550/arxiv.physics/0503061 · Cited by 14
A Connection-Centric Survey of Recommender Systems ResearchPreprint
Perugini, S., Gonçalves, M. A., & Fox, E. A. (2002) · arXiv (Cornell University) · doi:10.48550/arxiv.cs/0205059 · Cited by 12
Large neural networks for the resolution of lexical ambiguity
Véronis, J., & Ide, N. (1995) · Cambridge University Press eBooks · doi:10.1017/cbo9780511527227.016 · Cited by 11
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
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.