Timelines Analysis and competition over popularity, influence and visibility in social networks.

Speaker : Eitan Altman
Date: 03/06/2015
Time: 2:00 pm - 3:00 pm
Location: LINCS Meeting Room 40


The major social networks use timelines to display content that a user receives from those sources that he follows. A content that arrives at a timeline is placed at the top of the list and each other content is pushed down by one step. If the timeline is finite (as in twitter) then this causes the last element in the timeline to be pushed out. Moreover, the lower the content is on the timeline the smaller its influence is. In this talk we shall first present analysis of the timeline process and of the probability to be visible on the timeline. We shall further describe the influence process of content which takes into account not only the location on the timeline but also aging of content. We shall then study the impact of the burstiness of the arrival of contents on the timeline process. We shall finally introduce game theoretical models to describe the competition over popularity and over visibility of content in the timeline. We shall study two specific game theoretic problems. The first is a timing game: when is it best to send a content. The second is a resource allocation game for optimal control of the flow of content.The work describes ongoing collaborative work with many woauthors: Alexandre Reiffers, Nahum Shimkin, Anurag Kumar, Yezekael Hayel and others.