On October 2, Prof. Boleslaw K. Szymanski presented an invited talk on "Finding Efficient Spreaders for Information Diffusion in Social Networks," at the Conference on Complex Networks.

On October 2, Prof. Boleslaw K. Szymanski presented an invited talk on "Finding Efficient Spreaders for Information Diffusion in Social Networks," co-authored by Panagiotis Karampourniotis, and Gyorgy Korniss. The talk was a part of the Renoir Satellite Workshop at the Conference on Complex Networks in Singapore. The talk focuses on a simple classic threshold model of contagion spreading in complex social systems. Information propagates there with certain probability from nodes just activated to their non-activated neighbors. Diffusion may be triggered by activation of even a small set of nodes with new idea. In our model, we allow individuals' susceptibility to this idea to be heterogeneous to investigate the threshold-limited cascades sizes as the distribution of thresholds varies from one with all agents having identical thresholds, to the other with each agent having a threshold drawn from the uniform distribution. We show that individuals' heterogeneity of susceptibility governs the dynamics, resulting in different sizes of initiators needed for consensus on a single opinion, so the case when the cascade created by the initiator includes all the nodes. We introduce two new selection strategies for influence maximization. One balances selection of nodes with high resistance to adoptions and nodes positioned in central spots in the network. The second strategy finds and selects nodes that increase the group's influence for many random choices of the members of the group. Our strategies outperform other existing strategies for many cases of the susceptibility diversity and network degree assortativity.