On irreversible spread of influence in edge-weighted graphs

Various kinds of spread of influence occur in real world social and virtual networks. These phenomena are formulated by activation processes and irreversible dynamic monopolies in combinatorial graphs representing the topology of the networks. In most cases the nature of influence is weighted and the spread of influence depends on the weight of edges. The ordinary formulation and results for dynamic monopolies do not work for such models. In this paper we present a graph theoretical analysis for spread of weighted influence and mention a real world example realizing the activation model with weighted influence. Then we obtain some extremal bounds and algorithmic results for activation process and dynamic monopolies in directed and undirected graphs with weighted edges.

[1]  Manouchehr Zaker.  Generalized degeneracy, dynamic monopolies and maximum degenerate subgraphs , 2013, Discret. Appl. Math..

[2]  Danna Zhou,et al.  d. , 1934, Microbial pathogenesis.

[3]  Éva Tardos,et al.  Maximizing the Spread of Influence through a Social Network , 2015, Theory Comput..

[4]  Manouchehr Zaker.  On dynamic monopolies of graphs with general thresholds , 2012, Discret. Math..

[5]  Ilan Newman,et al.  Treewidth governs the complexity of target set selection , 2011, Discret. Optim..

[6]  H. Amini.  Bootstrap Percolation in Living Neural Networks , 2009, 0910.0627.

[7]  Rolf Niedermeier,et al.  On Tractable Cases of Target Set Selection , 2010, ISAAC.

[8]  Edson Bastos e Santos,et al.  Network Structure and Systemic Risk in Banking Systems , 2010 .

[9]  Ching-Lueh Chang,et al.  On irreversible dynamic monopolies in general graphs , 2009, ArXiv.

[10]  Manouchehr Zaker,et al.  Dynamic monopolies in directed graphs: The spread of unilateral influence in social networks , 2012, Discret. Appl. Math..

[11]  D. West.  Introduction to Graph Theory , 1995 .

[12]  Fred S. Roberts,et al.  Irreversible k-threshold processes: Graph-theoretical threshold models of the spread of disease and of opinion , 2009, Discret. Appl. Math..

[13]  Manouchehr Zaker,et al.  On dynamic monopolies of graphs: The average and strict majority thresholds , 2012, Discret. Optim..

[14]  Ning Chen,et al.  On the approximability of influence in social networks , 2008, SODA '08.

[15]  Jayme Luiz Szwarcfiter,et al.  Irreversible conversion of graphs , 2011, Theor. Comput. Sci..

[16]  Eyal Ackerman,et al.  Combinatorial model and bounds for target set selection , 2010, Theor. Comput. Sci..

[17]  Reinhard Diestel,et al.  Graph Theory , 1997 .

[18]  Paola Flocchini,et al.  On time versus size for monotone dynamic monopolies in regular topologies , 2000, SIROCCO.