53,883 research outputs found
Influence of Structure Parameters on the Information Diffusion Process in Virtual Networks
This paper examines the effects of composition, size and structure of virtual networks on the diffusion of information. The research extends the Axelrod cultural model (ACM), an established theory rooted in political science research, to explain information dissemination among social actors in ICT-enabled virtual networks (Axelrod 1997). The investigation is focused on the impact of network structure parameters and gives insight on how a manipulation of those parameters influences the diffusion of information in virtual networks
Correlated Cascades: Compete or Cooperate
In real world social networks, there are multiple cascades which are rarely
independent. They usually compete or cooperate with each other. Motivated by
the reinforcement theory in sociology we leverage the fact that adoption of a
user to any behavior is modeled by the aggregation of behaviors of its
neighbors. We use a multidimensional marked Hawkes process to model users
product adoption and consequently spread of cascades in social networks. The
resulting inference problem is proved to be convex and is solved in parallel by
using the barrier method. The advantage of the proposed model is twofold; it
models correlated cascades and also learns the latent diffusion network.
Experimental results on synthetic and two real datasets gathered from Twitter,
URL shortening and music streaming services, illustrate the superior
performance of the proposed model over the alternatives
From sparse to dense and from assortative to disassortative in online social networks
Inspired by the analysis of several empirical online social networks, we
propose a simple reaction-diffusion-like coevolving model, in which individuals
are activated to create links based on their states, influenced by local
dynamics and their own intention. It is shown that the model can reproduce the
remarkable properties observed in empirical online social networks; in
particular, the assortative coefficients are neutral or negative, and the power
law exponents are smaller than 2. Moreover, we demonstrate that, under
appropriate conditions, the model network naturally makes transition(s) from
assortative to disassortative, and from sparse to dense in their
characteristics. The model is useful in understanding the formation and
evolution of online social networks.Comment: 10 pages, 7 figures and 2 table
Seeds Buffering for Information Spreading Processes
Seeding strategies for influence maximization in social networks have been
studied for more than a decade. They have mainly relied on the activation of
all resources (seeds) simultaneously in the beginning; yet, it has been shown
that sequential seeding strategies are commonly better. This research focuses
on studying sequential seeding with buffering, which is an extension to basic
sequential seeding concept. The proposed method avoids choosing nodes that will
be activated through the natural diffusion process, which is leading to better
use of the budget for activating seed nodes in the social influence process.
This approach was compared with sequential seeding without buffering and single
stage seeding. The results on both real and artificial social networks confirm
that the buffer-based consecutive seeding is a good trade-off between the final
coverage and the time to reach it. It performs significantly better than its
rivals for a fixed budget. The gain is obtained by dynamic rankings and the
ability to detect network areas with nodes that are not yet activated and have
high potential of activating their neighbours.Comment: Jankowski, J., Br\'odka, P., Michalski, R., & Kazienko, P. (2017,
September). Seeds Buffering for Information Spreading Processes. In
International Conference on Social Informatics (pp. 628-641). Springe
The Impact of Social Curiosity on Information Spreading on Networks
Most information spreading models consider that all individuals are identical
psychologically. They ignore, for instance, the curiosity level of people,
which may indicate that they can be influenced to seek for information given
their interest. For example, the game Pok\'emon GO spread rapidly because of
the aroused curiosity among users. This paper proposes an information
propagation model considering the curiosity level of each individual, which is
a dynamical parameter that evolves over time. We evaluate the efficiency of our
model in contrast to traditional information propagation models, like SIR or
IC, and perform analysis on different types of artificial and real-world
networks, like Google+, Facebook, and the United States roads map. We present a
mean-field approach that reproduces with a good accuracy the evolution of
macroscopic quantities, such as the density of stiflers, for the system's
behavior with the curiosity. We also obtain an analytical solution of the
mean-field equations that allows to predicts a transition from a phase where
the information remains confined to a small number of users to a phase where it
spreads over a large fraction of the population. The results indicate that the
curiosity increases the information spreading in all networks as compared with
the spreading without curiosity, and that this increase is larger in spatial
networks than in social networks. When the curiosity is taken into account, the
maximum number of informed individuals is reached close to the transition
point. Since curious people are more open to a new product, concepts, and
ideas, this is an important factor to be considered in propagation modeling.
Our results contribute to the understanding of the interplay between diffusion
process and dynamical heterogeneous transmission in social networks.Comment: 8 pages, 5 figure
- …