Information diffusion in online social networks is affected by the underlying network topology, but it also has the power to change it. Online users are constantly creating new links when exposed to new information sources, and in turn these links are alternating the way information spreads. However, these two highly intertwined stochastic processes, information diffusion and network evolution, have been predominantly studied separately, ignoring their co-evolutionary dynamics.We propose a temporal point process model, COEVOLVE, for such joint dynamics, allowing the intensity of one process to be modulated by that of the other. This model allows us to efficiently simulate interleaved diffusion and network events, and generate traces obeying common diffusion and network patterns observed in real-world networks. Furthermore, we also develop a convex optimization framework to learn the parameters of the model from historical diffusion and network evolution traces. We experimented with both synthetic data and data gathered from Twitter, and show that our model provides a good fit to the data as well as more accurate predictions than alternatives.

Events in an online social network can be categorized roughly into endogenous events, where users just respond to the actions of their neighbors within the network, or exogenous events, where users take actions due to drives external to the network. How much external drive should be provided to each user, such that the network activity can be steered towards a target state? In this paper, we model social events using multivariate Hawkes processes, which can capture both endogenous and exogenous event intensities, and derive a time dependent linear relation between the intensity of exogenous events and the overall network activity. Exploiting this connection, we develop a convex optimization framework for determining the required level of external drive in order for the network to reach a desired activity level. We experimented with event data gathered from Twitter, and show that our method can steer the activity of the network more accurately than alternatives.

Tracking by detection is the topic of recent research that has received considerable attention in computer vision community. Mainly off-line classification methods have been used, however, they perform weakly in the case of appearance changes. Training the classifier incrementally and in an online manner solves this problem, but nevertheless, raises drifting due to soft or hard labeling in the online adaptation. In this paper a novel semi-supervised online tracking algorithm based on manifold assumption is proposed. Target object and background patches lie near low-dimensional manifolds. This motivates us to make use of the intrinsic structure of data in classification, and benefit from the smooth variation of the labeling function with respect to the underlying manifold. Unlabeled data make connections between different object poses to overcome difficulties due to appearance changes and partial occlusion. Moreover, the proposed method doesn’t rely on self-training, therefore, it is more robust to drifting. Experimental results substantiate the superiority of the proposed method over the ones that does not consider the geometry of data.