A scale-free transportation network explains the city-size distribution

Berliant, Marcus and Watanabe, Hiroki (2011): A scale-free transportation network explains the city-size distribution.

Abstract

Zipf’s law is one of the best-known empirical regularities of the city-size distribution. There is extensive research on the subject, where each city is treated symmetrically in terms of the cost of transactions with other cities. Recent developments in network theory facilitate the examination of an asymmetric transport network. Under the scale-free transport network framework, the chance of observing extremes becomes higher than the Gaussian distribution predicts and therefore it explains the emergence of large clusters. City-size distributions share the same pattern. This paper proposes a way to incorporate network structure into urban economic models and explains the city-size distribution as a result of transport cost between cities.

• Item Type: MPRA Paper
• Language: English
• Keywords: Zipf’s law; city-size distribution; scale-free network
• Subjects: R - Urban, Rural, Regional, Real Estate, and Transportation Economics > R4 - Transportation Economics > R40 - General; R - Urban, Rural, Regional, Real Estate, and Transportation Economics > R1 - General Regional Economics > R12 - Size and Spatial Distributions of Regional Economic Activity

References

Réka Albert and Albert-László Barabási. Statistical mechanics of complex networks. Reviews of Modern Physics, 2002.

Albert-László Barabási and Eric Bonabeau. Scale-free networks. Scientific American, 2003.

Marcus Berliant and Hiroki Watanabe. Explaining the size distribution of cities: X-treme economies. Working Paper, 2011.

Gilles Duranton. Some foundations for Zipf’s law: Product proliferation and local spillovers. Regional Science and Urban Economics, 2005.

Jan Eeckhout. Gibrat’s law for (all) cities. American Economic Review, 2004.

Paul Erdos and Alfréd Rényi. On random graphs. Publicationes Mathematicae, 1959.

Paul Erdos and Alfréd Rényi. On the strength of connectedness of a random graph. Acta Mathematica Hungarica, 1961.

Janusz A. Hołyst, Julian Sienkiewicz, Agata Fronczak, Piotr Fronczak, and Krzysztof Suchecki. Universal scaling of distances in complex networks. Physical Review E, 2005.

M. E. J. Newman. Power laws, Pareto distributions and Zipf’s law. Contemporary Physics, 2005.

M. E. J. Newman, S. H. Strogatz, and D. J. Watts. Random graphs with arbitrary degree distributions and their applications. Physical Review E, 2001.

Romualdo Pastor-Satorras, Alexei Vázquez, and Alessandro Vespignani. Dynamical and correlation properties of the internet. Physical Review Letters, 2001.

Kwok Tong Soo. Zipf’s law for cities: a cross-country investigation. Regional Science and Urban Economics, 2005.

William E. Young and Robert H. Trent. Geometric mean approximations of individual security and portfolio performance. The Journal of Financial and Quantitative Analysis, 1969.