English
Related papers

Related papers: Influence Blocking Maximization in Social Networks…

200 papers

Influence maximization is a widely used model for information dissemination in social networks. Recent work has employed such interventions across a wide range of social problems, spanning public health, substance abuse, and international…

Computer Science and Game Theory · Computer Science 2019-03-27 Alan Tsang , Bryan Wilder , Eric Rice , Milind Tambe , Yair Zick

Recently, online social networks have become major battlegrounds for political campaigns, viral marketing, and the dissemination of news. As a consequence, ''bad actors'' are increasingly exploiting these platforms, becoming a key challenge…

Social and Information Networks · Computer Science 2019-01-09 Sourav Medya , Arlei Silva , Ambuj Singh

Since the structure of complex networks is often unknown, we may identify the most influential seed nodes by exploring only a part of the underlying network, given a small budget for node queries. We propose IM-META, a solution to influence…

Social and Information Networks · Computer Science 2024-02-07 Cong Tran , Won-Yong Shin , Andreas Spitz

In recent years, the exploration of node centrality has received significant attention and extensive investigation, primarily fuelled by its applications in diverse domains such as product recommendations, opinion propagation, disease…

Social and Information Networks · Computer Science 2023-11-23 Renquan Zhang , Ting Wei , Yifan Sun , Sen Pei

A widely studied model of influence diffusion in social networks represents the network as a graph $G=(V,E)$ with an influence threshold $t(v)$ for each node. Initially the members of an initial set $S\subseteq V$ are influenced. During…

Data Structures and Algorithms · Computer Science 2018-07-19 Gennaro Cordasco , Luisa Gargano , Joseph Peters , Adele Anna Rescigno , Ugo Vaccaro

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

In this paper, we study the problem of robust influence maximization in the independent cascade model under a hyperparametric assumption. In social networks users influence and are influenced by individuals with similar characteristics and…

Machine Learning · Computer Science 2019-05-14 Dimitris Kalimeris , Gal Kaplun , Yaron Singer

Online social networks are used to diffuse opinions and ideas among users, enabling a faster communication and a wider audience. The way in which opinions are conditioned by social interactions is usually called social influence. Social…

Social and Information Networks · Computer Science 2019-07-03 Federico Corò , Emilio Cruciani , Gianlorenzo D'Angelo , Stefano Ponziani

Research issues and data mining techniques for product recommendation and viral marketing have been widely studied. Existing works on seed selection in social networks do not take into account the effect of product recommendations in…

Social and Information Networks · Computer Science 2016-02-16 Hui-Ju Hung , Hong-Han Shuai , De-Nian Yang , Liang-Hao Huang , Wang-Chien Lee , Jian Pei , Ming-Syan Chen

We study online influence maximization (OIM) under a new model of decreasing cascade (DC). This model is a generalization of the independent cascade (IC) model by considering the common phenomenon of market saturation. In DC, the chance of…

Social and Information Networks · Computer Science 2023-05-26 Fang Kong , Jize Xie , Baoxiang Wang , Tao Yao , Shuai Li

In a social network, influence maximization is the problem of identifying a set of users that own the maximum {\it influence ability} across the network. In this paper, a novel credit distribution (CD) based model, termed as the…

Social and Information Networks · Computer Science 2018-01-29 Qilian Yu , Hang Li , Yun Liao , Shuguang Cui

Diffusion is a fundamental graph process, underpinning such phenomena as epidemic disease contagion and the spread of innovation by word-of-mouth. We address the algorithmic problem of finding a set of k initial seed nodes in a network so…

Data Structures and Algorithms · Computer Science 2016-06-23 Christian Borgs , Michael Brautbar , Jennifer Chayes , Brendan Lucier

Finding the most influential nodes in a network is a computationally hard problem with several possible applications in various kinds of network-based problems. While several methods have been proposed for tackling the influence…

Social and Information Networks · Computer Science 2022-08-17 Elia Cunegatti , Giovanni Iacca , Doina Bucur

Influence maximization in social networks plays a vital role in applications such as viral marketing, epidemiology, product recommendation, opinion mining, and counter-terrorism. A common approach identifies seed nodes by first detecting…

Social and Information Networks · Computer Science 2025-12-04 Motaz Ben Hassine

Many phenomena in real world social networks are interpreted as spread of influence between activated and non-activated network elements. These phenomena are formulated by combinatorial graphs, where vertices represent the elements and…

Discrete Mathematics · Computer Science 2024-03-01 Siavash Askari , Manouchehr Zaker

In this paper, we study the Budgeted Influence Maximization with Delay Problem, for which the number of literature are limited. We propose an approximate marginal spread computation\mbox{-}based approach for solving this problem. The…

Social and Information Networks · Computer Science 2020-05-26 Suman Banerjee , Mamata Jenamani , Dilip Kumar Pratihar

We study a natural model of coordinated social ad campaigns over a social network, based on models of Datta et al. and Aslay et al. Multiple advertisers are willing to pay the host - up to a known budget - per user exposure, whether the…

Social and Information Networks · Computer Science 2019-12-30 Kartik Lakhotia , David Kempe

Online influence maximization aims to maximize the influence spread of a content in a social network with unknown network model by selecting a few seed nodes. Recent studies followed a non-adaptive setting, where the seed nodes are selected…

Machine Learning · Computer Science 2022-07-01 Kaixuan Huang , Yu Wu , Xuezhou Zhang , Shenyinying Tu , Qingyun Wu , Mengdi Wang , Huazheng Wang

The minimal dominating set (MDS) is a well-established concept in network controllability and has been successfully applied in various domains, including sensor placement, network resilience, and epidemic containment. In this study, we…

Social and Information Networks · Computer Science 2025-09-18 Michał Czuba , Mingshan Jia , Piotr Bródka , Katarzyna Musial

Profit maximization (PM) is to select a subset of users as seeds for viral marketing in online social networks, which balances between the cost and the profit from influence spread. We extend PM to that under the general marketing strategy,…

Social and Information Networks · Computer Science 2021-03-16 Jianxiong Guo , Weili Wu
‹ Prev 1 8 9 10 Next ›