Minimal paths between communities induced by geographical networks
arXiv:1501.02728 · doi:10.1088/1742-5468/2016/02/023403
Abstract
In this work we investigate the betweenness centrality in geographical networks and its relationship with network communities. We show that vertices with large betweenness define what we call characteristic betweenness paths in both modeled and real-world geographical networks. We define a geographical network model that possess a simple topology while still being able to present such betweenness paths. Using this model, we show that such paths represent pathways between entry and exit points of highly connected regions, or communities, of geographical networks. By defining a new network, containing information about community adjacencies in the original network, we describe a means to characterize the mesoscale connectivity provided by such characteristic betweenness paths.
References in corpus (17)
- Statistical mechanics of complex networks
- The structure and function of complex networks
- Community structure in social and biological networks
- Modularity and community structure in networks
- Community detection in graphs
- Finding community structure in very large networks
- Functional cartography of complex metabolic networks
- Spatial Networks
- Characterization of complex networks: A survey of measurements
- Defining and identifying communities in networks
- Cascade-based attacks on complex networks
- Spontaneous synchrony in power-grid networks
- Centrality Measures in Spatial Networks of Urban Streets
- Scaling laws in the spatial structure of urban road networks
- Scaling laws for the movement of people between locations in a large city
- Community analysis in social networks
- The Backbone of a City