An Alternative Approach to the Calculation and Analysis of Connectivity in the World City Network
Stefan Hennemann, Ben Derudder

TL;DR
This paper introduces a new graph-based method for analyzing world city networks that improves upon existing models by providing clearer network structure and better insights into city roles within global connectivity.
Contribution
It proposes a primary linkage algorithm for constructing directed graphs from city/firm data, enabling more accurate network analysis and assessment of city importance.
Findings
Cities like Tokyo and Sydney have more strategic roles than previously identified.
The new method produces comparable results to traditional models while offering clearer network structure.
The approach facilitates deeper empirical analysis of world city connectivity.
Abstract
Empirical research on world cities often draws on Taylor's (2001) notion of an 'interlocking network model', in which office networks of globalized service firms are assumed to shape the spatialities of urban networks. In spite of its many merits, this approach is limited because the resultant adjacency matrices are not really fit for network-analytic calculations. We therefore propose a fresh analytical approach using a primary linkage algorithm that produces a one-mode directed graph based on Taylor's two-mode city/firm network data. The procedure has the advantage of creating less dense networks when compared to the interlocking network model, while nonetheless retaining the network structure apparent in the initial dataset. We randomize the empirical network with a bootstrapping simulation approach, and compare the simulated parameters of this null-model with our empirical network…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
