Information flows are the result of a constant exchange in Online Social Networks (OSNs). OSN users create and share varying types of information in real-time throughout a day. Virality is introduced as a term to describe information that reaches a wide audience within a small time-frame. As a case, we measure propagation of information submitted in Reddit, identify different patterns and present a multi OSN diffusion analysis on Twitter, Facebook, and 2 hosting domains for images and multimedia, ImgUr and YouTube. Our results indicate that positive content is the most shared and presents the highest virality probability, and the overall virality probability of user created information is low. Finally, we underline the problems of limited access in OSN data. Keywords: Online Social Networks, Virality, Diffusion, Viral Content, Reddit, Twitter, Facebook, ImgUr, YouTube
In this research, we aim to quantify the linkage of various OSNs based on contextual analysis, as well as to measure the diffusion in these OSNs, thus addressing a gap in the related literature. Based on the related works discussed, in this work, we: Aim to identify patterns of propagation similar to the work described in @cite_3 Validate virality upon time with an easy to calculate criterion similar to metrics described in works @cite_22 @cite_28 @cite_26 @cite_19 @cite_18 @cite_11 Expand the concept of information diffusion across multiple OSNs, unlike the works described in @cite_5 @cite_10 @cite_0 @cite_13 , and @cite_30 that deal with the same concept but within one OSN
@cite_13 @cite_30 @cite_18 @cite_26 @cite_22 @cite_28 @cite_3 @cite_0 @cite_19 @cite_5 @cite_10 @cite_11
2178843456 2040330999 2084531279 2165949377
Viral products and ideas are intuitively understood to grow through a person-to-person diffusion process analogous to the spread of an infectious disease; however, until recently it has been prohibitively difficult to directly observe purportedly viral events, and thus to rigorously quantify or characterize their structural properties. Here we propose a formal measure of what we label “structural virality” that interpolates between two conceptual extremes: content that gains its popularity through a single, large broadcast and that which grows through multiple generations with any one individual directly responsible for only a fraction of the total adoption. We use this notion of structural virality to analyze a unique data set of a billion diffusion events on Twitter, including the propagation of news stories, videos, images, and petitions. We find that across all domains and all sizes of events, online diffusion is characterized by surprising structural diversity; that is, popular events regularly grow via both broadcast and viral mechanisms, as well as essentially all conceivable combinations of the two. Nevertheless, we find that structural virality is typically low, and remains so independent of size, suggesting that popularity is largely driven by the size of the largest broadcast. Finally, we attempt to replicate these findings with a model of contagion characterized by a low infection rate spreading on a scale-free network. We find that although several of our empirical findings are consistent with such a model, it fails to replicate the observed diversity of structural virality, thereby suggesting new directions for future modeling efforts. This paper was accepted by Lorin Hitt, information systems. Besides the epidemic threshold, the recently proposed viral conductance @j by [11] may be regarded as an additional characterizer of the viral robustness of a network, that measures the overall ease in which viruses can spread in a particular network. Motivated to explain observed features of the viral conductance @j in simulations [29], we have analysed this metric in depth using the N-intertwined SIS epidemic model, that upper bounds the real infection probability in any network and, hence, provides safe-side bounds on which network protection can be based. Our study here derives a few exact results for @j, a number of different lower and upper bounds for @j with variable accuracy. We also extend the theory of the N-intertwined SIS epidemic model, by deducing formal series expansions of the steady-state fraction of infected nodes for any graph and any effective infection rate, that result in a series for the viral conductance @j. Though approximate, we illustrate here that the N-intertwined SIS epidemic model is so far the only SIS model on networks that is analytically tractable, and valuable to provide first order estimates of the epidemic impact in networks. Finally, inspired by the analogy between virus spread and synchronization of coupled oscillators in a network, we propose the synchronizability as the analogue of the viral conductance. We consider the problem of detecting the source of a rumor (information diffusion) in a network based on observations about which set of nodes possess the rumor. In a recent work [10], this question was introduced and studied. The authors proposed rumor centrality as an estimator for detecting the source. They establish it to be the maximum likelihood estimator with respect to the popular Susceptible Infected (SI) model with exponential spreading time for regular trees. They showed that as the size of infected graph increases, for a line (2-regular tree) graph, the probability of source detection goes to 0 while for d-regular trees with d ≥ 3 the probability of detection, say αd, remains bounded away from 0 and is less than 1 2. Their results, however stop short of providing insights for the heterogeneous setting such as irregular trees or the SI model with non-exponential spreading times. This paper overcomes this limitation and establishes the effectiveness of rumor centrality for source detection for generic random trees and the SI model with a generic spreading time distribution. The key result is an interesting connection between a multi-type continuous time branching process (an equivalent representation of a generalized Polya's urn, cf. [1]) and the effectiveness of rumor centrality. Through this, it is possible to quantify the detection probability precisely. As a consequence, we recover all the results of [10] as a special case and more importantly, we obtain a variety of results establishing the universality of rumor centrality in the context of tree-like graphs and the SI model with a generic spreading time distribution. We consider the problem of detecting the source of a rumor (information diffusion) in a network based on observations about which set of nodes posses the rumor. In a recent work [10] by the authors, this question was introduced and studied. The authors proposed rumor centrality as an estimator for detecting the source. They establish it to be the maximum likelihood estimator with respect to the popular Susceptible Infected (SI) model with exponential spreading time for regular trees. They showed that as the size of infected graph increases, for a line (2-regular tree) graph, the probability of source detection goes to 0 while for d-regular trees with d 3 the probability of detection, say d, remains bounded away from 0 and is less than 1=2. Their results, however stop short of providing insights for the heterogeneous setting such as irregular trees or the SI model with non-exponential spreading times. This paper overcomes this limitation and establishes the effectiveness of rumor centrality for source detection for generic random trees and the SI model with a generic spreading time distribution. The key result is an interesting connection between a multi-type continuous time branching processes (an equivalent representation of a generalized Polya’s urn, cf. [1]) and the effectiveness of rumor centrality. Through this, it is possible to quantify the detection probability precisely. As a consequence, we recover all the results of [10] as a special case and more importantly, we obtain a variety of results establishing the universality of rumor centrality in the context of tree-like graphs and the SI model with a generic spreading time distribution.