Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
102 tokens/sec
GPT-4o
59 tokens/sec
Gemini 2.5 Pro Pro
43 tokens/sec
o3 Pro
6 tokens/sec
GPT-4.1 Pro
50 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Smart broadcasting: Do you want to be seen? (1605.06855v1)

Published 22 May 2016 in cs.SI, cs.LG, and stat.ML

Abstract: Many users in online social networks are constantly trying to gain attention from their followers by broadcasting posts to them. These broadcasters are likely to gain greater attention if their posts can remain visible for a longer period of time among their followers' most recent feeds. Then when to post? In this paper, we study the problem of smart broadcasting using the framework of temporal point processes, where we model users feeds and posts as discrete events occurring in continuous time. Based on such continuous-time model, then choosing a broadcasting strategy for a user becomes a problem of designing the conditional intensity of her posting events. We derive a novel formula which links this conditional intensity with the visibility of the user in her followers' feeds. Furthermore, by exploiting this formula, we develop an efficient convex optimization framework for the when-to-post problem. Our method can find broadcasting strategies that reach a desired visibility level with provable guarantees. We experimented with data gathered from Twitter, and show that our framework can consistently make broadcasters' post more visible than alternatives.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (5)
  1. Mohammad Reza Karimi (9 papers)
  2. Erfan Tavakoli (2 papers)
  3. Mehrdad Farajtabar (56 papers)
  4. Le Song (140 papers)
  5. Manuel Gomez-Rodriguez (40 papers)
Citations (39)

Summary

We haven't generated a summary for this paper yet.