13,114 research outputs found
Cascading Behavior in Large Blog Graphs
How do blogs cite and influence each other? How do such links evolve? Does
the popularity of old blog posts drop exponentially with time? These are some
of the questions that we address in this work. Our goal is to build a model
that generates realistic cascades, so that it can help us with link prediction
and outlier detection.
Blogs (weblogs) have become an important medium of information because of
their timely publication, ease of use, and wide availability. In fact, they
often make headlines, by discussing and discovering evidence about political
events and facts. Often blogs link to one another, creating a publicly
available record of how information and influence spreads through an underlying
social network. Aggregating links from several blog posts creates a directed
graph which we analyze to discover the patterns of information propagation in
blogspace, and thereby understand the underlying social network. Not only are
blogs interesting on their own merit, but our analysis also sheds light on how
rumors, viruses, and ideas propagate over social and computer networks.
Here we report some surprising findings of the blog linking and information
propagation structure, after we analyzed one of the largest available datasets,
with 45,000 blogs and ~ 2.2 million blog-postings. Our analysis also sheds
light on how rumors, viruses, and ideas propagate over social and computer
networks. We also present a simple model that mimics the spread of information
on the blogosphere, and produces information cascades very similar to those
found in real life
New activity pattern in human interactive dynamics
We investigate the response function of human agents as demonstrated by
written correspondence, uncovering a new universal pattern for how the reactive
dynamics of individuals is distributed across the set of each agent's contacts.
In long-term empirical data on email, we find that the set of response times
considered separately for the messages to each different correspondent of a
given writer, generate a family of heavy-tailed distributions, which have
largely the same features for all agents, and whose characteristic times grow
exponentially with the rank of each correspondent. We furthermore show that
this universal behavioral pattern emerges robustly by considering weighted
moving averages of the priority-conditioned response-time probabilities
generated by a basic prioritization model. Our findings clarify how the range
of priorities in the inputs from one's environment underpin and shape the
dynamics of agents embedded in a net of reactive relations. These newly
revealed activity patterns might be present in other general interactive
environments, and constrain future models of communication and interaction
networks, affecting their architecture and evolution.Comment: 15 pages, 7 figure
A framework for evaluating statistical dependencies and rank correlations in power law graphs
We analyze dependencies in power law graph data (Web sample, Wikipedia sample and a preferential attachment graph) using statistical inference for multivariate regular variation. To the best of our knowledge, this is the first attempt to apply the well developed theory of regular variation to graph data. The new insights this yields are striking: the three above-mentioned data sets are shown to have a totally different dependence structure between different graph parameters, such as in-degree and PageRank. Based on the proposed methodology, we suggest a new measure for rank correlations. Unlike most known methods, this measure is especially sensitive to rank permutations for topranked nodes. Using this method, we demonstrate that the PageRank ranking is not sensitive to moderate changes in the damping factor
Waiting time dynamics of priority-queue networks
We study the dynamics of priority-queue networks, generalizations of the
binary interacting priority queue model introduced by Oliveira and Vazquez
[Physica A {\bf 388}, 187 (2009)]. We found that the original AND-type protocol
for interacting tasks is not scalable for the queue networks with loops because
the dynamics becomes frozen due to the priority conflicts. We then consider a
scalable interaction protocol, an OR-type one, and examine the effects of the
network topology and the number of queues on the waiting time distributions of
the priority-queue networks, finding that they exhibit power-law tails in all
cases considered, yet with model-dependent power-law exponents. We also show
that the synchronicity in task executions, giving rise to priority conflicts in
the priority-queue networks, is a relevant factor in the queue dynamics that
can change the power-law exponent of the waiting time distribution.Comment: 5 pages, 3 figures, minor changes, final published versio
- …