The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Geometric fractal growth model for scale-free networks
Open accessAbstract
We introduce a deterministic model for scale-free networks, whose degree distribution follows a power law with the exponent gamma. At each time step, each vertex generates its offspring, whose number is proportional to the degree of that vertex with proportionality constant m-1 (m>1). We consider the two cases: First, each offspring is connected to its parent vertex only, forming a tree structure. Second, it is connected to both its parent and grandparent vertices, forming a loop structure. We find that both models exhibit power-law behaviors in their degree distributions with the exponent gamma = 1+ln(2m-1)/ln m. Thus, by tuning m, the degree exponent can be adjusted in the range, 2 < gamma < 3. We also solve analytically a mean shortest-path distance d between two vertices for the tree structure, showing the small-world behavior, that is, d approximately ln N/ln K macro, where N is system size, and k macro is the mean degree. Finally, we consider the case that the number of offspring is the same for all vertices, and find that the degree distribution exhibits an exponential-decay behavior.
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
Broder, A., Kumar, R., Maghoul, F., Raghavan, P., Rajagopalan, S., Stata, R., Tomkins, A., & Wiener, J. (2000) · Computer Networks · doi:10.1016/s1389-1286(00)00083-9 · Cited by 2,810
Simple Lessons from Complexity
Goldenfeld, N., & Kadanoff, L. P. (1999) · Science · doi:10.1126/science.284.5411.87 · Cited by 554
Cited by
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
Critical phenomena in complex networks
Dorogovtsev, S. N., Goltsev, A. V., & Mendes, J. F. F. (2008) · Reviews of Modern Physics · doi:10.1103/revmodphys.80.1275 · Cited by 2,220
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
Random walks and diffusion on networks
Masuda, N., Porter, M. A., & Lambiotte, R. (2017) · Physics Reports · doi:10.1016/j.physrep.2017.07.007 · Cited by 657
Origins of fractality in the growth of complex networks
Song, C., Havlin, S., & Makse, H. A. (2006) · Nature Physics · doi:10.1038/nphys266 · Cited by 613
Metadata
- Authors
- Jung, S., Kim, S., & Kahng, B.
- Venue
- Physical Review E
- Publisher
- American Physical Society (APS)
- Published
- 2002-04-15
- Volume
- 65
- Issue
- 5
- Pages
- 056101-056101
- ISSN
- 1063-651X (ISSN-L)
- 1095-3787
- OpenAlex
- W2055421498
- Cited by
- 181
- References
- 2
- FWCI
- 5.22
- 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.