The DOI matches its Crossref record; 39 of the 39 references it cites were found in a registry or an index.
Statistical analysis of 22 public transport networks in Poland
Open accessAbstract
Public transport systems in 22 Polish cities have been analyzed. The sizes of these networks range from N = 152 to 2881. Depending on the assumed definition of network topology, the degree distribution can follow a power law or can be described by an exponential function. Distributions of path lengths in all considered networks are given by asymmetric, unimodal functions. Clustering, assortativity, and betweenness are studied. All considered networks exhibit small-world behavior and are hierarchically organized. A transition between dissortative small networks N approximately < or = 500 and assortative large networks N approximately > or = 500 is observed.
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
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
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
The Structure and Function of Complex Networks
Newman, M. E. J. (2003) · SIAM Review · doi:10.1137/s003614450342480 · Cited by 18,719
A Set of Measures of Centrality Based on Betweenness
Freeman, L. C. (1977) · Sociometry · doi:10.2307/3033543 · Cited by 10,295
Strogatz, S. H. (2001) · Nature · doi:10.1038/35065725 · Cited by 8,302
Efficient behavior of small-world networks
Latora, V., & Marchiori, M. (2001) · Physical Review Letters · doi:10.1103/physrevlett.87.198701 · Cited by 5,119
Assortative Mixing in Networks
Newman, M. E. J. (2002) · Physical Review Letters · doi:10.1103/physrevlett.89.208701 · Cited by 4,988
A faster algorithm for betweenness centrality*
Brandes, U. (2001) · The Journal of Mathematical Sociology · doi:10.1080/0022250x.2001.9990249 · Cited by 4,936
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
The architecture of complex weighted networks
Barrat, A., Barthélemy, M., Pastor-Satorras, R., & Vespignani, A. (2004) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0400087101 · Cited by 4,218
Dorogovtsev, S. N., & Mendes, J. F. F. (2002) · Advances in Physics · doi:10.1080/00018730110112519 · Cited by 3,171
Newman, M. E. J. (2003) · Physical Review E · doi:10.1103/physreve.67.026126 · Cited by 3,087
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
Scientific collaboration networks. II. Shortest paths, weighted networks, and centrality
Newman, M. E. J. (2001) · Physical Review E · doi:10.1103/physreve.64.016132 · Cited by 2,613
Mean-field theory for scale-free random networks
Barabási, A.-L., Albert, R., & Jeong, H. (1999) · Physica A: Statistical Mechanics and its Applications · doi:10.1016/s0378-4371(99)00291-5 · Cited by 2,255
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
Guimerà, R., Mossa, S., Turtschi, A., & Amaral, L. A. N. (2005) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0407994102 · Cited by 1,762
Dorogovtsev, S. N., & Mendes, J. F. F. (2003) · doi:10.1093/acprof:oso/9780198515906.001.0001 · Cited by 1,563
Structural vulnerability of the North American power grid
Albert, R., Albert, I., & Nakarado, G. L. (2004) · Physical Review E · doi:10.1103/physreve.69.025103 · Cited by 1,415
Evolution and Structure of the Internet: A Statistical Physics Approach
Pastor-Satorras, R., & Vespignani, A. (2004) · Cambridge University Press eBooks · doi:10.1017/cbo9780511610905 · Cited by 1,310
Betweenness centrality in large complex networks
Barthélemy, M. (2004) · The European Physical Journal B · doi:10.1140/epjb/e2004-00111-4 · Cited by 804
Large-scale topological and dynamical properties of the Internet
Vázquez, A., Pastor-Satorras, R., & Vespignani, A. (2002) · Physical Review E · doi:10.1103/physreve.65.066130 · Cited by 712
Small-world properties of the Indian railway network
Sen, P., Dasgupta, S., Chatterjee, A., Sreeram, P. A., Mukherjee, G., & Manna, S. S. (2003) · Physical Review E · doi:10.1103/physreve.67.036106 · Cited by 592
Is the Boston subway a small-world network?
Latora, V., & Marchiori, M. (2002) · Physica A: Statistical Mechanics and its Applications · doi:10.1016/s0378-4371(02)01089-0 · Cited by 522
A topological analysis of the Italian electric power grid
Crucitti, P., Latora, V., & Marchiori, M. (2004) · Physica A: Statistical Mechanics and its Applications · doi:10.1016/j.physa.2004.02.029 · Cited by 474
Modeling the world-wide airport network
Guimerá, R., & Amaral, L. A. N. (2004) · The European Physical Journal B · doi:10.1140/epjb/e2004-00131-0 · Cited by 466
Statistical analysis of airport network of China
Li, W., & Cai, X. (2004) · Physical Review E · doi:10.1103/physreve.69.046106 · Cited by 464
Is the Boston Subway a Small-World Network?
Latora, V., & Massimo Marchiori, B. (2002) · RePEc: Research Papers in Economics · Cited by 462
Evolution and Structure of the Internet: A Statistical Physics Approach
(2005) · Journal of Documentation · doi:10.1108/00220410510598571 · Cited by 423
Highly clustered scale-free networks
Klemm, K., & Eguíluz, V. M. (2002) · Physical Review E · doi:10.1103/physreve.65.036123 · Cited by 395
Marchiori, M., & Latora, V. (2000) · Physica A: Statistical Mechanics and its Applications · doi:10.1016/s0378-4371(00)00311-3 · Cited by 334
Betweenness centrality correlation in social networks
Goh, K.-I., Oh, E., Kahng, B., & Kim, D. (2003) · Physical Review E · doi:10.1103/physreve.67.017101 · Cited by 323
Networks and Cities: An Information Perspective
Rosvall, M., Trusina, A., Minnhagen, P., & Sneppen, K. (2005) · Physical Review Letters · doi:10.1103/physrevlett.94.028701 · Cited by 239
Stations, trains and small-world networks
Seaton, K. A., & Hackett, L. M. (2004) · Physica A: Statistical Mechanics and its Applications · doi:10.1016/j.physa.2004.03.019 · Cited by 212
Optimal Paths in Disordered Complex Networks
Braunstein, L. A., Buldyrev, S. V., Cohen, R., Havlin, S., & Stanley, H. E. (2003) · Physical Review Letters · doi:10.1103/physrevlett.91.168701 · Cited by 187
Motter, A. E., Nishikawa, T., & Lai, Y. (2002) · Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics · doi:10.1103/physreve.66.065103 · Cited by 114
Topology and correlations in structured scale-free networks
Vázquez, A., Boguñá, M., Moreno, Y., Pastor‐Satorras, R., & Vespignani, A. (2003) · Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics · doi:10.1103/physreve.67.046111 · Cited by 97
Science of Complex Networks: From Biology to the Internet and WWW; CNET 2004
Mendes, J. F. F., Oliveira, J. G., Abreu, F., et al. (2005) · Cited by 11
Cited by
Barthélemy, M. (2011) · Physics Reports · doi:10.1016/j.physrep.2010.11.002 · Cited by 2,469
Newman, M. (2018) · doi:10.1093/oso/9780198805090.001.0001 · Cited by 2,297
Human mobility: Models and applications
Barbosa, H., Barthelemy, M., Ghoshal, G., James, C. R., Lenormand, M., Louail, T., Menezes, R., Ramasco, J. J., Simini, F., & Tomasini, M. (2018) · Physics Reports · doi:10.1016/j.physrep.2018.01.001 · Cited by 1,027
Analyzing and modeling real-world phenomena with complex networks: a survey of applications
Costa, L. D. F., Oliveira, O. N., Travieso, G., Rodrigues, F. A., Villas Boas, P. R., Antiqueira, L., Viana, M. P., & Correa Rocha, L. E. (2011) · Advances in Physics · doi:10.1080/00018732.2011.572452 · Cited by 800
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
Metadata
- Authors
- Sienkiewicz, J., & Hołyst, J. A.
- Venue
- Physical Review E
- Publisher
- American Physical Society (APS)
- Published
- 2005-10-20
- Volume
- 72
- Issue
- 4
- Pages
- 046127-046127
- ISSN
- 1539-3755 (ISSN-L)
- 1550-2376
- OpenAlex
- W2042209975
- Cited by
- 434
- References
- 39
- FWCI
- 10.14
- 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.