Exact scaling properties of a hierarchical network model
Open accessThe DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Abstract
We report on the exact results for the degree K, the diameter D, the clustering coefficient C, and the betweenness centrality B of a hierarchical network model with a replication factor M. Such quantities are calculated exactly with the help of recursion relations. Using the results, we show that (i). the degree distribution follows a power law P(K) approximately K-gamma with gamma=1+ln M/ln(M-1), (ii). the diameter grows logarithmically as D approximately ln N with the number of nodes N, (iii). the clustering coefficient of each node is inversely proportional to its degree, C proportional, variant 1/K, and the average clustering coefficient is nonzero in the infinite N limit, and (iv). the betweenness centrality distribution follows a power law P(B) approximately B-2. We discuss a classification scheme of scale-free networks into the universality class with the clustering property and the betweenness centrality distribution.
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
Hierarchical Organization of Modularity in Metabolic Networks
Ravasz, E., Somera, A. L., Mongru, D. A., Oltvai, Z. N., & Barabási, A.-L. (2002) · Science · doi:10.1126/science.1073374 · Cited by 4,224
Hierarchical organization in complex networks
Ravasz, E., & Barabási, A.-L. (2003) · Physical Review E · doi:10.1103/physreve.67.026112 · Cited by 2,160
Cited by
Random Walks on Complex Networks
Noh, J. D., & Rieger, H. (2004) · Physical Review Letters · doi:10.1103/physrevlett.92.118701 · Cited by 1,148
Self-citationHigh-dimensional Apollonian networks
Zhang, Z., Comellas, F., Fertin, G., & Rong, L. (2006) · Journal of Physics A: Mathematical and General · doi:10.1088/0305-4470/39/8/003 · Cited by 76
Quantum Google algorithm: Construction and application to complex networks
Paparo, G. D., Müller, M., Comellas, F., & Martin-Delgado, M. A. (2014) · The European Physical Journal Plus · doi:10.1140/epjp/i2014-14150-y · Cited by 17
“The model was generalised in [38] and its study extended in [74].”
Method
Metadata
- Authors
- Noh, J. D.
- Venue
- Physical Review E
- Publisher
- American Physical Society (APS)
- Published
- 2003-04-21
- Volume
- 67
- Issue
- 4
- Pages
- 045103-045103
- ISSN
- 1063-651X (ISSN-L)
- 1095-3787
- OpenAlex
- W2047317860
- Cited by
- 63
- References
- 2
- FWCI
- 3.40
- 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.