About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
KDD 2010
Workshop paper
Generative models for rapid information propagation
Abstract
We consider the dynamics of rapid propagation of information in complex social networks focusing on mobile phone networks. We introduce two models for an information propagation process. The first model describes the temporal behavior of people which leads to the emergence of information propagation events and is based on the existence of two types of subscribers: regular subscribers and subscribers that tend to spread information. The second model describes the topology of paths in which the information propagates from one subscriber to another. We further introduce an efficient algorithm for identification of information propagation events. We then apply our algorithm to a large-scale mobile phone network and demonstrate the correspondence between theoretical expectations and the actual results. Copyright 2010 ACM.