Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
6936079 | Transportation Research Part C: Emerging Technologies | 2018 | 14 Pages |
Abstract
This paper proposes a novel approach to identify the pockets of activity or the community structure in a city network using multi-layer graphs that represent the movement of disparate entities (i.e. private cars, buses and passengers) in the network. First, we process the trip data corresponding to each entity through a Voronoi segmentation procedure which provides a natural null model to compare multiple layers in a real world network. Second, given nodes that represent Voronoi cells and link weights that define the strength of connection between them, we apply a community detection algorithm and partition the network into smaller areas independently at each layer. The partitioning algorithm returns geographically well connected regions in all layers and reveal significant characteristics underlying the spatial structure of our city. Third, we test an algorithm that reveals the unified community structure of multi-layer networks, which are combinations of single-layer networks coupled through links between each node in one network layer to itself in other layers. This approach allows us to directly compare the resulting communities in multiple layers where connection types are categorically different.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science Applications
Authors
Mehmet Yildirimoglu, Jiwon Kim,