中文
相关论文

相关论文: Revisiting Non-Progressive Influence Models: Scala…

200 篇论文

In recent years, social networking platforms have gained significant popularity among the masses like connecting with people and propagating ones thoughts and opinions. This has opened the door to user-specific advertisements and…

社会与信息网络 · 计算机科学 2022-11-18 Aaryan Gupta , Inder Khatri , Arjun Choudhry , Pranav Chandhok , Dinesh Kumar Vishwakarma , Mukesh Prasad

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…

社会与信息网络 · 计算机科学 2019-10-29 Kaivalya Rawal , Arijit Khan

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…

社会与信息网络 · 计算机科学 2024-02-07 Cong Tran , Won-Yong Shin , Andreas Spitz

The ubiquity of social platforms has reshaped the way information, behaviors, and advertisements diffuse across networks, with influence propagation often initiated by a small set of ``seed'' users. While much of the literature emphasizes…

社会与信息网络 · 计算机科学 2026-05-28 Fangzhu Shen , Amir Gilad , Sudeepa Roy

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

Influence maximization (IM) is the task of finding the most important nodes in order to maximize the spread of influence or information on a network. This task is typically studied on static or temporal networks where the complete topology…

社会与信息网络 · 计算机科学 2023-09-13 Eric Yanchenko , Tsuyoshi Murata , Petter Holme

We identify influential early adopters in a social network, where individuals are resource constrained, to maximize the spread of multiple, costly behaviors. A solution to this problem is especially important for viral marketing. The…

社会与信息网络 · 计算机科学 2017-02-08 Kaushik Sarkar , Hari Sundaram

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…

社会与信息网络 · 计算机科学 2025-04-16 Michał Czuba , Piotr Bródka

Nowadays, people in the modern world communicate with their friends, relatives, and colleagues through the internet. Persons/nodes and communication/edges among them form a network. Social media networks are a type of network where people…

社会与信息网络 · 计算机科学 2025-07-01 Rahul Kumar Gautam

Influence diffusion has been central to the study of propagation of information in social networks, where influence is typically modeled as a binary property of entities: influenced or not influenced. We introduce the notion of attitude,…

社会与信息网络 · 计算机科学 2020-10-27 Xiaoyun Fu , Madhavan Rajagopal Padmanabhan , Raj Gaurav Kumar , Samik Basu , Shawn Dorius , Pavan Aduri

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.…

社会与信息网络 · 计算机科学 2019-04-30 Maryam Adineh , Mostafa Nouri-Baygi

Motivated by applications such as viral marketing, the problem of influence maximization (IM) has been extensively studied in the literature. The goal is to select a small number of users to adopt an item such that it results in a large…

社会与信息网络 · 计算机科学 2019-06-03 Prithu Banerjee , Wei Chen , Laks V. S. Lakshmanan

Although influence maximization problem has been extensively studied over the past ten years, majority of existing work adopt one of the following models: \emph{full-feedback model} or \emph{zero-feedback model}. In the zero-feedback model,…

社会与信息网络 · 计算机科学 2019-04-23 Jing Yuan , Shaojie Tang

Influence maximization (IM) is formulated as selecting a set of initial users from a social network to maximize the expected number of influenced users. Researchers have made great progress in designing various traditional methods, and…

社会与信息网络 · 计算机科学 2023-05-09 Chen Ling , Junji Jiang , Junxiang Wang , My Thai , Lukas Xue , James Song , Meikang Qiu , Liang Zhao

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…

社会与信息网络 · 计算机科学 2025-12-04 Motaz Ben Hassine

Identifying influential nodes is crucial in social network analysis. Existing methods often neglect local opinion leader tendencies, resulting in overlapping influence ranges for seed nodes. Furthermore, approaches based on vanilla graph…

社会与信息网络 · 计算机科学 2025-08-15 Ronghua Lin , Runbin Yao , Yijia Wang , Junjie Lin , Zhengyang Wu , Yong Tang

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…

社会与信息网络 · 计算机科学 2023-06-07 Yuting Feng , Ankitkumar Patel , Bogdan Cautis , Hossein Vahabi

Influence maximization (IM) aims to select a small number of nodes that are able to maximize their influence in a network and covers a wide range of applications. Despite numerous attempts to provide effective solutions in ordinary…

物理与社会 · 物理学 2023-10-25 Ming Xie , Xiu-Xiu Zhan , Chuang Liu , Zi-Ke Zhang

A social network (SN) is a social structure consisting of a group representing the interaction between them. SNs have recently been widely used and, subsequently, have become suitable and popular platforms for product promotion and…

社会与信息网络 · 计算机科学 2022-09-13 Saeid Ghafouri , Seyed Hossein Khasteh , Seyed Omid Azarkasb

We consider the problem of selecting $k$ seed nodes in a network to maximize the minimum probability of activation under an independent cascade beginning at these seeds. The motivation is to promote fairness by ensuring that even the least…