11,971 research outputs found
Follow Whom? Chinese Users Have Different Choice
Sina Weibo, which was launched in 2009, is the most popular Chinese
micro-blogging service. It has been reported that Sina Weibo has more than 400
million registered users by the end of the third quarter in 2012. Sina Weibo
and Twitter have a lot in common, however, in terms of the following
preference, Sina Weibo users, most of whom are Chinese, behave differently
compared with those of Twitter.
This work is based on a data set of Sina Weibo which contains 80.8 million
users' profiles and 7.2 billion relations and a large data set of Twitter.
Firstly some basic features of Sina Weibo and Twitter are analyzed such as
degree and activeness distribution, correlation between degree and activeness,
and the degree of separation. Then the following preference is investigated by
studying the assortative mixing, friend similarities, following distribution,
edge balance ratio, and ranking correlation, where edge balance ratio is newly
proposed to measure balance property of graphs. It is found that Sina Weibo has
a lower reciprocity rate, more positive balanced relations and is more
disassortative. Coinciding with Asian traditional culture, the following
preference of Sina Weibo users is more concentrated and hierarchical: they are
more likely to follow people at higher or the same social levels and less
likely to follow people lower than themselves. In contrast, the same kind of
following preference is weaker in Twitter. Twitter users are open as they
follow people from levels, which accords with its global characteristic and the
prevalence of western civilization. The message forwarding behavior is studied
by displaying the propagation levels, delays, and critical users. The following
preference derives from not only the usage habits but also underlying reasons
such as personalities and social moralities that is worthy of future research.Comment: 9 pages, 13 figure
Optimizing spread dynamics on graphs by message passing
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 applied to describe cascades in a large variety of contexts. Over
the last decades, many efforts have been devoted to understand the typical
behaviour of the cascades arising from initial conditions extracted at random
from some given ensemble. However, the problem of optimizing the trajectory of
the system, i.e. of identifying appropriate initial conditions to maximize (or
minimize) the final number of active nodes, is still considered to be
practically intractable, with the only exception of models that satisfy a sort
of diminishing returns property called submodularity. Submodular models can be
approximately solved by means of greedy strategies, but by definition they lack
cooperative characteristics which are fundamental in many real systems. Here we
introduce an efficient algorithm based on statistical physics for the
optimization of trajectories in cascade processes on graphs. We show that for a
wide class of irreversible dynamics, even in the absence of submodularity, the
spread optimization problem can be solved efficiently on large networks.
Analytic and algorithmic results on random graphs are complemented by the
solution of the spread maximization problem on a real-world network (the
Epinions consumer reviews network).Comment: Replacement for "The Spread Optimization Problem
The Limits of Popularity-Based Recommendations, and the Role of Social Ties
In this paper we introduce a mathematical model that captures some of the
salient features of recommender systems that are based on popularity and that
try to exploit social ties among the users. We show that, under very general
conditions, the market always converges to a steady state, for which we are
able to give an explicit form. Thanks to this we can tell rather precisely how
much a market is altered by a recommendation system, and determine the power of
users to influence others. Our theoretical results are complemented by
experiments with real world social networks showing that social graphs prevent
large market distortions in spite of the presence of highly influential users.Comment: 10 pages, 9 figures, KDD 201
- …