Using network metrics to explore the community structure that underlies movement patterns

• URL: http://arxiv.org/abs/2309.07878v1
• Date: Thu, 14 Sep 2023 17:24:38 GMT
• Title: Using network metrics to explore the community structure that underlies movement patterns
• Authors: Anh Pham Thi Minh, Abhishek Kumar Singh, Soumya Snigdha Kundu
• Abstract summary: This work aims to explore the community structure of Santiago de Chile by analyzing the movement patterns of its residents. We use a dataset containing the approximate locations of home and work places for a subset of anonymized residents to construct a network that represents the movement patterns within the city.
• Score: 2.3864085643100186
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: This work aims to explore the community structure of Santiago de Chile by analyzing the movement patterns of its residents. We use a dataset containing the approximate locations of home and work places for a subset of anonymized residents to construct a network that represents the movement patterns within the city. Through the analysis of this network, we aim to identify the communities or sub-cities that exist within Santiago de Chile and gain insights into the factors that drive the spatial organization of the city. We employ modularity optimization algorithms and clustering techniques to identify the communities within the network. Our results present that the novelty of combining community detection algorithms with segregation tools provides new insights to further the understanding of the complex geography of segregation during working hours.

Related papers

• Adaptive Hierarchical SpatioTemporal Network for Traffic Forecasting [70.66710698485745]
  We propose an Adaptive Hierarchical SpatioTemporal Network (AHSTN) to promote traffic forecasting. AHSTN exploits the spatial hierarchy and modeling multi-scale spatial correlations. Experiments on two real-world datasets show that AHSTN achieves better performance over several strong baselines.
  arXiv  Detail & Related papers  (2023-06-15T14:50:27Z)
• CS-TGN: Community Search via Temporal Graph Neural Networks [0.0]
  We propose a query-driven Temporal Graph Convolutional Network (CS-TGN) that can capture flexible community structures. CS-TGN first combines the local query-dependent structure and the global graph embedding in each snapshot of the network. We demonstrate how this model can be used for interactive community search in an online setting.
  arXiv  Detail & Related papers  (2023-03-15T22:23:32Z)
• Modularity-based approach for tracking communities in dynamic social networks [0.39462888523270856]
  We introduce a novel framework for tracking communities over time in a dynamic network. Our framework adopts a modularity-based strategy and does not require a predefined threshold. We validated the efficacy of our framework through extensive experiments on synthetic networks.
  arXiv  Detail & Related papers  (2023-02-24T17:17:59Z)
• An Entropy-guided Reinforced Partial Convolutional Network for Zero-Shot Learning [77.72330187258498]
  We propose a novel Entropy-guided Reinforced Partial Convolutional Network (ERPCNet) ERPCNet extracts and aggregates localities based on semantic relevance and visual correlations without human-annotated regions. It not only discovers global-cooperative localities dynamically but also converges faster for policy gradient optimization.
  arXiv  Detail & Related papers  (2021-11-03T11:13:13Z)
• A Comprehensive Survey on Community Detection with Deep Learning [93.40332347374712]
  A community reveals the features and connections of its members that are different from those in other communities in a network. This survey devises and proposes a new taxonomy covering different categories of the state-of-the-art methods. The main category, i.e., deep neural networks, is further divided into convolutional networks, graph attention networks, generative adversarial networks and autoencoders.
  arXiv  Detail & Related papers  (2021-05-26T14:37:07Z)
• A multilevel clustering technique for community detection [0.0]
  This study presents a novel detection method based on a scalable framework to identify related communities in a network. We propose a multilevel clustering technique (MCT) that leverages structural and textual information to identify local communities termed microcosms. The approach offers a better understanding and clarity toward describing how low-level communities evolve and behave on Twitter.
  arXiv  Detail & Related papers  (2021-01-16T23:26:44Z)
• A Survey of Community Detection Approaches: From Statistical Modeling to Deep Learning [95.27249880156256]
  We develop and present a unified architecture of network community-finding methods. We introduce a new taxonomy that divides the existing methods into two categories, namely probabilistic graphical model and deep learning. We conclude with discussions of the challenges of the field and suggestions of possible directions for future research.
  arXiv  Detail & Related papers  (2021-01-03T02:32:45Z)
• On the use of local structural properties for improving the efficiency of hierarchical community detection methods [77.34726150561087]
  We study how local structural network properties can be used as proxies to improve the efficiency of hierarchical community detection. We also check the performance impact of network prunings as an ancillary tactic to make hierarchical community detection more efficient.
  arXiv  Detail & Related papers  (2020-09-15T00:16:12Z)
• Community detection and Social Network analysis based on the Italian wars of the 15th century [0.0]
  We study social network modelling by using human interaction as a basis. We propose a new set of functions, affinities, designed to capture the nature of the local interactions among each pair of actors in a network. We develop a new community detection algorithm, the Borgia Clustering, where communities naturally arise from the multi-agent interaction in the network.
  arXiv  Detail & Related papers  (2020-07-06T11:05:07Z)
• Detecting Communities in Heterogeneous Multi-Relational Networks:A Message Passing based Approach [89.19237792558687]
  Community is a common characteristic of networks including social networks, biological networks, computer and information networks. We propose an efficient message passing based algorithm to simultaneously detect communities for all homogeneous networks.
  arXiv  Detail & Related papers  (2020-04-06T17:36:24Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.