Information diffusion through blogspace
Published 17 May 2004
Daniel Gruhl, R. Guha, David Liben‐Nowell, Andrew Tomkins
Citations1,045
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
A macroscopic characterization of topic propagation through the authors' corpus is presented, formalizing the notion of long-running "chatter" topics consisting recursively of "spike" topics generated by outside world events, or more rarely, by resonances within the community.
Abstract
We study the dynamics of information propagation in environments of low-overhead personal publishing, using a large collection of weblogs over time as our example domain. We characterize and model this collection at two levels. First, we present a macroscopic characterization of topic propagation through our corpus, formalizing the notion of long-running chatter topics consisting recursively of spike topics generated by outside world events, or more rarely, by resonances within the community. Second, we present a microscopic characterization of propagation from individual to individual, drawing on the theory of infectious diseases to model the flow. We propose, validate, and employ an algorithm to induce the underlying propagation network from a sequence of posts, and report on the results.
Keywords
Computer SciencePhysics and Astronomy
Journal of the Royal Statistical Society Series B (Statistical Methodology)Maximum Likelihood from Incomplete Data Via the <i>EM</i> Algorithm
49,657 Citations1977A. P. Dempster, N. M. Laird +1 more
NatureCollective dynamics of ‘small-world’ networks
43,160 Citations1998Duncan J. Watts, Steven H. Strogatz
Simple models of networks that can be tuned through this middle ground: regular networks ‘rewired’ to introduce increasing amounts of disorder are explored, finding that these systems can be highly clustered, like regular lattices, yet have small characteristic path lengths, like random graphs.
Maximizing the spread of influence through a social network
7,314 Citations2003David Kempe, Jon Kleinberg +1 more
An analysis framework based on submodular functions shows that a natural greedy strategy obtains a solution that is provably within 63% of optimal for several classes of models, and suggests a general approach for reasoning about the performance guarantees of algorithms for these types of influence problems in social networks.
American Journal of SociologyThreshold Models of Collective Behavior
5,862 Citations1978Mark Granovetter
Physical Review LettersEpidemic Spreading in Scale-Free Networks
5,770 Citations2001Romualdo Pastor‐Satorras, Alessandro Vespignani
A dynamical model for the spreading of infections on scale-free networks is defined, finding the absence of an epidemic threshold and its associated critical behavior and this new epidemiological framework rationalizes data of computer viruses and could help in the understanding of other spreading phenomena on communication and social networks.
Mining sequential patterns
5,115 Citations2002R. K. Agrawal, Ramakrishnan Srikant
Three algorithms are presented to solve the problem of mining sequential patterns over databases of customer transactions, and empirically evaluating their performance using synthetic data shows that two of them have comparable performance.
Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topicsSpread of epidemic disease on networks
3,285 Citations2002M. E. J. Newman
This paper shows that a large class of standard epidemiological models, the so-called susceptible/infective/removed (SIR) models can be solved exactly on a wide variety of networks.
Interactive MarketingThe Tipping Point: How Little Things Can Make a Big Difference
3,066 Citations2004Danny Meadows-Klue
Marketing LettersTalk of the Network: A Complex Systems Look at the Underlying Process of Word-of-Mouth
1,995 Citations2001Jacob Goldenberg, Barak Libai +1 more
The results clearly indicate that information dissemination is dominated by both weak and strong w-o-m, rather than by advertising, which means that strong and weak ties become the main forces propelling growth.
Sync: The Emerging Science of Spontaneous Order
1,240 Citations2003Steven H. Strogatz
Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topicsEpidemics and percolation in small-world networks
936 Citations2000Cristopher Moore, M. E. J. Newman
The resulting models display epidemic behavior when the infection or transmission probability rises above the threshold for site or bond percolation on the network, and are given exact solutions for the position of this threshold in a variety of cases.
Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topicsEmail networks and the spread of computer viruses
796 Citations2002M. E. J. Newman, Stephanie Forrest +1 more
Empirically the structure of this network of connections between individuals over which the virus spreads is investigated using data drawn from a large computer installation, and the implications for the understanding and prevention of computer virus epidemics are discussed.
Topic detection and tracking: event-based information organization
682 Citations2002James Allan
This chapter defines the basic concepts of TDT and provides historical context for the concepts and provides an overview of the technical approaches that have been used and that have succeeded.
On the bursty evolution of blogspace
561 Citations2003Ravi Kumar, Jasmine Novak +2 more
Physical Review LettersEpidemic Threshold in Structured Scale-Free Networks
353 Citations2002Vı́ctor M. Eguı́luz, Konstantin Klemm
A quantitative description of the epidemic threshold based on the connectivity of the neighborhoods of the hubs is introduced and verified, suggesting that high clustering (modularity) and degree correlations protect scale-free networks against the spreading of viruses.
Physica A Statistical Mechanics and its ApplicationsInformation flow in social groups
312 Citations2004Fang Wu, Bernardo A. Huberman +2 more
A study of information flow that takes into account the observation that an item relevant to one person is more likely to be of interest to individuals in the same social circle than those outside of it due to the fact that the similarity of node attributes in social networks decreases as a function of the graph distance.
Internet MathematicsRobustness and Vulnerability of Scale-Free Random Graphs
279 Citations2004Béla Bollobás, Oliver Riordan
It is shown that the LCD graph is much more robust than classical random graphs with the same number of edges, but also more vulnerable to attack, namely robustness to random damage, and vulnerability to malicious attack.
A strategic analysis of network reliability
115 Citations2003Balasubramanian Venkatesh, Sanjeev Goyal
Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topicsSimple model of epidemics with pathogen mutation
100 Citations2002Michelle Girvan, Duncan S. Callaway +2 more
The main result is that pathogens in highly connected populations must mutate rapidly in order to remain viable.
Econstor (Econstor)Nash Networks with Heterogeneous Agents 1
60 Citations2002Hans Haller, Sudipta Sarangi