Existing studies of how information diffuses across social networks have thus far concentrated on analysing and recovering the spread of deterministic innovations such as URLs, hashtags, and group membership. However investigating how mentions of real-world entities appear and spread has yet to be explored, largely due to the computationally intractable nature of performing large-scale entity extraction. In this paper we present, to the best of our knowledge, one of the first pieces of work to closely examine the diffusion of named entities on social media, using Reddit as our case study platform. We first investigate how named entities can be accurately recognised and extracted from discussion posts. We then use these extracted entities to study the patterns of entity cascades and how the probability of a user adopting an entity (i.e. mentioning it) is associated with exposures to the entity. We put these pieces together by presenting a parallelised diffusion model that can forecast the probability of entity adoption, finding that the influence of adoption between users can be characterised by their prior interactions -- as opposed to whether the users propagated entity-adoptions beforehand. Our findings have important implications for researchers studying influence and language, and for community analysts who wish to understand entity-level influence dynamics.
Studies of information diffusion have largely concentrated on signals of diffusion such as tracking URLs, hashtags, quotes @cite_4 , and adoption behaviour (e.g. group signups); however to the best of our knowledge such studies have yet to focus on how entities diffuse. We now focus on key pieces of work that are closely-aligned to the study of entity-diffusion in the context of social networks -- should the reader wish to know more about information diffusion models, and in greater detail, then please refer to 's @cite_5 comprehensive survey of such models.
@cite_5 @cite_4
2131817520 2171150534
Many of the world's most popular websites catalyze their growth through invitations from existing members. New members can then in turn issue invitations, and so on, creating cascades of member signups that can spread on a global scale. Although these diffusive invitation processes are critical to the popularity and growth of many websites, they have rarely been studied, and their properties remain elusive. For instance, it is not known how viral these cascades structures are, how cascades grow over time, or how diffusive growth affects the resulting distribution of member characteristics present on the site. In this paper, we study the diffusion of LinkedIn, an online professional network comprising over 332 million members, a large fraction of whom joined the site as part of a signup cascade. First we analyze the structural patterns of these signup cascades, and find them to be qualitatively different from previously studied information diffusion cascades. We also examine how signup cascades grow over time, and observe that diffusion via invitations on LinkedIn occurs over much longer timescales than are typically associated with other types of online diffusion. Finally, we connect the cascade structures with rich individual-level attribute data to investigate the interplay between the two. Using novel techniques to study the role of homophily in diffusion, we find striking differences between the local, edge-wise homophily and the global, cascade-level homophily we observe in our data, suggesting that signup cascades form surprisingly coherent groups of members. Predicting the diffusion of information on social networks is a key problem for applications like Opinion Leader Detection, Buzz Detection or Viral Marketing. Many recent diffusion models are direct extensions of the Cascade and Threshold models, initially proposed for epidemiology and social studies. In such models, the diffusion process is based on the dynamics of interactions between neighbor nodes in the network (the social pressure), and largely ignores important dimensions as the content of the piece of information diffused. We propose here a new family of probabilistic models that aims at predicting how a content diffuses in a network by making use of additional dimensions: the content of the piece of information diffused, user's profile and willingness to diffuse. These models are illustrated and compared with other approaches on two blog datasets. The experimental results obtained on these datasets show that taking into account the content of the piece of information diffused is important to accurately model the diffusion process. Abstract Registration plays an important role in group analysis of diffusion-weighted imaging (DWI) data. It can be used to build a reference anatomy for investigating structural variation or tracking changes in white matter. Unlike traditional scalar image registration where spatial alignment is the only focus, registration of DWI data requires both spatial alignment of structures and reorientation of local signal profiles. As such, DWI registration is much more complex and challenging than scalar image registration. Although a variety of algorithms has been proposed to tackle the problem, most of them are restricted by the diffusion model used for registration, making it difficult to fit to the registered data a different model. In this paper we describe a method that allows any diffusion model to be fitted after registration for subsequent multifaceted analysis. This is achieved by directly aligning DWI data using a large deformation diffeomorphic registration framework. Our algorithm seeks the optimal coordinate mapping by simultaneously considering structural alignment, local signal profile reorientation, and deformation regularization. Our algorithm also incorporates a multi-kernel strategy to concurrently register anatomical structures at different scales. We demonstrate the efficacy of our approach using in vivo data and report detailed qualitative and quantitative results in comparison with several different registration strategies. Online social network platforms provide built-in functionalities that allow users to share information through their social connections. The study of information diffusion focusses on analysing how the spread of information enables us to understand the ways that users behave and interact online. Information diffusion manifests itself on social networks in the form of cascades of information, which are structural representations of diffusion events. The characteristics of information diffusion differ between online social networks partly depending on the capabilities of each. Tumblr is an online social network platform; it allows users to reblog more than once, to add a comment with a reblog, and to delete reblogs which presents certain challenges in the study of diffusion on this network. In this paper, we will identify and address those challenges, and we will examine the effects of these functionalities on users' behaviour and consequently on the structural characteristics of cascades on Tumblr. Unlike traditional epidemic virus spreading, behavior diffusion in social networks is conducted by rational users, who would make strategic choices instead of being randomly infected with some probability. Specifically, individuals always try to maximize their utilities through rationally selecting specific behaviors (adopting a new product, or spreading a rumor, etc.). However, utility obtained by an individual, naturally contains uncertainty, and it may stem from two sources: users’ imperfect and incomplete knowledge about others, and the inherently stochastic property in human behavior. Thus, it is imperative to model and analyze the diffusion pattern under the resulting uncertainty in social networks, which, however, has not yet been deeply examined by the existing works. This paper deeply explores the pattern of gossip diffusion in social networks when uncertainty exists in users’ decision making. In detail, the innovative results provided in this paper are: first, inspired by random utility theory, we formulate the diffusion model based on mixed logit model that allows for user’s uncertainty in determining whether to adopt a specific strategy; second, the formal analysis framework characterizing the diffusion process is derived through the approximation method of mean field theory; finally, we explore the extensive applicability of our proposed analysis framework through modeling rumor diffusion in social networks as a coordination game. Our findings are, for various structural characteristics, small uncertainty can significantly speed up the diffusion of gossip; furthermore, social networks with scale-free property can facilitate the gossip diffusion in the easiest way, but, the range of uncertainty factor that can maximize gossip diffusion is the smallest. The obtained results perfectly comply with the philosophical saying about rumor diffusion in real social life: easy come, easy go. We study the propagation of expression of moods from one individual to another in social media. Specifically, we utilize an ensemble of more than 200 moods, and follow their trails of retweets on Twitter. We examine the diffusion of these moods through the characteristics of the author of the retweeted post, of the post, and its linguistic style and topical content. We observe that moods of high valence and low to moderate activation propagate the most. Our findings also indicate that mood-bearing posts from individuals of medium #followers show highest diffusion, instead of elite users. Further, moods in postings with high self-attentional focus, posted by socially interactive women, and with fewer links diffuse the most. Finally, we leverage these characteristics to build a linear regression model that can predict extent of diffusion in a mood-bearing post. The model yields accuracy of 75 showing that user's attributes as well as post's language characteristics are key factors driving the diffusion of moods in social media. Abstract In this study, nanoscale communication networks have been investigated in the context of binary concentration-encoded unicast molecular communication suitable for numerous emerging applications, for example in healthcare and nanobiomedicine. The main focus of the paper has been given to the spatiotemporal distribution of signal strength and modulation schemes suitable for short-range, medium-range, and long-range molecular communication between two communicating nanomachines in a nanonetwork. This paper has principally focused on bio-inspired transmission techniques for concentration-encoded molecular communication systems. Spatiotemporal distributions of a carrier signal in the form of the concentration of diffused molecules over the molecular propagation channel and diffusion-dependent communication ranges have been explained for various scenarios. Finally, the performance analysis of modulation schemes has been evaluated in the form of the steady-state loss of amplitude of the received concentration signals and its dependence on the transmitter–receiver distance. Social networks often serve as a medium for the diffusion of ideas or innovations. An individual's decision whether to adopt a product or innovation will be highly dependent on the choices made by the individual's peers or neighbors in the social network. In this work, we study the game of innovation diffusion with multiple competing innovations such as when multiple companies market competing products using viral marketing. Our first contribution is a natural and mathematically tractable model for the diffusion of multiple innovations in a network. We give a (1-1 e) approximation algorithm for computing the best response to an opponent's strategy, and prove that the "price of competition" of this game is at most 2. We also discuss "first mover" strategies which try to maximize the expected diffusion against perfect competition. Finally, we give an FPTAS for the problem of maximizing the influence of a single player when the underlying graph is a tree. This paper presents a survey as well as an empirical comparison and evaluation of seven kernels on graphs and two related similarity matrices, that we globally refer to as ''kernels on graphs'' for simplicity. They are the exponential diffusion kernel, the Laplacian exponential diffusion kernel, the von Neumann diffusion kernel, the regularized Laplacian kernel, the commute-time (or resistance-distance) kernel, the random-walk-with-restart similarity matrix, and finally, a kernel first introduced in this paper (the regularized commute-time kernel) and two kernels defined in some of our previous work and further investigated in this paper (the Markov diffusion kernel and the relative-entropy diffusion matrix). The kernel-on-graphs approach is simple and intuitive. It is illustrated by applying the nine kernels to a collaborative-recommendation task, viewed as a link prediction problem, and to a semisupervised classification task, both on several databases. The methods compute proximity measures between nodes that help study the structure of the graph. Our comparisons suggest that the regularized commute-time and the Markov diffusion kernels perform best on the investigated tasks, closely followed by the regularized Laplacian kernel. Viral diffusion allows a piece of information to widely and quickly spread within the network of users through word-ofmouth. In this paper, we study the problem of modeling both item and user factors that contribute to viral diffusion in Twitter network. We identify three behaviorial factors, namely user virality, user susceptibility and item virality, that contribute to viral diffusion. Instead of modeling these factors independently as done in previous research, we propose a model that measures all the factors simultaneously considering their mutual dependencies. The model has been evaluated on both synthetic and real datasets. The experiments show that our model outperforms the existing ones for synthetic data with ground truth labels. Our model also performs well for predicting the hashtags that have higher retweet likelihood. We finally present case examples that illustrate how the models differ from one another. Partially-observed data collected by sampling methods is often being studied to obtain the characteristics of information diffusion networks. However, these methods usually do not consider the behavior of diffusion process. In this paper, we propose a novel two-step (sampling estimation) measurement framework by utilizing the diffusion process characteristics. To this end, we propose a link-tracing based sampling design which uses the infection times as local information without any knowledge about the latent structure of diffusion network. To correct the bias of sampled data, we introduce three estimators for different categories, link-based, node-based, and cascade-based. To the best of our knowledge, this is the first attempt to introduce a complete measurement framework for diffusion networks. We also show that the estimator plays an important role in correcting the bias of sampling from diffusion networks. Our comprehensive empirical analysis over large synthetic and real datasets demonstrates that in average, the proposed framework outperforms the common BFS and RW sampling methods in terms of link-based characteristics by about 37 and 35 , respectively. A diffusion-based molecular communication system has two major components: the diffusion in the medium, and the ligand-reception. Information bits, encoded in the time variations of the concentration of molecules, are conveyed to the receiver front through the molecular diffusion in the medium. The receiver, in turn, measures the concentration of the molecules in its vicinity in order to retrieve the information. This is done via ligand-reception process. In this paper, we develop models to study the constraints imposed by the concentration sensing at the receiver side and derive the maximum rate by which a ligand-receiver can receive information. Therefore, the overall capacity of the diffusion channel with the ligand receptors can be obtained by combining the results presented in this paper with our previous work on the achievable information rate of molecular communication over the diffusion channel. Identifying the optimal set of individuals to first receive information ('seeds') in a social network is a widely-studied question in many settings, such as the diffusion of information, microfinance programs, and new technologies. Numerous studies have proposed various network-centrality based heuristics to choose seeds in a way that is likely to boost diffusion. Here we show that, for some frequently studied diffusion processes, randomly seeding s plus x individuals can prompt a larger cascade than optimally targeting the best s individuals, for a small x. We prove our results for large classes of random networks, but also show that they hold in simulations over several real-world networks. This suggests that the returns to collecting and analyzing network information to identify the optimal seeds may not be economically significant. Given these findings, practitioners interested in communicating a message to a large number of people may wish to compare the cost of network-based targeting to that of slightly expanding initial outreach. Information spreading in online social communities has attracted tremendous attention due to its utmost practical values in applications. Despite that several individual-level diffusion data have been investigated, we still lack the detailed understanding of the spreading pattern of information. Here, by comparing information flows and social links in a blog community, we find that the diffusion processes are induced by three different spreading mechanisms: social spreading, self-promotion and broadcast. Although numerous previous studies have employed epidemic spreading models to simulate information diffusion, we observe that such models fail to reproduce the realistic diffusion pattern. In respect to users behaviors, strikingly, we find that most users would stick to one specific diffusion mechanism. Moreover, our observations indicate that the social spreading is not only crucial for the structure of diffusion trees, but also capable of inducing more subsequent individuals to acquire the information. Our findings suggest new directions for modeling of information diffusion in social systems, and could inform design of efficient propagation strategies based on users behaviors. Online social networks play a major role in the spread of information at very large scale. A lot of effort have been made in order to understand this phenomenon, ranging from popular topic detection to information diffusion modeling, including influential spreaders identification. In this article, we present a survey of representative methods dealing with these issues and propose a taxonomy that summarizes the state-of-the-art. The objective is to provide a comprehensive analysis and guide of existing efforts around information diffusion in social networks. This survey is intended to help researchers in quickly understanding existing works and possible improvements to bring. Diffusion-based communication refers to the transfer of information using molecules as message carriers whos ep rop- agation is governed by the laws of molecular diffusion. It has been identified that diffusion-based communication is one of the most promising solutions for end-to-end communication between nanoscale devices. In this paper, the design of a diffusion-based communication system considering stochastic signaling, arbitrary orders of channel memory, and noisy receptio ni s proposed. The diffusion in the cases of one, two, and three dimensions are all considered. Three signal processing techniques for the molecular concentration with low computational complexity are proposed. For the detector design, both a low-complexity one-shot optimal detector for mutual information maximization and a near Max- imum Likelihood (ML) sequence detector are proposed. To the best of our knowledge, our paper is thefirst that gives an analytical treatment of the signal processing, estimation, and detection prob- lems for diffusion-based communication in the presence of ISI and reception noise. Numerical results indicate that the proposed signal processing technique followed by the one-shot detector achieves near-optimal throughput without the need of ap riori information in both short-range and long-range diffusion-based communication scenarios, whic hs uggests an ML sequence de- tector is not necessary. Furthermore, the proposed receiver design guarantees diffusion-based communication to operate without failure even in the case of infinite channel memory. A channel capacity of 1 bit per channel utilization can be ultimately achieved by extending the duration of the signaling interval. This article investigates the impact of user homophily on the social process of information diffusion in online social media. Over several decades, social scientists have been interested in the idea that similarity breeds connection: precisely known as "homophily". Homophily has been extensively studied in the social sciences and refers to the idea that users in a social system tend to bond more with ones who are similar to them than to ones who are dissimilar. The key observation is that homophily structures the ego-networks of individuals and impacts their communication behavior. It is therefore likely to effect the mechanisms in which information propagates among them. To this effect, we investigate the interplay between homophily along diverse user attributes and the information diffusion process on social media. In our approach, we first extract diffusion characteristics---corresponding to the baseline social graph as well as graphs filtered on different user attributes (e.g. location, activity). Second, we propose a Dynamic Bayesian Network based framework to predict diffusion characteristics at a future time. Third, the impact of attribute homophily is quantified by the ability of the predicted characteristics in explaining actual diffusion, and external variables, including trends in search and news. Experimental results on a large Twitter dataset demonstrate that choice of the homophilous attribute can impact the prediction of information diffusion, given a specific metric and a topic. In most cases, attribute homophily is able to explain the actual diffusion and external trends by 15-25 over cases when homophily is not considered. Diffusion network inference and meme tracking have been two key challenges in viral diffusion. This paper shows that these two tasks can be addressed simultaneously with a probabilistic model involving a mixture of mutually exciting point processes. A fast learning algorithms is developed based on mean-field variational inference with budgeted diffusion bandwidth. The model is demonstrated with applications to the diffusion of viral texts in (1) online social networks (e.g., Twitter) and (2) the blogosphere on the Web. Social networks play a fundamental role in the diffusion of information. However, there are two different ways of how information reaches a person in a network. Information reaches us through connections in our social networks, as well as through the influence external out-of-network sources, like the mainstream media. While most present models of information adoption in networks assume information only passes from a node to node via the edges of the underlying network, the recent availability of massive online social media data allows us to study this process in more detail. We present a model in which information can reach a node via the links of the social network or through the influence of external sources. We then develop an efficient model parameter fitting technique and apply the model to the emergence of URL mentions in the Twitter network. Using a complete one month trace of Twitter we study how information reaches the nodes of the network. We quantify the external influences over time and describe how these influences affect the information adoption. We discover that the information tends to "jump" across the network, which can only be explained as an effect of an unobservable external influence on the network. We find that only about 71 of the information volume in Twitter can be attributed to network diffusion, and the remaining 29 is due to external events and factors outside the network. Social media forms a central domain for the production and dissemination of real-time information. Even though such flows of information have traditionally been thought of as diffusion processes over social networks, the underlying phenomena are the result of a complex web of interactions among numerous participants. Here we develop the Linear Influence Model where rather than requiring the knowledge of the social network and then modeling the diffusion by predicting which node will influence which other nodes in the network, we focus on modeling the global influence of a node on the rate of diffusion through the (implicit) network. We model the number of newly infected nodes as a function of which other nodes got infected in the past. For each node we estimate an influence function that quantifies how many subsequent infections can be attributed to the influence of that node over time. A nonparametric formulation of the model leads to a simple least squares problem that can be solved on large datasets. We validate our model on a set of 500 million tweets and a set of 170 million news articles and blog posts. We show that the Linear Influence Model accurately models influences of nodes and reliably predicts the temporal dynamics of information diffusion. We find that patterns of influence of individual participants differ significantly depending on the type of the node and the topic of the information.