English
Related papers

Related papers: Boosting Information Spread: An Algorithmic Approa…

200 papers

CMO Council reports that 71\% of internet users in the U.S. were influenced by coupons and discounts when making their purchase decisions. It has also been shown that offering coupons to a small fraction of users (called seed users) may…

Social and Information Networks · Computer Science 2018-02-23 Shaojie Tang

In many real-world scenarios, an individual's local social network carries significant influence over the opinions they form and subsequently propagate. In this paper, we propose a novel diffusion model -- the Pressure Threshold model (PT)…

Social and Information Networks · Computer Science 2026-04-03 Curt Stutsman , Eliot W. Robson , Abhishek K. Umrawal

The research of influence propagation in social networks via word-of-mouth processes has been given considerable attention in recent years. Arguably, the most fundamental problem in this domain is influence maximization, where the goal is…

Data Structures and Algorithms · Computer Science 2018-03-13 Noa Avigdor-Elgrabli , Gideon Blocq , Iftah Gamzu , Ariel Orda

The personalization of our news consumption on social media has a tendency to reinforce our pre-existing beliefs instead of balancing our opinions. This finding is a concern for the health of our democracies which rely on an access to…

Social and Information Networks · Computer Science 2019-06-04 Ruben Becker , Federico Corò , Gianlorenzo D'Angelo , Hugo Gilbert

The goal of influence maximization (IM) is to select a small set of seed nodes which maximizes the spread of influence on a network. In this work, we propose BOPIM, a Bayesian Optimization (BO) algorithm for IM on temporal networks. The IM…

Social and Information Networks · Computer Science 2026-03-11 Eric Yanchenko

Given a complex high-dimensional distribution over $\{\pm 1\}^n$, what is the best way to increase the expected number of $+1$'s by controlling the values of only a small number of variables? Such a problem is known as influence…

Data Structures and Algorithms · Computer Science 2024-01-05 Zongchen Chen , Elchanan Mossel

This paper studies a Group Influence with Minimum cost which aims to find a seed set with smallest cost that can influence all target groups, where each user is associated with a cost and a group is influenced if the total score of the…

Computer Science and Game Theory · Computer Science 2022-12-16 Phuong N. H. Pham , Canh V. Pham , Hieu V. Duong , Thanh T. Nguyen , My T. Thai

Given a network represented by a weighted directed graph G, we consider the problem of finding a bounded cost set of nodes S such that the influence spreading from S in G, within a given time bound, is as large as possible. The dynamic that…

Social and Information Networks · Computer Science 2015-02-23 Ferdinando Cicalese , Gennaro Cordasco , Luisa Gargano , Martin Milanic , Joseph Peters , Ugo Vaccaro

The spread of influence in networks is a topic of great importance in many application areas. For instance, one would like to maximise the coverage, limiting the budget for marketing campaign initialisation and use the potential of social…

Social and Information Networks · Computer Science 2020-09-11 Radosław Michalski , Jarosław Jankowski , Piotr Bródka

Continuous influence maximization (CIM) generalizes the original influence maximization by incorporating general marketing strategies: a marketing strategy mix is a vector $\boldsymbol x = (x_1,\dots,x_d)$ such that for each node $v$ in a…

Optimization and Control · Mathematics 2019-11-22 Wei Chen , Weizhong Zhang , Haoyu Zhao

A widely studied process of influence diffusion in social networks posits that the dynamics of influence diffusion evolves as follows: Given a graph $G=(V,E)$, representing the network, initially \emph{only} the members of a given…

Data Structures and Algorithms · Computer Science 2015-12-22 Gennaro Cordasco , Luisa Gargano , Adele A. Rescigno , Ugo Vaccaro

Influence maximization is the problem of finding the set of nodes of a network that maximizes the size of the outbreak of a spreading process occurring on the network. Solutions to this problem are important for strategic decisions in…

Physics and Society · Physics 2019-10-23 Sirag Erkol , Claudio Castellano , Filippo Radicchi

Influence Maximization (IM) in temporal graphs focuses on identifying influential "seeds" that are pivotal for maximizing network expansion. We advocate defining these seeds through Influence Propagation Paths (IPPs), which is essential for…

Social and Information Networks · Computer Science 2025-04-16 Laixin Xie , Ying Zhang , Xiyuan Wang , Shiyi Liu , Shenghan Gao , Xingxing Xing , Wei Wan , Haipeng Zhang , Quan Li

Given a graph $G$, a community structure $\mathcal{C}$, and a budget $k$, the fair influence maximization problem aims to select a seed set $S$ ($|S|\leq k$) that maximizes the influence spread while narrowing the influence gap between…

Data Structures and Algorithms · Computer Science 2023-11-23 Xiaobin Rui , Zhixiao Wang , Jiayu Zhao , Lichao Sun , Wei Chen

Given a social network modeled as a weighted graph $G$, the influence maximization problem seeks $k$ vertices to become initially influenced, to maximize the expected number of influenced nodes under a particular diffusion model. The…

Distributed, Parallel, and Cluster Computing · Computer Science 2021-04-13 Soheil Shahrouz , Saber Salehkaleybar , Matin Hashemi

Influence maximization is the problem of finding a set of influential users in a social network such that the expected spread of influence under a certain propagation model is maximized. Much of the previous work has neglected the important…

Social and Information Networks · Computer Science 2016-11-18 Wei Lu , Laks V. S. Lakshmanan

In this paper, we investigate the discount allocation problem in social networks. It has been reported that 40\% of consumers will share an email offer with their friend and 28\% of consumers will share deals via social media platforms.…

Social and Information Networks · Computer Science 2016-06-28 Shaojie Tang , Jing Yuan

The influence maximization is the problem of finding a set of social network users, called influencers, that can trigger a large cascade of propagation. Influencers are very beneficial to make a marketing campaign goes viral through social…

Social and Information Networks · Computer Science 2017-08-29 Siwar Jendoubi , Arnaud Martin

The problem of influence maximization is to select the most influential individuals in a social network. With the popularity of social network sites, and the development of viral marketing, the importance of the problem has been increased.…

Social and Information Networks · Computer Science 2019-04-30 Maryam Adineh , Mostafa Nouri-Baygi

In the last few years, many closed social networks such as WhatsAPP and WeChat have emerged to cater for people's growing demand of privacy and independence. In a closed social network, the posted content is not available to all users or…

Social and Information Networks · Computer Science 2022-09-22 Shixun Huang , Wenqing Lin , Zhifeng Bao , Jiachen Sun