Distribution of node characteristics in complex networks
Open accessThe DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
Abstract
Our enhanced ability to map the structure of various complex networks is increasingly accompanied by the possibility of independently identifying the functional characteristics of each node. Although this led to the observation that nodes with similar characteristics have a tendency to link to each other, in general we lack the tools to quantify the interplay between node properties and the structure of the underlying network. Here we show that when nodes in a network belong to two distinct classes, two independent parameters are needed to capture the detailed interplay between the network structure and node properties. We find that the network structure significantly limits the values of these parameters, requiring a phase diagram to uniquely characterize the configurations available to the system. The phase diagram shows a remarkable independence from the network size, a finding that, together with a proposed heuristic algorithm, allows us to determine its shape even for large networks. To test the usefulness of the developed methods, we apply them to biological and socioeconomic systems, finding that protein functions and mobile phone usage occupy distinct regions of the phase diagram, indicating that the proposed parameters have a strong discriminating power.
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
Complex networks: structure and dynamics
BOCCALETTI, S., LATORA, V, MORENO, Y., CHAVEZ, M., & HWANG, D. (2006) · Physics Reports · doi:10.1016/j.physrep.2005.10.009 · Cited by 11,010
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
Self-citationUncovering 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
The Spread of Obesity in a Large Social Network over 32 Years
Christakis, N. A., & Fowler, J. H. (2007) · New England Journal of Medicine · doi:10.1056/nejmsa066082 · Cited by 5,007
The political blogosphere and the 2004 U.S. election: divided they blog
Adamic, L. A., & Glance, N. (2005) · Proceedings of the 3rd international workshop on Link discovery · doi:10.1145/1134271.1134277 · Cited by 2,619
Barabási, A.-L., & Bonabeau, E. (2003) · Scientific American · doi:10.1038/scientificamerican0503-60 · Cited by 2,494
Self-citationDorogovtsev, S. N., & Mendes, J. F. F. (2003) · doi:10.1093/acprof:oso/9780198515906.001.0001 · Cited by 1,563
Cited by
Distinguishing influence-based contagion from homophily-driven diffusion in dynamic networks
Aral, S., Muchnik, L., & Sundararajan, A. (2009) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0908800106 · Cited by 1,207
A k-shell decomposition method for weighted networks
Garas, A., Schweitzer, F., & Havlin, S. (2012) · New Journal of Physics · doi:10.1088/1367-2630/14/8/083030 · Cited by 280
Protein Contact Networks: An Emerging Paradigm in Chemistry
Di Paola, L., De Ruvo, M., Paci, P., Santoni, D., & Giuliani, A. (2013) · Chemical Reviews · doi:10.1021/cr3002356 · Cited by 269
Model of genetic variation in human social networks
Fowler, J. H., Dawes, C. T., & Christakis, N. A. (2009) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0806746106 · Cited by 245
Gotcha! Network-based fraud detection for social security fraud
Van Vlasselaer, V., Eliassi-Rad, T., Akoglu, L., Snoeck, M., & Baesens, B. (2017) · Management Science · doi:10.1287/mnsc.2016.2489 · Cited by 164
“A feasibility study (Park and Barabási 2007, Easley and Kleinberg 2010) on the social security data set indicates that fraudulent companies are indeed significantly more connected to other fraudulent companies (p-value ≤ 0.02 for t 0 − t 3 using a one-tailed proportion test).”
MethodInfluential
Metadata
- Authors
- Park, J., & Barabási, A.-L.
- Venue
- Proceedings of the National Academy of Sciences
- Published
- 2007-11-13
- Volume
- 104
- Issue
- 46
- Pages
- 17916-17920
- ISSN
- 0027-8424 (ISSN-L)
- 1091-6490
- OpenAlex
- W2058077802
- Cited by
- 151
- References
- 7
- FWCI
- 4.94
- Type
- journal article
- Language
- en
- Open access
- bronze
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.