Positive influence dominating sets in power-law graphs

Wei Zhang, Weili Wu, Feng Wang, Kuai Xu

Research output: Contribution to journalArticle

19 Citations (Scopus)

Abstract

Finding the minimum Positive Influence Dominating Set (PIDS) is a problem arisen from the social network applications. The problem has been studied on general random graphs. However, the social networks is presented more precisely by power-law graphs. One of the most important properties of social networks is the power-law degree distribution. In this paper, we focus on the PIDS problem in power-law graphs and prove that the greedy algorithm has a constant approximation ratio. Simulation results also demonstrate that greedy algorithm can effectively select a small scale PIDS set.

Original languageEnglish (US)
Pages (from-to)31-37
Number of pages7
JournalSocial Network Analysis and Mining
Volume2
Issue number1
DOIs
StatePublished - Jan 1 2012

Fingerprint

social network
Law
simulation

Keywords

  • Greedy algorithm
  • Positive influence dominating set problem
  • Power-law distribution
  • Social networks

ASJC Scopus subject areas

  • Computer Science Applications
  • Human-Computer Interaction
  • Information Systems
  • Communication
  • Media Technology

Cite this

Positive influence dominating sets in power-law graphs. / Zhang, Wei; Wu, Weili; Wang, Feng; Xu, Kuai.

In: Social Network Analysis and Mining, Vol. 2, No. 1, 01.01.2012, p. 31-37.

Research output: Contribution to journalArticle

@article{35c2c22c189d4f8984b5657a1d692a14,
title = "Positive influence dominating sets in power-law graphs",
abstract = "Finding the minimum Positive Influence Dominating Set (PIDS) is a problem arisen from the social network applications. The problem has been studied on general random graphs. However, the social networks is presented more precisely by power-law graphs. One of the most important properties of social networks is the power-law degree distribution. In this paper, we focus on the PIDS problem in power-law graphs and prove that the greedy algorithm has a constant approximation ratio. Simulation results also demonstrate that greedy algorithm can effectively select a small scale PIDS set.",
keywords = "Greedy algorithm, Positive influence dominating set problem, Power-law distribution, Social networks",
author = "Wei Zhang and Weili Wu and Feng Wang and Kuai Xu",
year = "2012",
month = "1",
day = "1",
doi = "10.1007/s13278-011-0033-9",
language = "English (US)",
volume = "2",
pages = "31--37",
journal = "Social Network Analysis and Mining",
issn = "1869-5450",
publisher = "Springer Wien",
number = "1",

}

TY - JOUR

T1 - Positive influence dominating sets in power-law graphs

AU - Zhang, Wei

AU - Wu, Weili

AU - Wang, Feng

AU - Xu, Kuai

PY - 2012/1/1

Y1 - 2012/1/1

N2 - Finding the minimum Positive Influence Dominating Set (PIDS) is a problem arisen from the social network applications. The problem has been studied on general random graphs. However, the social networks is presented more precisely by power-law graphs. One of the most important properties of social networks is the power-law degree distribution. In this paper, we focus on the PIDS problem in power-law graphs and prove that the greedy algorithm has a constant approximation ratio. Simulation results also demonstrate that greedy algorithm can effectively select a small scale PIDS set.

AB - Finding the minimum Positive Influence Dominating Set (PIDS) is a problem arisen from the social network applications. The problem has been studied on general random graphs. However, the social networks is presented more precisely by power-law graphs. One of the most important properties of social networks is the power-law degree distribution. In this paper, we focus on the PIDS problem in power-law graphs and prove that the greedy algorithm has a constant approximation ratio. Simulation results also demonstrate that greedy algorithm can effectively select a small scale PIDS set.

KW - Greedy algorithm

KW - Positive influence dominating set problem

KW - Power-law distribution

KW - Social networks

UR - http://www.scopus.com/inward/record.url?scp=84874280441&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84874280441&partnerID=8YFLogxK

U2 - 10.1007/s13278-011-0033-9

DO - 10.1007/s13278-011-0033-9

M3 - Article

AN - SCOPUS:84874280441

VL - 2

SP - 31

EP - 37

JO - Social Network Analysis and Mining

JF - Social Network Analysis and Mining

SN - 1869-5450

IS - 1

ER -