English
Related papers

Related papers: On Multi-Cascade Influence Maximization: Model, Ha…

200 papers

For the purpose of propagating information and ideas through a social network, a seeding strategy aims to find a small set of seed users that are able to maximize the spread of the influence, which is termed as influence maximization…

Social and Information Networks · Computer Science 2016-07-05 Guangmo Tong , Weili Wu , Shaojie Tang , Ding-Zhu Du

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

The Independent Cascade Model (ICM) is a widely studied model that aims to capture the dynamics of the information diffusion in social networks and in general complex networks. In this model, we can distinguish between active nodes which…

Data Structures and Algorithms · Computer Science 2017-06-21 Gianlorenzo D'Angelo , Lorenzo Severini , Yllka Velaj

Influence Maximization(IM) aims to identify highly influential nodes to maximize influence spread in a network. Previous research on the IM problem has mainly concentrated on single-layer networks, disregarding the comprehension of the…

Physics and Society · Physics 2023-11-16 Su-Su Zhang , Ming Xie , Chuang Liu , Xiu-Xiu Zhan

We study the problem of robust influence maximization in dynamic diffusion networks. In line with recent works, we consider the scenario where the network can undergo insertion and removal of nodes and edges, in discrete time steps, and the…

Databases · Computer Science 2024-12-17 Arkaprava Saha , Bogdan Cautis , Xiaokui Xiao , Laks V. S. Lakshmanan

Influence maximization aims to find a subset of seeds that maximize the influence spread under a given budget. In this paper, we mainly address the data-driven version of this problem, where the diffusion model is not given but needs to be…

Social and Information Networks · Computer Science 2023-11-21 Yuxin Zuo , Haojia Sun , Yongyi Hu , Jianxiong Guo , Xiaofeng Gao

We consider the problem of maximizing the spread of influence in a social network by choosing a fixed number of initial seeds, formally referred to as the influence maximization problem. It admits a $(1-1/e)$-factor approximation algorithm…

Social and Information Networks · Computer Science 2022-06-15 Grant Schoenebeck , Biaoshuai Tao

Influence maximization is the task of finding a set of seed nodes in a social network such that the influence spread of these seed nodes based on certain influence diffusion model is maximized. Topic-aware influence diffusion models have…

Social and Information Networks · Computer Science 2014-11-24 Wei Chen , Tian Lin , Cheng Yang

In this paper, we revisit the problem of influence maximization with fairness, which aims to select k influential nodes to maximise the spread of information in a network, while ensuring that selected sensitive user attributes are fairly…

Social and Information Networks · Computer Science 2023-06-07 Yuting Feng , Ankitkumar Patel , Bogdan Cautis , Hossein Vahabi

Influence Maximization (IM) seeks to identify a small set of seed nodes in a social network to maximize expected information spread under a diffusion model. While community-based approaches improve scalability by exploiting modular…

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

The classic influence maximization problem finds a limited number of influential seed users in a social network such that the expected number of influenced users in the network, following an influence cascade model, is maximized. The…

Social and Information Networks · Computer Science 2019-10-29 Kaivalya Rawal , Arijit Khan

We study the task of selecting $k$ nodes, in a social network of size $n$, to seed a diffusion with maximum expected spread size, under the independent cascade model with cascade probability $p$. Most of the previous work on this problem…

Social and Information Networks · Computer Science 2022-05-24 Dean Eckles , Hossein Esfandiari , Elchanan Mossel , M. Amin Rahimian

The study of continuous-time information diffusion has been an important area of research for many applications in recent years. When only the diffusion traces (cascades) are accessible, cascade-based network inference and influence…

Social and Information Networks · Computer Science 2024-05-22 Keke Huang , Ruize Gao , Bogdan Cautis , Xiaokui Xiao

The Influence Maximization problem under the Independent Cascade model (IC) is considered. The problem asks for a minimal set of vertices to serve as "seed set" from which a maximum influence propagation is expected. New seed-set selection…

Social and Information Networks · Computer Science 2024-01-02 Faisal N. Abu-Khzam , Ghinwa Bou Matar , Sergio Thoumi

In many complex networked systems, such as online social networks, activity originates at certain nodes and subsequently spreads on the network through influence. In this work, we consider the problem of modeling the spread of influence and…

Social and Information Networks · Computer Science 2017-07-18 Arun Sathanur , Mahantesh Halappanavar , Yi Shi , Walin Sagduyu

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

Influence maximization (IM) is an important topic in network science where a small seed set is chosen to maximize the spread of influence on a network. Recently, this problem has attracted attention on temporal networks where the network…

Social and Information Networks · Computer Science 2023-07-04 Eric Yanchenko , Tsuyoshi Murata , Petter Holme

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

In a social network, even about the same information the excitements between different pairs of users are different. If you want to spread a piece of new information and maximize the expected total amount of excitements, which seed users…

Social and Information Networks · Computer Science 2016-10-26 Zhefeng Wang , Yu Yang , Jian Pei , Enhong Chen

The problem of selecting an optimal seed set to maximise influence in networks has been a subject of intense research in recent years. However, despite numerous works addressing this area, it remains a topic that requires further…

Social and Information Networks · Computer Science 2025-04-16 Michał Czuba , Piotr Bródka