中文
相关论文

相关论文: Maximizing spreading influence via measuring influ…

200 篇论文

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…

社会与信息网络 · 计算机科学 2023-11-21 Yuxin Zuo , Haojia Sun , Yongyi Hu , Jianxiong Guo , Xiaofeng Gao

Identifying super-spreaders can be framed as a subtask of the influence maximisation problem. It seeks to pinpoint agents within a network that, if selected as single diffusion seeds, disseminate information most effectively. Multilayer…

社会与信息网络 · 计算机科学 2025-10-27 Michał Czuba , Mateusz Stolarski , Adam Piróg , Piotr Bielak , Piotr Bródka

We consider the problem of identifying the most influential nodes for a spreading process on a network when prior knowledge about structure and dynamics of the system is incomplete or erroneous. Specifically, we perform a numerical analysis…

物理与社会 · 物理学 2018-10-09 Şirag Erkol , Ali Faqeeh , Filippo Radicchi

Recent years have seen a marked increase in the spread of misinformation, a phenomenon which has been accelerated and amplified by social media such as Facebook and Twitter. While some actors spread misinformation to push a specific agenda,…

社会与信息网络 · 计算机科学 2020-04-10 Mayee F. Chen , Miklos Z. Racz

Detecting spreading outbreaks in social networks with sensors is of great significance in applications. Inspired by the formation mechanism of human's physical sensations to external stimuli, we propose a new method to detect the influence…

物理与社会 · 物理学 2017-02-08 Sen Pei , Shaoting Tang , Zhiming Zheng

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…

数据库 · 计算机科学 2024-12-17 Arkaprava Saha , Bogdan Cautis , Xiaokui Xiao , Laks V. S. Lakshmanan

Dynamic influence maximization problem (DIMP) aims to maintain a group of influential users within an evolving social network, so that the influence scope can be maximized at any given moment. A primary category of DIMP algorithms focuses…

社会与信息网络 · 计算机科学 2023-11-28 Shaofeng Zhang , Shengcai Liu , Ke Tang

The identification of the minimal set of nodes that maximizes the propagation of information is one of the most relevant problems in network science. In this paper, we introduce a new method to find the set of initial spreaders to maximize…

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…

社会与信息网络 · 计算机科学 2017-08-29 Siwar Jendoubi , Arnaud Martin

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…

机器学习 · 计算机科学 2022-07-01 Kaixuan Huang , Yu Wu , Xuezhou Zhang , Shenyinying Tu , Qingyun Wu , Mengdi Wang , Huazheng Wang

We consider the problem of maximizing the spread of influence in a social network by choosing a fixed number of initial seeds --- a central problem in the study of network cascades. The majority of existing work on this problem, formally…

社会与信息网络 · 计算机科学 2016-09-22 Rico Angell , Grant Schoenebeck

In this paper, we address the important issue of uncertainty in the edge influence probability estimates for the well studied influence maximization problem --- the task of finding $k$ seed nodes in a social network to maximize the…

社会与信息网络 · 计算机科学 2016-06-14 Wei Chen , Tian Lin , Zihan Tan , Mingfei Zhao , Xuren Zhou

Influence diagnosis is an integrated component of data analysis, but is severely under-investigated in a high-dimensional setting. One of the key challenges, even in a fixed-dimensional setting, is how to deal with multiple influential…

统计方法学 · 统计学 2017-02-07 Junlong Zhao , Chao Liu , Lu Niu , Chenlei Leng

Influence maximization aims to identify a set of influential individuals, referred to as influencers, as information sources to maximize the spread of information within networks, constituting a vital combinatorial optimization problem with…

社会与信息网络 · 计算机科学 2024-05-16 Wenfeng Shi , Tianlong Fan , Shuqi Xu , Rongmei Yang , Linyuan Lü

We study the spread of influence in a social network based on the Linear Threshold model. We derive an analytical expression for evaluating the expected size of the eventual influenced set for a given initial set, using the probability of…

其他计算机科学 · 计算机科学 2010-02-09 Srinivasan Venkatramanan , Anurag Kumar

Online social networks have become an important platform for people to communicate, share knowledge and disseminate information. Given the widespread usage of social media, individuals' ideas, preferences and behavior are often influenced…

社会与信息网络 · 计算机科学 2023-09-12 Hui Li , Susu Yang , Mengting Xu , Sourav S Bhowmick , Jiangtao Cui

In complex networks there are overlapping substructures or "circles" that consist of nodes belonging to multiple cohesive subgroups. Yet the role of these overlapping nodes in influence spreading processes remains underexplored. In the…

社会与信息网络 · 计算机科学 2026-03-12 Kosti Koistinen , Vesa Kuikka , Kimmo Kaski

A typical viral marketing model identifies influential users in a social network to maximize a single product adoption assuming unlimited user attention, campaign budgets, and time. In reality, multiple products need campaigns, users have…

社会与信息网络 · 计算机科学 2017-01-31 Nan Du , Yingyu Liang , Maria-Florina Balcan , Manuel Gomez-Rodriguez , Hongyuan Zha , Le Song

The least cost influence maximization problem aims to determine minimum cost of partial (e.g., monetary) incentives initially given to the influential spreaders on a social network, so that these early adopters exert influence toward their…

最优化与控制 · 数学 2022-09-28 Cheng-Lung Chen , Eduardo Pasiliao , Vladimir Boginski

The whole frame of interconnections in complex networks hinges on a specific set of structural nodes, much smaller than the total size, which, if activated, would cause the spread of information to the whole network [1]; or, if immunized,…

物理与社会 · 物理学 2015-08-27 Flaviano Morone , Hernan A. Makse