Communication and optimal hierarchical networks
Open accessThe DOI matches its Crossref record; 17 of the 17 references it cites were found in a registry or an index.
Abstract
We study a general and simple model for communication processes. In the model, agents in a network (in particular, an organization) interchange information packets following simple rules that take into account the limited capability of the agents to deal with packets and the cost associated with the existence of open communication channels. Due to the limitation in the capability, the network collapses under certain conditions. We focus on when the collapse occurs for hierarchical networks and also on the influence of the flatness or steepness of the structure. We find that the need for hierarchy is related to the existence of costly connections.
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.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“But hierarchy is a polysemous word, involving order, levels, inclusion or control as possible descriptors [21], none of which captures either its complexity or the problem of its measure and origins.”
From On the origins of hierarchy in complex networks (2013) · cites this paper as [21]
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
Collective dynamics of ‘small-world’ networks
Watts, D. J., & Strogatz, S. H. (1998) · Nature · doi:10.1038/30918 · Cited by 43,060
Emergence of Scaling in Random Networks
Barabási, A.-L., & Albert, R. (1999) · Science · doi:10.1126/science.286.5439.509 · Cited by 36,135
Classes of small-world networks
Amaral, L. A. N., Scala, A., Barthélémy, M., & Stanley, H. E. (2000) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.200327197 · Cited by 3,051
The Economy as an Evolving Complex System II
Arthur, W. B. (2018) · CRC Press eBooks · doi:10.1201/9780429496639 · Cited by 2,313
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
Statistical Physics of Vehicular Traffic and Some Related Systems
Chowdhury, D., Santen, L., & Schadschneider, A. (2000) · Cited by 1,823
Hierarchies and the Organization of Knowledge in Production
Garicano, L. (2000) · Journal of Political Economy · doi:10.1086/317671 · Cited by 1,194
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 economy as an evolving complex system
Feichtinger, G. (1991) · Journal of Economic Behavior & Organization · doi:10.1016/0167-2681(91)90037-x · Cited by 750
Cited by
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
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
Watts, D. J. (2004) · Annual Review of Sociology · doi:10.1146/annurev.soc.30.020404.104342 · Cited by 1,163
Robustness of cellular functions
Stelling, J., Sauer, U., Szallasi, Z., Doyle, F. J., & Doyle, J. (2004) · Cell · doi:10.1016/j.cell.2004.09.008 · Cited by 1,049
Onset 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
Metadata
- Authors
- Guimerà, R., Arenas, A., & Dı́az-Guilera, A.
- Affiliations
- Universitat Rovira i Virgili (ES)
- Universitat de Barcelona (ES)
- Corresponding author
- Dı́az-Guilera, A.
- Venue
- Physica A: Statistical Mechanics and its Applications
- Publisher
- Elsevier BV
- Published
- 2001-10
- Volume
- 299
- Issue
- 1-2
- Pages
- 247-252
- ISSN
- 0378-4371 (ISSN-L)
- OpenAlex
- W2158302605
- Cited by
- 44
- References
- 17
- Citations by year
- 2025: 1 · 2023: 1 · 2022: 1 · 2021: 1 · 2020: 2 · 2017: 1 · 2016: 2 · 2015: 1 · 2013: 3
- FWCI
- 1.64
- Type
- journal article
- Language
- en
- Open access
- green
- arxiv.org
- Licence
- www.elsevier.com/tdm/userlicense/1.0/ (tdm)
- Locations
- Physica A Statistical Mechanics and its Applications (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- RePEc: Research Papers in Economics (submittedVersion)
- arXiv (Cornell University)
- Topics
- Physical Sciences › Physics and Astronomy › Statistical and Nonlinear Physics › Complex Network Analysis Techniques
- Social Sciences › Economics, Econometrics and Finance › Economics and Econometrics › Complex Systems and Time Series Analysis
- Physical Sciences › Physics and Astronomy › Statistical and Nonlinear Physics › Complex Systems and Dynamics
- Keywords
- communication networks, hierarchical networks, network collapse, organizational structure, network optimization
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Communication and optimal hierarchical networks. https://app.cochat.ai/papers/10.1016/s0378-4371(01)00302-8
- The paper
- Guimerà, R., Arenas, A., & Dı́az-Guilera, A. (2001). Communication and optimal hierarchical networks. Physica A: Statistical Mechanics and its Applications. https://doi.org/10.1016/s0378-4371(01)00302-8
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.