IEEE Transactions on Network Science and Engineering

The aim of this work is to give a full, elementary exposition of a recently introduced algorithmic technique for renormalizing dynamic networks. The motivation is the analysis of time-varying graphs. We begin by showing how an arbitrary sequence of graphs over a fixed set of nodes can be parsed so as to capture hierarchically how information propagates across the nodes. Equipped with parse trees, ... View full abstract»

The paper studies the qualitative behavior of a set of ordinary differential equations (ODE) that models the dynamics of bi-virus epidemics over bilayer networks. Each layer is a weighted digraph associated with a strain of virus; the weights gzίrepresent the rates of infection from node i to node j of strain z. We establish a sufficient condition on the g's that guarantees survival... View full abstract»

We study the influence of the seed graph in the preferential attachment model, focusing on the case of trees. We first show that the seed has no effect from a weak local limit point of view. On the other hand, we conjecture that different seeds lead to different distributions of limiting trees from a total variation point of view. We take a first step in proving this conjecture by showing that see... View full abstract»

The vast quantity of information shared in social networks has brought us to an age of attention scarcity, where getting users to be attentive to a message is not a given. In fact, it has become the limiting factor in the consumption of information by end users. Understanding what captures the collective attention within a community of users in a social network is invaluable to many applications, ... View full abstract»