arrow
Return

Network classification through random walks

delete2025-07-24
delete0
PRE
AI
G
Gonzalo Travieso
J
Joao V. Merenda
O
Odemir Martinez Bruno *
DOI:10.1016/j.chaos.2025.116817delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
• Proposes a novel set of network features based on random walk statistics. • Achieves top classification accuracy in 10 out of 12 datasets. • Demonstrates strong robustness to structural noise. • Highlights self-avoiding walk visit stats as a lightweight, efficient classifier. • Validated across diverse domains (synthetic, metabolic, bioinformatics, social).
Keywords:
random walk statistics
network features
classification accuracy
self-avoiding walk
robustness to noise

Journal

C
Chaos Solitons and Fractals
IF:
5.6
Papers:
1.3K
Citations:
3.8W

Organization

No organization information available