Sender- and receiver-specific blockmodels

Research output: Contribution to journalArticle


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 consider to be random, with parameters $(p_i)_{i=1}^c$. We present methods based on the EM algorithm for the parameter estimations and discuss the recovery of latent group memberships. A companion model, the receiver-specific blockmodel, is also introduced in which the edge probabilities $(\psi_{u, j})$ for $1\le u \le n,1\le j\le c$ depend on the membership of a vertex receiving a directed edge. We apply both models to several sets of social network data.


Research areas and keywords

Subject classification (UKÄ) – MANDATORY

  • Mathematics


  • Directed graph, Blockmodeling, Out-nets, In-nets, Ego-nets, EM algorithm, Multinomial distribution
Original languageEnglish
Pages (from-to)1-34
JournalJournal of Social Structure
Publication statusPublished - 2015
Publication categoryResearch