The DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.
Communication in Networks with Hierarchical Branching
Open accessAbstract
We present a simple model of communication in networks with hierarchical branching. We analyze the behavior of the model from the viewpoint of critical systems under different situations. For certain values of the parameters, a continuous phase transition between a sparse and a congested regime is observed and accurately described by an order parameter and the power spectra. At the critical point the behavior of the model is totally independent of the number of hierarchical levels. Also scaling properties are observed when the size of the system varies. The presence of noise in the communication is shown to break the transition. The analytical results are a useful guide to forecasting the main features of real 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
Introduction to Percolation Theory
Stauffer, D., Aharony, A., & Redner, S. (1993) · Physics Today · doi:10.1063/1.2808877 · Cited by 6,666
An introduction to percolation theory
Shante, V. K. S., & Kirkpatrick, S. (1971) · Advances in Physics · doi:10.1080/00018737100101261 · Cited by 2,491
Statistical physics of vehicular traffic and some related systems
Chowdhury, D. (2000) · Physics Reports · doi:10.1016/s0370-1573(99)00117-9 · Cited by 2,298
Axelrod, R. (2011) · Cited by 980
Size and form in efficient transportation networks
Banavar, J. R., Maritan, A., & Rinaldo, A. (1999) · Nature · doi:10.1038/20144 · Cited by 854
The Organization of Decentralized Information Processing
Radner, R. (1993) · Econometrica · doi:10.2307/2951495 · Cited by 699
Phase transition in a computer network traffic model
Ohira, T., & Sawatari, R. (1998) · Physical Review E · doi:10.1103/physreve.58.193 · Cited by 254
Information transfer and phase transitions in a model of internet traffic
Solé, R. V., & Valverde, S. (2001) · Physica A: Statistical Mechanics and its Applications · doi:10.1016/s0378-4371(00)00536-7 · Cited by 190
Critical behaviors and 1/Φ noise in information traffic
Takayasu, M., Takayasu, H., & Sato, T. (1996) · Physica A Statistical Mechanics and its Applications · doi:10.1016/s0378-4371(96)00189-6 · Cited by 131
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
Dorogovtsev, S. N., & Mendes, J. F. F. (2002) · Advances in Physics · doi:10.1080/00018730110112519 · Cited by 3,171
The structure and dynamics of multilayer networks
Boccaletti, S., Bianconi, G., Criado, R., del Genio, C. I., Gómez-Gardeñes, J., Romance, M., Sendiña-Nadal, I., Wang, Z., & Zanin, M. (2014) · Physics Reports · doi:10.1016/j.physrep.2014.07.001 · Cited by 3,125
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
Watts, D. J. (2004) · Annual Review of Sociology · doi:10.1146/annurev.soc.30.020404.104342 · Cited by 1,163
Modelling dynamical processes in complex socio-technical systems
Vespignani, A. (2012) · Nature Physics · doi:10.1038/nphys2160 · Cited by 652
Efficient routing on complex networks
Yan, G., Zhou, T., Hu, B., Fu, Z.-Q., & Wang, B.-H. (2006) · Physical Review E · doi:10.1103/physreve.73.046108 · Cited by 631
Optimal Network Topologies for Local Search with Congestion
Guimerà, R., Díaz-Guilera, A., Vega-Redondo, F., Cabrales, A., & Arenas, A. (2002) · Physical Review Letters · doi:10.1103/physrevlett.89.248701 · Cited by 605
Self-citationOnset of traffic congestion in complex networks
Zhao, L., Lai, Y.-C., Park, K., & Ye, N. (2005) · Physical Review E · doi:10.1103/physreve.71.026125 · Cited by 457
The complexity and robustness of metro networks
Derrible, S., & Kennedy, C. (2010) · Physica A: Statistical Mechanics and its Applications · doi:10.1016/j.physa.2010.04.008 · Cited by 438
The complex structure of hunter–gatherer social networks
Hamilton, M. J., Milne, B. T., Walker, R. S., Burger, O., & Brown, J. H. (2007) · Proceedings of the Royal Society B: Biological Sciences · doi:10.1098/rspb.2007.0564 · Cited by 386
Traffic dynamics based on local routing protocol on a scale-free network
Wang, W.-X., Wang, B.-H., Yin, C.-Y., Xie, Y.-B., & Zhou, T. (2006) · Physical Review E · doi:10.1103/physreve.73.026111 · Cited by 382
Multilayer Networks: Structure and Function
Bianconi, G. (2018) · doi:10.1093/oso/9780198753919.001.0001 · Cited by 334
Attack vulnerability of scale-free networks due to cascading breakdown
Zhao, L., Park, K., & Lai, Y.-C. (2004) · Physical Review E · doi:10.1103/physreve.70.035101 · Cited by 311
Data based identification and prediction of nonlinear and complex dynamical systems
Wang, W.-X., Lai, Y.-C., & Grebogi, C. (2016) · Physics Reports · doi:10.1016/j.physrep.2016.06.004 · Cited by 299
Tadić, B., Thurner, S., & Rodgers, G. J. (2004) · Physical Review E · doi:10.1103/physreve.69.036102 · Cited by 259
Exploring the Morphospace of Communication Efficiency in Complex Networks
Goñi, J., Avena-Koenigsberger, A., Velez de Mendizabal, N., van den Heuvel, M. P., Betzel, R. F., & Sporns, O. (2013) · PLoS ONE · doi:10.1371/journal.pone.0058070 · Cited by 158
On the origins of hierarchy in complex networks
Corominas-Murtra, B., Goñi, J., Solé, R. V., & Rodríguez-Caso, C. (2013) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1300832110 · Cited by 160
Communication and optimal hierarchical networks
Guimerà, R., Arenas, A., & Dı́az-Guilera, A. (2001) · Physica A: Statistical Mechanics and its Applications · doi:10.1016/s0378-4371(01)00302-8 · Cited by 44
Self-citation
Metadata
- Authors
- Arenas, A., Díaz-Guilera, A., & Guimerà, R.
- Venue
- Physical Review Letters
- Publisher
- American Physical Society (APS)
- Published
- 2001-04-02
- Volume
- 86
- Issue
- 14
- Pages
- 3196-3199
- ISSN
- 0031-9007 (ISSN-L)
- 1079-7114
- OpenAlex
- W2107358961
- Cited by
- 449
- References
- 9
- FWCI
- 4.18
- 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.