Centrality-guided random walks for balanced node representation in graph embeddings

Graph-based representations provide an effective means for modeling complex real-world problems characterized by long-tailed degree distributions. A small fraction of nodes exhibit dense connectivity, while the majority remain only sparsely connected. Nodes with limited connections often suffer from degraded embedding quality. The imbalance is particularly salient in random walk-based graph embedding techniques because the sampling process systematically favors densely linked neighborhoods. To address the sampling bias induced by degree disparity, we introduce Centrality-Guided Random Walks, which adaptively sample nodes based on centrality-driven transition probabilities. Our model integrates multiple centrality metrics to balance the exploration of both highly connected and sparsely connected nodes. The adjustment produces robust embeddings for all nodes, regardless of their degree. Experimental results demonstrate that the proposed method improves overall classification accuracy with notable gains among tail-node groups. They underscore the effectiveness of incorporating node centrality into walk-based graph embedding for long-tail scenarios.

Authors

Institutions

Publication Details

Journal
Journal Of Big Data
Published
2026-11-21
DOI
https://doi.org/10.1186/s40537-026-01603-5
Primary Topic
Advanced Graph Neural Networks
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

Centrality-guided random walks for balanced node representation in graph embeddings

Mucheol Kim, Yejong Ryu, Mincheol Shin, Ka Lok Man et al.
Journal Of Big Data
Advanced Graph Neural Networks
article

Centrality-guided random walks for balanced node representation in graph embeddings

Mucheol Kim, Yejong Ryu, Mincheol Shin, Ka Lok Man, Tae-Young Choe
article en

Abstract

Graph-based representations provide an effective means for modeling complex real-world problems characterized by long-tailed degree distributions. A small fraction of nodes exhibit dense connectivity, while the majority remain only sparsely connected. Nodes with limited connections often suffer from degraded embedding quality. The imbalance is particularly salient in random walk-based graph embedding techniques because the sampling process systematically favors densely linked neighborhoods. To address the sampling bias induced by degree disparity, we introduce Centrality-Guided Random Walks, which adaptively sample nodes based on centrality-driven transition probabilities. Our model integrates multiple centrality metrics to balance the exploration of both highly connected and sparsely connected nodes. The adjustment produces robust embeddings for all nodes, regardless of their degree. Experimental results demonstrate that the proposed method improves overall classification accuracy with notable gains among tail-node groups. They underscore the effectiveness of incorporating node centrality into walk-based graph embedding for long-tail scenarios.

Journal Of Big Data
Chung-Ang University (KR), Xi’an Jiaotong-Liverpool University (CN)
Advanced Graph Neural Networks
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon
Centrality-guided random walks for balanced node representation in graph embeddings — Mucheol Kim, Yejong Ryu, et al. · Journal Of Big Data (2026) | TGRS Research Map | TGRS