Sender- and receiver-specific blockmodels
We propose a sender-specific blockmodel for network data which utilizes both the group membership and the identities of the vertices. This is accomplished by introducing the edge probabilities $(\theta_{i, v})$ for $1\le i\le c, 1\le v\le n$, where $i$ specifies the group membership of a sending vertex and $v$ specifies the identity of the receiving vertex. In addition, group membership is conside
