Search arXiv⌕ Search

arXiv · 2610.23863

Measuring the Influence of Modality-Specific Node Representations on Graphs

Abstract

Multimodal attributed graphs combine graph structure with node text and image representations in recommendation and multimedia analysis. Graph predictors propagate these representations across connected nodes, so one input can change predictions at its own and nearby nodes. Measuring this distributed response reveals which modality-specific inputs a trained model relies on and how predictor design changes that reliance. We study influence measurement for modality-specific node representations. Given an encoded graph, a trained predictor, a training split, and fixed candidate representations, the task outputs one influence score per candidate and separate text and image rankings. We score a candidate by replacing it with its modality's training-node mean and comparing the original and changed predictions. Existing feature attribution and data valuation generally target one output, training examples, whole nodes, or graph elements rather than prediction changes across graph nodes. Our empirical study shows that nearby-node responses contain information missed by source-only scores and simple proxies, while response magnitude alone does not identify which class changes support the task. Guided by these observations, we propose MoGI (Modality-specific Graph Influence). It propagates training labels to define task direction, reads the same replacement response for the favored class and full class distribution, and averages the resulting ranks. MoGI requires no predictor retraining or learned scoring parameters. Under a shared five-dataset, eight-predictor benchmark, it achieves the largest aggregate held-out loss increase against all five external methods at every tested ranking cutoff.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Xu Wang, Xunkai Li, Yinlin Zhu, Rong-Hua Li. 2026-08-17. Measuring the Influence of Modality-Specific Node Representations on Graphs. https://arxiv.org/abs/2610.23863

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

KEEP EXPLORING

Related papers

Density Decomposition on Hypergraphs

Hypergraphs capture higher-order interactions involving multiple entities. Existing decomposition models, such as $k$-core and nbr-$k$-core, rely on degree or neighborhood constraints and may overlook fine-grained density variations. We propose a $(k,δ)$-dense subhypergraph model based on capped hyperedge contributions. For each parameter pair, the unique dense set is the inclusionwise smallest maximizer of a penalized capped hyperedge contribution. These dense sets form a nested hierarchy characterized by egalitarian $δ$-orientations and hypergraph reachability. We develop three algorithms for dense subhypergraph search and two for complete density decomposition. Both decomposition algorithms use integral flow balancing: Flow-Decomp extracts density levels through strongly connected component condensation, while Reverse-Decomp uses direct reverse propagation. Once an egalitarian orientation is obtained, both recover all density levels in linear time. We further derive sandwich bounds that restrict computation to equivalent residual subproblems and develop incremental algorithms for maintaining the hierarchy under hyperedge insertions and deletions. Experiments on nine real-world hypergraphs, including datasets with over 15 million vertices, compare our methods with four established decomposition models. The results show that Reverse-Decomp improves decomposition efficiency, incremental maintenance outperforms recomputation in the tested settings, and the proposed model captures density structures overlooked by degree-based decompositions.

cs.SI↗

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

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. The code is available at \href{https://github.com/urban-mobility-generation/SeMoFlow}{https://github.com/urban-mobility-generation/SeMoFlow}.

cs.SI↗

Uncovering Non-Normality in Information Flow: Network Structure and Dynamics of Social Media Cascades

Information cascades on social media are conventionally conceptualized as directed, feedforward branching processes. However, real-world diffusion pathways frequently deviate from pure hierarchical trees due to localized clustering, reciprocal commentary, and multi-wave temporal surges. In this work, we quantify the directional asymmetry and hierarchical structure of empirical information cascades on X (formerly Twitter) using spectral non-normality via Henrici's departure from normality. Analyzing approximately 58,000 cascade networks across diverse topics (including politics, entertainment, natural disasters, etc.), we investigate (1) how non-normality relates to temporal dynamics such as endogenous-like versus exogenous-like patterns and burstiness, (2) whether non-normality is correlated with the peak concentration or overall size of a cascade, (3) whether the overall non-normality of a cascade's network structure can be predicted from its early stages. We find that non-normality strongly aligns with peak concentration (peak/N) rather than overall cascade size, characterizing cascades governed by rapid, asymmetric forwarding. Furthermore, while early-stage structural forecasting (<= 30% of nodes observed) exhibits expected baseline uncertainty (51%-72% accuracy at a +/- 20% error tolerance), predictability consolidates rapidly during intermediate growth, exceeding 80% across all dynamic clusters once 50%-60% of the network is observed. By identifying the topological and dynamic correlates of cascade structures, this study advances our understanding of information flow and establishes a quantifiable benchmark for forecasting directional diffusion architectures.

cs.SI↗