<abstract xmlns="http://www.w3.org/1999/xhtml"><p>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 (ŵ¿,ν) for 1 ≤ <italic>i</italic> ≤ c, 1 ≤ <italic>v</italic> ≤ n, where í specifies the group membership of a sending vertex and <italic>ν</italic> specifies the identity of the receiving vertex. In addition, group membership is consider to be random, with parameters (í>í)í=io 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 (≠<sub>u</sub>j) for 1 ≤ <italic>u</italic> ≤ n, <italic>1 &lt; j &lt; c</italic> depend on the membership of a vertex receiving a directed edge. We apply both models to several sets of social network data.</p></abstract>

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 (ŵ¿,ν) for 1 ≤ i ≤ c, 1 ≤ v ≤ n, where í specifies the group membership of a sending vertex and ν specifies the identity of the receiving vertex. In addition, group membership is consider to be random, with parameters (í>í)í=io 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 (≠uj) for 1 ≤ u ≤ n, 1 < j < c depend on the membership of a vertex receiving a directed edge. We apply both models to several sets of social network data.

Sender- and receiver-specific blockmodels

Journal of Social Structure

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

{"article-title":"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...

Sender- and receiver-specific blockmodels

Pubblicato online: 13 ago 2019

Pagine: 1 - 34

DOI: https://doi.org/10.21307/joss-2019-015

© 2019 Zhi Geng et al., published by Sciendo

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.