Improving commuting zones using the Louvain community detection algorithm

被引:4
|
作者
Zhang, Whitney [1 ]
机构
[1] MIT, Dept Econ, 77 Massachusetts Ave,Bldg E52-300, Cambridge, MA 02139 USA
基金
美国国家科学基金会;
关键词
Local labor markets; Commuting; Clustering; Measurement error;
D O I
10.1016/j.econlet.2022.110827
中图分类号
F [经济];
学科分类号
02 ;
摘要
Well-defined commuting zones are essential for accurate research on US local labor markets. To develop commuting zones, one must construct edge weights - a measure of commuting flows between counties - and then use the edge weights to partition counties into clusters. I improve upon currently used "ERS"commuting zones in two ways. First, it is unclear if ERS commuting zones use the best edge weights. Therefore, I test multiple edge weights. Second, the algorithm to produce ERS commuting zones requires specifying a theoretically-unguided cutoff parameter; results may be sensitive to the parameter choice. Instead, I use the Louvain algorithm, which optimizes for "modularity", a graph-intrinsic parameter that is greater when there is higher intra-commuting zone flow and lower inter-commuting zone flow. I call my new delineations "TS Louvain", which uses the ERS commuting flow definition to construct edge weights, and "Sum Louvain", which uses the total number of commuters as edge weights. Compared to ERS, TS Louvain and Sum Louvain have 0.05 to 0.15 greater modularity, Sum Louvain has a 0.01 to 0.02 higher share of people who work and live in the same commuting zone, and in a case study, TS Louvain produces greater estimates and t-statistics. These metrics suggest that these new commuting zones improve upon the existing delineations. Researchers can access these commuting zone definitions at bit.ly/LouvainCZ.(c) 2022 Elsevier B.V. All rights reserved.
引用
收藏
页数:5
相关论文
共 50 条
  • [41] Cultural scene detection using reverse Louvain optimization
    Hamdaqa, Mohammad
    Tahvildari, Ladan
    LaChapelle, Neil
    Campbell, Brian
    SCIENCE OF COMPUTER PROGRAMMING, 2014, 95 : 44 - 72
  • [42] Improving the the permutation-based proximity searching algorithm using zones and partial information
    Figueroa, Karina
    Paredes, Rodrigo
    Camarena-Ibarrola, Antonio
    Tejeda-Villela, Hector
    PATTERN RECOGNITION LETTERS, 2017, 95 : 29 - 36
  • [43] Community Detection in Networks by Using Multiobjective Membrane Algorithm
    Liu, Chuang
    Fan, Linan
    Li, Liangjie
    Liu, Zhou
    Dai, Xiang
    Gao, Wei
    NEURAL INFORMATION PROCESSING (ICONIP 2017), PT IV, 2017, 10637 : 419 - 428
  • [44] Overlapping Community Detection Using Multiobjective Genetic Algorithm
    Kumar, Amit
    Barman, Debaditya
    Sarkar, Ritam
    Chowdhury, Nirmalya
    IEEE TRANSACTIONS ON COMPUTATIONAL SOCIAL SYSTEMS, 2020, 7 (03) : 802 - 817
  • [45] Modularity Maximization for Community Detection Using Genetic Algorithm
    Lu, Hu
    Yao, Qi
    NEURAL INFORMATION PROCESSING (ICONIP 2018), PT II, 2018, 11302 : 463 - 472
  • [46] Brain Tumor Segmentation using Community Detection Algorithm
    Gammoudi, Islem
    Mahjoub, Mohamed Ali
    2021 INTERNATIONAL CONFERENCE ON CYBERWORLDS (CW 2021), 2021, : 57 - 63
  • [47] Community Detection using an Optimized Label Propagation Algorithm
    Wan, Renjie
    Cai, Jingye
    2013 INTERNATIONAL CONFERENCE ON CLOUD COMPUTING AND BIG DATA (CLOUDCOM-ASIA), 2013, : 360 - 365
  • [48] Community Detection in Networks Using Atom Stabilization Algorithm
    Biswas, Anupam
    Khandelwal, Sakshi
    BhaskarBiswas
    2017 IEEE 4TH INTERNATIONAL CONFERENCE ON SOFT COMPUTING & MACHINE INTELLIGENCE (ISCMI), 2017, : 89 - 93
  • [49] Community detection in complex networks by using membrane algorithm
    Liu, Chuang
    Fan, Linan
    Liu, Zhou
    Dai, Xiang
    Xu, Jiamei
    Chang, Baoren
    INTERNATIONAL JOURNAL OF MODERN PHYSICS C, 2018, 29 (01):
  • [50] Local Community Detection Using Greedy Algorithm with Probability
    Zhu, Xiaoxiang
    Xia, Zhengyou
    ADVANCED DATA MINING AND APPLICATIONS, ADMA 2018, 2018, 11323 : 465 - 473