Social Network Analysis and Mining

, Volume 2, Issue 1, pp 31–37

Positive influence dominating sets in power-law graphs

Original Article

DOI: 10.1007/s13278-011-0033-9

Cite this article as:
Zhang, W., Wu, W., Wang, F. et al. Soc. Netw. Anal. Min. (2012) 2: 31. doi:10.1007/s13278-011-0033-9

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

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

Copyright information

© Springer-Verlag 2011

Authors and Affiliations

  1. 1.Faculty of ScienceXi’an Jiaotong UniversityXi’anChina
  2. 2.Department of Computer ScienceUniversity of Texas at DallasRichardsonUSA
  3. 3.Division of Mathematical and Natural SciencesArizona State UniversityPhoenixUSA

Personalised recommendations