Search arXiv⌕ Search

arXiv · 2609.32732

Plan-to-Synthesis: Cross-City Human Mobility Generation via Semantic Latent Flow Matching

Abstract

Human mobility generation aims to synthesize realistic point-of-interest (POI) visitation trajectories and has become an important tool for travel behavior modeling, transportation management, and urban planning. Existing diffusion-based methods achieve high fidelity but require per-city generation, given the inherent heterogeneity of geospatial locations and POI categories, while large language model-based methods generalize across cities but remain too costly at scale, especially for long-horizon trajectory generation. To address this, we propose SeMoFlow, a Semantic human Mobility generation framework based on latent Flow matching. We first encode heterogeneous POIs from different cities into a shared cross-city representation space via hierarchical Semantic IDs, where shared prefixes capture transferable semantics, and successive codes progressively refine the representation toward individual POIs. Building on the semantic IDs, SeMoFlow follows a plan-to-synthesis hierarchical generation paradigm, in which an autoregressive planner generates coarse-grained semantic and recurrence patterns, and a flow matching realizer synthesizes fine-grained suffix latents. The generated latents are subsequently decoded and grounded to concrete POIs. Extensive experiments on large-scale multi-city datasets show that SeMoFlow achieves higher trajectory fidelity than existing baselines, preserves city-specific mobility motifs, and supports both joint multi-city generation and effective cross-city transfer.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Zhoufu Wang, Baoshen Guo, Zhiqing Hong, Junyi Li, Kailai Sun, Heye Huang, Alok Prakash, Shenhao Wang, Jinhua Zhao. 2026-09-26. Plan-to-Synthesis: Cross-City Human Mobility Generation via Semantic Latent Flow Matching. https://arxiv.org/abs/2609.32732

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Detection and Characterization of Coordinated Online Behavior: A Survey

Coordination is a fundamental aspect of life. The advent of social media has made it integral also to online human interactions, such as those that characterize thriving online communities and social movements. At the same time, coordination is also core to effective disinformation, manipulation, and hate campaigns. This survey collects, categorizes, and critically discusses the body of work produced as a result of the growing interest on coordinated online behavior. We reconcile industry and academic definitions, propose a comprehensive framework to study coordinated online behavior, and review and critically discuss the existing detection and characterization methods. Our analysis identifies open challenges and promising directions of research, serving as a guide for scholars, practitioners, and policymakers in understanding and addressing the complexities inherent to online coordination. We also provide an interactive companion website for exploring the surveyed literature.

cs.SI↗

The Game is the Game: Dynamic network analysis and shifting roles in criminal networks

Objectives: This paper incorporates time as a crucial variable to identify key players in criminal networks and explores how actors' positions change over time. It then assesses the accuracy of the results against the uncertainty around network data collected from criminal justice records. Methods: Network data are from a judicial document for a two-year investigation targeting a drug trafficking and distribution network. We use Katz centrality in its dynamic version to explore changes in relationships and relative importance of network actors. We then use a novel method of introducing new edges to the network using Bernoulli random trials to simulate missing data and assess the extent to which node rankings based on Katz centrality change or remain the same when introducing some level of uncertainty to our observed network. Results: We identify actors who consistently held a central role over the course of the two-year investigation and differentiate them from actors who provided key contributions to the group's activities, but only for a limited period. We show that compared to centrality measures commonly used in criminal network analysis, dynamic Katz centrality is helpful to differentiate individual contributions even among central nodes and explore individual trajectories over time, even when data are incomplete. Conclusions: This paper demonstrates the value of key player identification using temporal network data and offers an additional analytical tool to both organised crime scholars trying to capture the complex nature of criminal collaboration and law enforcement agencies aiming at identifying appropriate targets and disrupting criminal groups.

cs.SI↗

Link prediction in complex networks via fusing node centrality and local similarity indices: a fair-protocol reassessment and parameter design principles

Local similarity indices assign zero scores to node pairs without common neighbors, which limits link prediction in sparse networks; fusing node centrality with local similarity is a common remedy, but existing fusion studies use heterogeneous protocols and the robustness of their gains is unclear. Within a unified piecewise fusion framework (multiplicative modulation when local information is sufficient, small-dose completion when it is absent), we show that the dynamic range of the centrality product governs the modulation mechanism: the PageRank product is of order O(n^-2), so its factor degenerates to a near-identity map. Under a fair protocol with exhaustive negative-sample comparison on eight real-world networks, PageRank fusion therefore yields no consistent significant gain for six of the seven local indices; its single exception, a gain of about +0.035 on the near-tree-like wiki-Vote network, comes entirely from completion, indicating that the completion gain depends on both the fraction of zero-score node pairs and the standalone predictive power of the centrality product. The min-max normalized DomiRank product, with an O(1) range, instead gives stable gains under unified parameters (modulation weight 5, completion coefficient 0.1): all seven fused indices improve significantly at the fold level (p <= 3.3e-3), and a 10x5 repeated cross-validation confirms robustness to the randomness of fold partitions. DR-RA reaches an average AUC of 0.9257, surpassing Katz, LNB, CN2D, CNC, CND, SimRank, CCPA, Gravity and CNPop, and comparable to RWR. The design rules obtained for the two mechanisms (completion coefficient at most 0.3, modulation weight in [0.5,12], competition intensity near critical) provide a reproducible protocol benchmark and quantitative parameter design principles for the centrality x local-similarity fusion paradigm.

cs.SI↗