Finding influential mediators in social networks

Cheng-Te Li, Shou De Lin, Man Kwan Shan

Research output: Chapter in Book/Report/Conference proceedingConference contribution

11 Citations (Scopus)

Abstract

Given a social network, who are the key players controlling the bottlenecks of influence propagation if some persons would like to activate specific individuals? In this paper, we tackle the problem of selecting a set of k mediator nodes as the influential gateways whose existence determines the activation probabilities of targeted nodes from some given seed nodes. We formally define the k-Mediators problem. To have an effective and efficient solution, we propose a three-step greedy method by considering the probabilistic influence and the structural connectivity on the pathways from sources to targets. To the best of our knowledge, this is the first work to consider the k-Mediators problem in networks. Experiments on the DBLP co-authorship graph show the effectiveness and efficiency of the proposed method.

Original languageEnglish
Title of host publicationProceedings of the 20th International Conference Companion on World Wide Web, WWW 2011
Pages75-76
Number of pages2
DOIs
Publication statusPublished - 2011 Apr 29
Event20th International Conference Companion on World Wide Web, WWW 2011 - Hyderabad, India
Duration: 2011 Mar 282011 Apr 1

Publication series

NameProceedings of the 20th International Conference Companion on World Wide Web, WWW 2011

Other

Other20th International Conference Companion on World Wide Web, WWW 2011
CountryIndia
CityHyderabad
Period11-03-2811-04-01

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications
  • Information Systems

Fingerprint Dive into the research topics of 'Finding influential mediators in social networks'. Together they form a unique fingerprint.

Cite this