The DOI matches its Crossref record; 25 of the 25 references it cites were found in a registry or an index.
Sandpile on Scale-Free Networks
Open accessAbstract
We investigate the avalanche dynamics of the Bak-Tang-Wiesenfeld sandpile model on scale-free (SF) networks, where the threshold height of each node is distributed heterogeneously, given as its own degree. We find that the avalanche size distribution follows a power law with an exponent $\ensuremath{\tau}$. Applying the theory of the multiplicative branching process, we obtain the exponent $\ensuremath{\tau}$ and the dynamic exponent $z$ as a function of the degree exponent $\ensuremath{\gamma}$ of SF networks as $\ensuremath{\tau}=\ensuremath{\gamma}/(\ensuremath{\gamma}\ensuremath{-}1)$ and $z=(\ensuremath{\gamma}\ensuremath{-}1)/(\ensuremath{\gamma}\ensuremath{-}2)$ in the range $2<\ensuremath{\gamma}<3$ and the mean-field values $\ensuremath{\tau}=1.5$ and $z=2.0$ for $\ensuremath{\gamma}>3$, with a logarithmic correction at $\ensuremath{\gamma}=3$. The analytic solution supports our numerical simulation results. We also consider the case of a uniform threshold, finding that the two exponents reduce to the mean-field ones.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
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
Self-organized criticality: An explanation of the 1/f noise
Bak, P., Tang, C., & Wiesenfeld, K. (1987) · Physical Review Letters · doi:10.1103/physrevlett.59.381 · Cited by 7,591
Error and attack tolerance of complex networks
Albert, R., Jeong, H., & Barabási, A.-L. (2000) · Nature · doi:10.1038/35019019 · Cited by 7,534
Error and attack tolerance of complex networksPreprint
Albert, R., Jeong, H., & Barabási, A.-Ĺ. (2000) · Cited by 6,467
Bak, P., Tang, C., & Wiesenfeld, K. (1988) · Physical Review A · doi:10.1103/physreva.38.364 · Cited by 4,713
Dorogovtsev, S. N., & Mendes, J. F. F. (2002) · Advances in Physics · doi:10.1080/00018730110112519 · Cited by 3,171
A simple model of global cascades on random networks
Watts, D. J. (2002) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.082090499 · Cited by 2,673
Network Robustness and Fragility: Percolation on Random Graphs
Callaway, D. S., Newman, M. E. J., Strogatz, S. H., & Watts, D. J. (2000) · Physical Review Letters · doi:10.1103/physrevlett.85.5468 · Cited by 2,480
Resilience of the Internet to Random Breakdowns
Cohen, R., Erez, K., ben-Avraham, D., & Havlin, S. (2000) · Physical Review Letters · doi:10.1103/physrevlett.85.4626 · Cited by 2,391
The Theory of Branching Processes
Harris, T. E. (1963) · Springer eBooks · doi:10.1007/978-3-642-51866-9 · Cited by 2,026
Cascade-based attacks on complex networks
Motter, A. E., & Lai, Y.-C. (2002) · Physical Review E · doi:10.1103/physreve.66.065102 · Cited by 1,929
Universal Behavior of Load Distribution in Scale-Free Networks
Goh, K.-I., Kahng, B., & Kim, D. (2001) · Physical Review Letters · doi:10.1103/physrevlett.87.278701 · Cited by 1,246
Self-citationSelf-organized criticality in a continuous, nonconservative cellular automaton modeling earthquakes
Olami, Z., Feder, H. J. S., & Christensen, K. (1992) · Physical Review Letters · doi:10.1103/physrevlett.68.1244 · Cited by 1,109
Ising model on networks with an arbitrary distribution of connections
Dorogovtsev, S. N., Goltsev, A. V., & Mendes, J. F. F. (2002) · Physical Review E · doi:10.1103/physreve.66.016104 · Cited by 382
Percolation critical exponents in scale-free networks
Cohen, R., ben-Avraham, D., & Havlin, S. (2002) · Physical Review E · doi:10.1103/physreve.66.036113 · Cited by 312
Ferromagnetic ordering in graphs with arbitrary degree distribution
Leone, M., Vázquez, A., Vespignani, A., & Zecchina, R. (2002) · The European Physical Journal B · doi:10.1140/epjb/e2002-00220-0 · Cited by 257
Disturbances in a power transmission system
Sachtjen, M. L., Carreras, B. A., & Lynch, V. E. (2000) · Physical Review E · doi:10.1103/physreve.61.4877 · Cited by 244
Ferromagnetic phase transition in Barabási–Albert networks
Aleksiejuk, A., Hołyst, J. A., & Stauffer, D. (2002) · Physica A: Statistical Mechanics and its Applications · doi:10.1016/s0378-4371(02)00740-9 · Cited by 223
Mean field solution of the Ising model on a Barabási–Albert network
Bianconi, G. (2002) · Physics Letters A · doi:10.1016/s0375-9601(02)01232-x · Cited by 198
Note on the Bose-Einstein Integral Functions
Robinson, J. E. (1951) · Physical Review · doi:10.1103/physrev.83.678 · Cited by 195
Christensen, K., & Olami, Z. (1992) · Physical Review A · doi:10.1103/physreva.46.1829 · Cited by 190
Otter, R. (1949) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177730031 · Cited by 189
Ferromagnetic phase transition in Barabási-Albert networks
Aleksiejuk, A., Hołyst, J. A., & Stauffer, D. (2002) · RePEc: Research Papers in Economics · Cited by 147
Mean-field exponents for self-organized critical phenomena
Alstrøm, P. (1988) · Physical Review A · doi:10.1103/physreva.38.4905 · Cited by 109
Sandpile Dynamics on Random Graphs
Bonabeau, E. W. (1995) · Journal of the Physical Society of Japan · doi:10.1143/jpsj.64.327 · Cited by 54
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
Cascade Control and Defense in Complex Networks
Motter, A. E. (2004) · Physical Review Letters · doi:10.1103/physrevlett.93.098701 · Cited by 776
Robustness and resilience of complex networks
Artime, O., Grassia, M., De Domenico, M., Gleeson, J. P., Makse, H. A., Mangioni, G., Perc, M., & Radicchi, F. (2024) · Nature Reviews Physics · doi:10.1038/s42254-023-00676-y · Cited by 672
Suppressing cascades of load in interdependent networks
Brummitt, C. D., D’Souza, R. M., & Leicht, E. A. (2012) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1110586109 · Cited by 553
Metadata
- Authors
- Goh, K.-I., Lee, D.-S., Kahng, B., & Kim, D.
- Venue
- Physical Review Letters
- Publisher
- American Physical Society (APS)
- Published
- 2003-10-01
- Volume
- 91
- Issue
- 14
- Pages
- 148701-148701
- ISSN
- 0031-9007 (ISSN-L)
- 1079-7114
- OpenAlex
- W2011186254
- Cited by
- 255
- References
- 25
- FWCI
- 10.12
- 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.