Computational Aspects of Optimal Strategic Network Diffusion

  title={Computational Aspects of Optimal Strategic Network Diffusion},
  author={Marcin Waniek and Khaled M. Elbassioni and Fl{\'a}vio L. Pinheiro and C{\'e}sar A. Hidalgo and Aamena Alshamsi},

Figures from this paper

The Policy Implications of Economic Complexity

In recent years economic complexity has grown into an active field of fundamental and applied research. Yet, despite important advances, the policy implications of economic complexity remain unclear.

Economic complexity theory and applications

Economic complexity methods have become popular tools in economic geography, international development and innovation studies. Here, I review economic complexity theory and applications, with a



Influence maximization in complex networks through optimal percolation

This work maps the problem onto optimal percolation in random networks to identify the minimal set of influencers, which arises by minimizing the energy of a many-body system, where the form of the interactions is fixed by the non-backtracking matrix of the network.

Efficient influence maximization in social networks

Based on the results, it is believed that fine-tuned heuristics may provide truly scalable solutions to the influence maximization problem with satisfying influence spread and blazingly fast running time.

Adaptive Influence Maximization in Dynamic Social Networks

A simple greedy adaptive seeding strategy finds an effective solution with a provable performance guarantee and the results herein demonstrate the superiority of the adaptive seeded strategies to other baseline methods.

Maximizing the spread of influence through a social network

An analysis framework based on submodular functions shows that a natural greedy strategy obtains a solution that is provably within 63% of optimal for several classes of models, and suggests a general approach for reasoning about the performance guarantees of algorithms for these types of influence problems in social networks.

Strategic distribution of seeds to support diffusion in complex networks

Theoretically, it is shown that a universally best solution does not exist, and it is proved that finding an optimal distribution of supporting seeds over time for a particular network is an NP-hard problem.

Adaptive Seeding in Social Networks

This paper introduces a new framework which is a two-stage stochastic optimization model designed to leverage the potential that typically lies in neighboring nodes of arbitrary samples of social networks, and provides a constant factor approximation to the optimal adaptive policy in the Triggering model.

A Data-Based Approach to Social Influence Maximization

A new model is introduced, which is called credit distribution, that directly leverages available propagation traces to learn how influence flows in the network and uses this to estimate expected influence spread, and is time-aware in the sense that it takes the temporal nature of influence into account.

Balancing Speed and Coverage by Sequential Seeding in Complex Networks

Novel approaches for seed initiation that replace the commonly used activation of all seeds at once with a sequence of initiation stages are introduced and results indicate that, regardless of the seed ranking method used, sequential seeding strategies deliver better coverage than single stage seeding in about 90% of cases.

Scalable Methods for Adaptively Seeding a Social Network

Algorithms for linear influence models with provable approximation guarantees that can be gracefully parallelized are developed, and adaptive seeding is shown to be scalable and to obtains dramatic improvements over standard approaches of information dissemination.

Optimal diversification strategies in the networks of related products and of related research areas

It is shown that it is not only important to know which activities to target but also when to target them, and that the strategies that minimize the total time needed to diversify an economy target highly connected activities during a narrow and specific time window.