1 Maximizing influence and diffusion
نویسنده
چکیده
Let St ⊆ V be the set of nodes active at time t, starting with some initial set of active notes S0. Moreover, each node v ∈ V has a uniformly random activation threshold θv and an activation function fv : 2V → R defined on all subsets of the nodes. Given the set of active nodes St−1, we update the set of active nodes as follows: 1. Set St ← St−1. 2. For all v ∈ V \ St−1, we check whether fv(St−1) ≥ θv. If this is the case, the node v becomes active and we set St ← St ∪ {v}.
منابع مشابه
Scalable Influence Estimation in Continuous-Time Diffusion Networks
If a piece of information is released from a media site, can we predict whether it may spread to one million web pages, in a month ? This influence estimation problem is very challenging since both the time-sensitive nature of the task and the requirement of scalability need to be addressed simultaneously. In this paper, we propose a randomized algorithm for influence estimation in continuous-t...
متن کاملCompetitive Influence Maximization in Social Networks
Social networks often serve as a medium for the diffusion of ideas or innovations. An individual’s decision whether to adopt a product or innovation will be highly dependent on the choices made by the individual’s peers or neighbors in the social network. In this work, we study the game of innovation diffusion with multiple competing innovations such as when multiple companies market competing ...
متن کاملOptimal feed-in tariffs and subsidies for residential photovoltaic systems
A feed-in tariff system and a subsidy are often used to make households install photovoltaic (PV) systems for solar power generation. They both influence the economics of a household in deciding whether to install or not. The purpose of this study is to obtain information on how a PV-power price and a subsidy should be set to promote adoption of PV systems effectively and efficiently. The model...
متن کاملDiffusion Independent Semi-Bandit Influence Maximization
We consider influence maximization (IM) in social networks, which is the problem of maximizing the number of users that become aware of a product by selecting a set of “seed” users to expose the product to. While prior work assumes a known model of information diffusion, we propose a parametrization in terms of pairwise reachability which makes our framework agnostic to the underlying diffusion...
متن کاملTwo-Phase Influence Maximization in Social Networks with Seed Nodes and Referral Incentives
The problem of maximizing the spread of influence with a limited budget is central to social networks research. Most problems addressed in existing literature spend the entire budget towards triggering diffusion at seed nodes. In this paper, we investigate the effect of splitting the budget across two sequential phases; each phase corresponds to a different way of spreading influence. In phase ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015