Recommending links through influence maximization

DOI10.1016/J.TCS.2018.01.017MaRDI QIDQ1731508zbMATH OpenOpenAlexWikidataFDO

Authors Gianlorenzo D'Angelo, Lorenzo Severini, Yllka Velaj

Publication date 13 March 2019

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1706.04368

zbMATH Keywords

approximation algorithmcomplex networksindependent cascade modelinformation diffusionnetwork augmentation

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Internet topics (68M11) Graph theory (including graph drawing) in computer science (68R10) Computing methodologies for information systems (hypertext navigation, interfaces, decision support, etc.) (68U35) Approximation algorithms (68W25) Social networks; opinion dynamics (91D30)

Abstract: The link recommendation problem consists in suggesting a set of links to the users of a social network in order to increase their social circles and the connectivity of the network. Link recommendation is extensively studied in the context of social networks and of general complex networks due to its wide range of applications. Most of the existing link recommendation methods estimate the likelihood that a link is adopted by users and recommend links that are likely to be established. However, most of such methods overlook the impact that the suggested links have on the capability of the network to spread information. Indeed, such capability is directly correlated with both the engagement of a single user and the revenue of online social networks. In this paper, we study link recommendation systems from the point of view of information diffusion. In detail, we consider the problem in which we are allowed to spend a given budget to create new links so to suggest a bounded number of possible persons to whom become friend in order to maximize the influence of a given set of nodes. We model the influence diffusion in a network with the popular Independent Cascade model.

Recommendations

• Boosting node activity by recommendations in social networks
• scientific article; zbMATH DE number 6474901
• Automata, Languages and Programming
• scientific article; zbMATH DE number 7204409
• Efficient influence maximization under TSCM: a suitable diffusion model in online social networks

Cites work

• A threshold of ln n for approximating set cover
• An analysis of approximations for maximizing submodular set functions—I
• Directed scale-free graphs
• scientific article; zbMATH DE number 6474901 (Why is no real title available?)
• scientific article; zbMATH DE number 7204409 (Why is no real title available?)
• The budgeted maximum coverage problem
• The design of approximation algorithms

Cited in

(11)

• A new algorithm for positive influence maximization in signed networks
• Generalized budgeted submodular set function maximization
• Link prediction techniques, applications, and performance: a survey
• Positive influence maximization in signed social networks under independent cascade model
• A unified task recommendation strategy for realistic mobile crowdsourcing system
• Influence maximization in the presence of vulnerable nodes: a ratio perspective
• Information spread in recommendation systems
• Generalized budgeted submodular set function maximization
• Unifying Online and Offline Preference for Social Link Prediction
• scientific article; zbMATH DE number 7204409 (Why is no real title available?)
• Opinion maximization in social networks via link recommendation

This page was built for publication: Recommending links through influence maximization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1731508)