Density of streaming subgraphs

[PaulRBerg]

Properties of each streaming subgraph:

• Directed
• There can only be a single edge between any two users (a single stream between them)
• The edges are mutually exclusive, meaning that if $A$ streams to $B$, $B$ cannot also stream to $A$ at the same time. The previous edge will be deleted if $B$ attempts to stream more tokens back to $A$.
• No loops (a user cannot stream to themselves)
• Cycles are allowed

Luckily, this means that each subgraph will have a sparse density because the total number of edges will be far from $\frac{V*{(V-1)}}{2}$ (where $V$ = number of users).

For full details, see my full chat with ChatGPT.

Related: #107