English
Related papers

Related papers: Diffusion in Social Networks with Competing Produc…

200 papers

Influence maximization (IM) aims at maximizing the spread of influence by offering discounts to influential users (called seeding). In many applications, due to user's privacy concern, overwhelming network scale etc., it is hard to target…

Social and Information Networks · Computer Science 2020-10-06 Chen Feng , Luoyi Fu , Bo Jiang , Haisong Zhang , Xinbing Wang , Feilong Tang , Guihai Chen

Fads, product adoption, mobs, rumors, memes, and emergent norms are diverse social contagions that have been modeled as network cascades. Empirical study of these cascades is vulnerable to what we describe as the "opacity problem": the…

Social and Information Networks · Computer Science 2018-11-21 George Berry , Christopher J. Cameron , Patrick Park , Michael W. Macy

Among all characteristics exhibited by natural and man-made networks the small-world phenomenon is surely the most relevant and popular. But despite its significance, a reliable and comparable quantification of the question `how small is a…

Physics and Society · Physics 2019-11-27 Gorka Zamora-López , Romain Brasselet

Many real-world processes evolve in cascades over complex networks, whose topologies are often unobservable and change over time. However, the so-termed adoption times when blogs mention popular news items, individuals in a community catch…

Social and Information Networks · Computer Science 2013-09-30 Brian Baingana , Gonzalo Mateos , Georgios B. Giannakis

Diffusion on complex networks is often modeled as a stochastic process. Yet, recent work on strategic diffusion emphasizes the decision power of agents and treats diffusion as a strategic problem. Here we study the computational aspects of…

Computational Complexity · Computer Science 2020-01-31 Marcin Waniek , Khaled Elbassioni , Flavio L. Pinheiro , Cesar A. Hidalgo , Aamena Alshamsi

Our research problems can be understood with the following metaphor: In Facebook or Twitter, suppose Mike decides to send a message to a friend Jack, and Jack next decides to pass the message to one of his own friends Mary, and the process…

Social and Information Networks · Computer Science 2023-04-04 Ricky X. F. Chen

We consider the following multi--level opinion spreading model on networks. Initially, each node gets a weight from the set [0..k-1], where such a weight stands for the individuals conviction of a new idea or product. Then, by proceeding to…

Social and Information Networks · Computer Science 2012-09-27 Sara Brunetti , Gennaro Cordasco , Luisa Gargano , Elena Lodi , Walter Quattrociocchi

Alice wants to join a new social network, and influence its members to adopt a new product or idea. Each person $v$ in the network has a certain threshold $t(v)$ for {\em activation}, i.e adoption of the product or idea. If $v$ has at least…

Data Structures and Algorithms · Computer Science 2016-11-30 Gennaro Cordasco , Luisa Gargano , Manuel Lafond , Lata Narayanan , Adele A. Rescigno , Ugo Vaccaro , Kangkang Wu

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 adoption of individual behavioural patterns is largely determined by stimuli arriving from peers via social interactions or from external sources. Based on these influences, individuals are commonly assumed to follow simple or complex…

Computers and Society · Computer Science 2024-06-28 Elsa Andres , Gergely Ódor , Iacopo Iacopini , Márton Karsai

In this paper, we study the adversarial attacks on influence maximization under dynamic influence propagation models in social networks. In particular, given a known seed set S, the problem is to minimize the influence spread from S by…

Social and Information Networks · Computer Science 2022-12-20 Lichao Sun , Xiaobin Rui , Wei Chen

We study probabilistic protocols for concurrent threshold-based load balancing in networks. There are n resources or machines represented by nodes in an undirected graph and m >> n users that try to find an acceptable resource by moving…

Data Structures and Algorithms · Computer Science 2013-06-07 Martin Hoefer , Thomas Sauerwald

Network reliability measures the probability that a target node is reachable from a source node in an uncertain graph, i.e., a graph where every edge is associated with a probability of existence. In this paper, we investigate the novel and…

Databases · Computer Science 2020-05-26 Xiangyu Ke , Arijit Khan , Mohammad Al Hasan , Rojin Rezvansangsari

Communities are not static; they evolve, split and merge, appear and disappear, i.e. they are product of dynamical processes that govern the evolution of the network. A good algorithm for community detection should not only quantify the…

Physics and Society · Physics 2011-11-24 Angel Stanoev , Daniel Smilkov , Ljupco Kocarev

Predicting the occurrence of links is a fundamental problem in networks. In the link prediction problem we are given a snapshot of a network and would like to infer which interactions among existing members are likely to occur in the near…

Social and Information Networks · Computer Science 2010-11-19 L. Backstrom , J. Leskovec

In the problem of influence maximization in information networks, the objective is to choose a set of initially active nodes subject to some budget constraints such that the expected number of active nodes over time is maximized. The linear…

Social and Information Networks · Computer Science 2016-11-06 T. -H. Hubert Chan , Li Ning

When a new product enters a market already dominated by an existing product, will it survive along with this dominant product? Most of the existing works have shown the coexistence of two competing products spreading/being adopted on…

Systems and Control · Electrical Eng. & Systems 2024-04-01 Shailaja Mallick , Vishwaraj Doshi , Do Young Eun

The operation of adding edges has been frequently used to the study of opinion dynamics in social networks for various purposes. In this paper, we consider the edge addition problem for the DeGroot model of opinion dynamics in a social…

Social and Information Networks · Computer Science 2021-06-14 Xiaotian Zhou , Zhongzhi Zhang

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

Social and Information Networks · Computer Science 2019-04-30 Maryam Adineh , Mostafa Nouri-Baygi

Cascade processes are responsible for many important phenomena in natural and social sciences. Simple models of irreversible dynamics on graphs, in which nodes activate depending on the state of their neighbors, have been successfully…

Disordered Systems and Neural Networks · Physics 2013-09-16 Fabrizio Altarelli , Alfredo Braunstein , Luca Dall'Asta , Riccardo Zecchina