A Self-Stabilizing Algorithm for Finding a Minimal Positive Influence Dominating Set in Social Networks

Online social network has developed significantly in recent years. Most of current research has utilized the property of online social network to spread information and ideas. Motivated by applications in social networks (such as alcohol intervention strategies), a variation of the dominating set called a positive influence dominating set (PIDS) has been studied in the literature. However, the existing work all focused on greedy algorithms for the PIDS problem with different approximation ratios, which are limited to find approximate solutions to PIDS in large networks. In order to select a minimal PIDS (MPIDS) in large social networks, we first present a self-stabilizing algorithm for the MPIDS problem in this paper, which can find a MPIDS in an arbitrary network graph without any isolated node. It is assumed that the nodes in the proposed algorithm have globally unique identifiers, and the algorithm works under a central daemon. We further prove that the worst case convergence time of the algorithm from any arbitrary initial state is O(n2) steps where n is the number of nodes in the network.

[1]  Yanchun Zhang,et al.  A flexible payment scheme and its role-based access control , 2005, IEEE Transactions on Knowledge and Data Engineering.

[2]  Pradip K. Srimani,et al.  Self-stabilizing Algorithms for Minimal Dominating Sets and Maximal Independent Sets , 2003 .

[3]  Peter J. Slater,et al.  Fundamentals of domination in graphs , 1998, Pure and applied mathematics.

[4]  James Jaccard,et al.  Peer influences on risk behavior: an analysis of the effects of a close friend. , 2005, Developmental psychology.

[5]  Anish Arora,et al.  Stabilization-Preserving Atomicity Refinement , 2002, J. Parallel Distributed Comput..

[6]  Edsger W. Dijkstra,et al.  Self-stabilizing systems in spite of distributed control , 1974, CACM.

[7]  Yan Shi,et al.  On positive influence dominating sets in social networks , 2011, Theor. Comput. Sci..

[8]  Wayne Goddard,et al.  A self-stabilizing distributed algorithm for minimal total domination in an arbitrary system graph , 2003, Proceedings International Parallel and Distributed Processing Symposium.

[9]  S. Hedetniemi,et al.  Domination in graphs : advanced topics , 1998 .

[10]  Pradip K. Srimani,et al.  Linear time self-stabilizing colorings , 2003, Inf. Process. Lett..

[11]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[12]  Sayaka Kamei,et al.  A self-stabilizing algorithm for the distributed minimal k-redundant dominating set problem in tree networks , 2003, Proceedings of the Fourth International Conference on Parallel and Distributed Computing, Applications and Technologies.

[13]  A. J. M. van Gasteren,et al.  A simple fixpoint argument without the restriction to continuity , 2004, Acta Informatica.

[14]  Shlomi Dolev,et al.  Self Stabilization , 2004, J. Aerosp. Comput. Inf. Commun..

[15]  M. Larimer,et al.  Identification, prevention, and treatment revisited: individual-focused college drinking prevention strategies 1999-2006. , 2007, Addictive behaviors.

[16]  Hamamache Kheddouci,et al.  A survey on self-stabilizing algorithms for independence, domination, coloring, and matching in graphs , 2010, J. Parallel Distributed Comput..

[17]  Martin Gairing,et al.  Self-Stabilizing Algorithms for {k}-Domination , 2003, Self-Stabilizing Systems.

[18]  Chih-Yuan Chen,et al.  A self-stabilizing algorithm for finding a minimal 2-dominating set assuming the distributed demon model , 2007, Comput. Math. Appl..

[19]  Kuai Xu,et al.  Positive Influence Dominating Set in Online Social Networks , 2009, COCOA.

[20]  Ajoy Kumar Datta,et al.  Self-Stabilizing Local Mutual Exclusion and Daemon Refinement , 2000, Chic. J. Theor. Comput. Sci..

[21]  Sayaka Kamei,et al.  A Self-Stabilizing Distributed Algorithm for the Steiner Tree Problem , 2004, IEICE Trans. Inf. Syst..

[22]  Jian Pei,et al.  Publishing anonymous survey rating data , 2011, Data Mining and Knowledge Discovery.

[23]  Wayne Goddard,et al.  Self-Stabilizing Graph Protocols , 2008, Parallel Process. Lett..

[24]  Sébastien Tixeuil,et al.  A new self-stabilizing maximal matching algorithm , 2007, Theor. Comput. Sci..

[25]  Chih-Yuan Chen,et al.  A Linear-Time Self-Stabilizing Algorithm for the Minimal 2-Dominating Set Problem in General Networks , 2008, J. Inf. Sci. Eng..

[26]  Yanchun Zhang,et al.  Satisfying Privacy Requirements Before Data Anonymization , 2012, Comput. J..

[27]  Yanchun Zhang,et al.  Effective Collaboration with Information Sharing in Virtual Universities , 2009, IEEE Transactions on Knowledge and Data Engineering.

[28]  Hua Wang,et al.  Access control and authorization for protecting disseminative information in E‐learning workflow , 2011, Concurr. Comput. Pract. Exp..

[29]  J. Standridge,et al.  Alcohol Consumption: An Overview of Benefits and Risks , 2004, Southern medical journal.