Maximizing the spread of influence through a social network
Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
Distributed construction of connected dominating set in wireless ad hoc networks
Mobile Networks and Applications - Discrete algorithms and methods for mobile computing and communications
Structural and algorithmic aspects of massive social networks
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Measurement and analysis of online social networks
Proceedings of the 7th ACM SIGCOMM conference on Internet measurement
On the hardness of optimization in power-law graphs
Theoretical Computer Science
Influence and correlation in social networks
Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining
Unveiling facebook: a measurement study of social network based applications
Proceedings of the 8th ACM SIGCOMM conference on Internet measurement
Competitive influence maximization in social networks
WINE'07 Proceedings of the 3rd international conference on Internet and network economics
Latency-Bounded Minimum Influential Node Selection in Social Networks
WASA '09 Proceedings of the 4th International Conference on Wireless Algorithms, Systems, and Applications
On positive influence dominating sets in social networks
Theoretical Computer Science
Positive influence dominating set in e-learning social networks
ICWL'11 Proceedings of the 10th international conference on Advances in Web-Based Learning
Cheap, easy, and massively effective viral marketing in social networks: truth or fiction?
Proceedings of the 23rd ACM conference on Hypertext and social media
A New Algorithm for Positive Influence Dominating Set in Social Networks
ASONAM '12 Proceedings of the 2012 International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2012)
ADC '13 Proceedings of the Twenty-Fourth Australasian Database Conference - Volume 137
On the approximability of positive influence dominating set in social networks
Journal of Combinatorial Optimization
| Hi-index | 0.01 |
Online social network has developed significantly in recent years as a medium of communicating, sharing and disseminating information and spreading influence. Most of current research has been on understanding the property of online social network and utilizing it to spread information and ideas. In this paper, we explored the problem of how to utilize online social networks to help alleviate social problems in the physical world, for example, the drinking, smoking, and drug related problems. We proposed a Positive Influence Dominating Set (PIDS) selection algorithm and analyzed its effect on a real online social network data set through simulations. By comparing the size and the average positive degree of PIDS with those of a 1-dominating set, we found that by strategically choosing 26% more people into the PIDS to participate in the intervention program, the average positive degree increases by approximately 3.3 times. In terms of the application, this result implies that by moderately increasing the participation related cost, the probability of positive influencing the whole community through the intervention program is significantly higher. We also discovered that a power law graph has empirically larger dominating sets (both the PIDS and 1-dominating set) than a random graph does.