Influential Node Detection on Graph on Event Sequence

Zehao Lu, Shihan Wang, Xiao-Long Ren, Rodrigo Costas, Tamara Metze

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

Abstract

Numerous research efforts have centered on identifying the most influential players in networked social systems. This problem is immensely crucial in the research of complex networks. Most existing techniques either model social dynamics on static networks only and ignore the underlying time-serial nature or model the social interactions as temporal edges without considering the influential relationship between them. In this paper, we propose a novel perspective of modeling social interaction data as the graph on event sequence, as well as the Soft K-Shell algorithm that analyzes not only the network's local and global structural aspects, but also the underlying spreading dynamics. The extensive experiments validated the efficiency and feasibility of our method in various social networks from real world data. To the best of our knowledge, this work is the first of its kind.
Original languageEnglish
Title of host publicationComplex Networks and Their Applications XII
Subtitle of host publicationProceedings of The Twelfth International Conference on Complex Networks and their Applications: COMPLEX NETWORKS 2023, Volume 3
EditorsHocine Cherifi, Luis M. Rocha, Chantal Cherifi, Murat Donduran
Place of PublicationCham
PublisherSpringer
Pages147-158
Number of pages12
Edition1
ISBN (Electronic)978-3-031-53472-0
ISBN (Print)978-3-031-53471-3
DOIs
Publication statusPublished - 21 Feb 2024

Publication series

NameStudies in Computational Intelligence
PublisherSpringer
Volume1143
ISSN (Print)1860-949X
ISSN (Electronic)1860-9503

Keywords

  • Dynamics of Network
  • Influential Node Detection
  • Non-epidemic Spreading

Fingerprint

Dive into the research topics of 'Influential Node Detection on Graph on Event Sequence'. Together they form a unique fingerprint.

Cite this