Simultaneous-direct blockmodeling for multiple relations in Pajek

Matthew Dabkowski, Ronald L Breiger, Ferenc Szidarovszky

Research output: Contribution to journalArticle

8 Citations (Scopus)

Abstract

The foundational research on blockmodeling focused on theorizing and identifying social roles and positions across multiple networks (White et al., 1976). Generalized blockmodeling provided a breakthrough in theory and research by permitting ideal block types that implement a wider class of role equivalence within a network (Doreian et al., 2005). Notwithstanding these successes and related progress that we discuss, a direct approach for the blockmodeling of multiple relations remains an open problem in the generalized blockmodeling literature (Doreian, 2006). With this in mind, we propose a simple and novel means of formulating and fitting generalized blockmodels for multiple relations. We make use of existing capabilities of the open-source network analysis software Pajek (Batagelj and Mrvar, 2011; Mrvar and Batagelj, 2013). In particular, by constructing an appropriate augmented adjacency matrix and carefully crafted constraints and penalties, Pajek's criterion function can be simultaneously minimized over multiple relations. This technique is first described in detail using a hypothetical friendship network, and then its value is reinforced through reanalysis of a classic, real world example.

Original languageEnglish (US)
Pages (from-to)1-16
Number of pages16
JournalSocial Networks
Volume40
Issue number1
DOIs
StatePublished - 2015

Fingerprint

Research
Software
social position
Social Role
network analysis
equivalence
friendship
penalty
Values
software
literature

Keywords

  • Blockmodeling
  • Multiple relations
  • Pajek
  • Social position

ASJC Scopus subject areas

  • Sociology and Political Science
  • Social Sciences(all)
  • Anthropology
  • Psychology(all)

Cite this

Simultaneous-direct blockmodeling for multiple relations in Pajek. / Dabkowski, Matthew; Breiger, Ronald L; Szidarovszky, Ferenc.

In: Social Networks, Vol. 40, No. 1, 2015, p. 1-16.

Research output: Contribution to journalArticle

Dabkowski, Matthew ; Breiger, Ronald L ; Szidarovszky, Ferenc. / Simultaneous-direct blockmodeling for multiple relations in Pajek. In: Social Networks. 2015 ; Vol. 40, No. 1. pp. 1-16.
@article{5a0816ff62d04bd9b5025a8d31840185,
title = "Simultaneous-direct blockmodeling for multiple relations in Pajek",
abstract = "The foundational research on blockmodeling focused on theorizing and identifying social roles and positions across multiple networks (White et al., 1976). Generalized blockmodeling provided a breakthrough in theory and research by permitting ideal block types that implement a wider class of role equivalence within a network (Doreian et al., 2005). Notwithstanding these successes and related progress that we discuss, a direct approach for the blockmodeling of multiple relations remains an open problem in the generalized blockmodeling literature (Doreian, 2006). With this in mind, we propose a simple and novel means of formulating and fitting generalized blockmodels for multiple relations. We make use of existing capabilities of the open-source network analysis software Pajek (Batagelj and Mrvar, 2011; Mrvar and Batagelj, 2013). In particular, by constructing an appropriate augmented adjacency matrix and carefully crafted constraints and penalties, Pajek's criterion function can be simultaneously minimized over multiple relations. This technique is first described in detail using a hypothetical friendship network, and then its value is reinforced through reanalysis of a classic, real world example.",
keywords = "Blockmodeling, Multiple relations, Pajek, Social position",
author = "Matthew Dabkowski and Breiger, {Ronald L} and Ferenc Szidarovszky",
year = "2015",
doi = "10.1016/j.socnet.2014.06.003",
language = "English (US)",
volume = "40",
pages = "1--16",
journal = "Social Networks",
issn = "0378-8733",
publisher = "Elsevier BV",
number = "1",

}

TY - JOUR

T1 - Simultaneous-direct blockmodeling for multiple relations in Pajek

AU - Dabkowski, Matthew

AU - Breiger, Ronald L

AU - Szidarovszky, Ferenc

PY - 2015

Y1 - 2015

N2 - The foundational research on blockmodeling focused on theorizing and identifying social roles and positions across multiple networks (White et al., 1976). Generalized blockmodeling provided a breakthrough in theory and research by permitting ideal block types that implement a wider class of role equivalence within a network (Doreian et al., 2005). Notwithstanding these successes and related progress that we discuss, a direct approach for the blockmodeling of multiple relations remains an open problem in the generalized blockmodeling literature (Doreian, 2006). With this in mind, we propose a simple and novel means of formulating and fitting generalized blockmodels for multiple relations. We make use of existing capabilities of the open-source network analysis software Pajek (Batagelj and Mrvar, 2011; Mrvar and Batagelj, 2013). In particular, by constructing an appropriate augmented adjacency matrix and carefully crafted constraints and penalties, Pajek's criterion function can be simultaneously minimized over multiple relations. This technique is first described in detail using a hypothetical friendship network, and then its value is reinforced through reanalysis of a classic, real world example.

AB - The foundational research on blockmodeling focused on theorizing and identifying social roles and positions across multiple networks (White et al., 1976). Generalized blockmodeling provided a breakthrough in theory and research by permitting ideal block types that implement a wider class of role equivalence within a network (Doreian et al., 2005). Notwithstanding these successes and related progress that we discuss, a direct approach for the blockmodeling of multiple relations remains an open problem in the generalized blockmodeling literature (Doreian, 2006). With this in mind, we propose a simple and novel means of formulating and fitting generalized blockmodels for multiple relations. We make use of existing capabilities of the open-source network analysis software Pajek (Batagelj and Mrvar, 2011; Mrvar and Batagelj, 2013). In particular, by constructing an appropriate augmented adjacency matrix and carefully crafted constraints and penalties, Pajek's criterion function can be simultaneously minimized over multiple relations. This technique is first described in detail using a hypothetical friendship network, and then its value is reinforced through reanalysis of a classic, real world example.

KW - Blockmodeling

KW - Multiple relations

KW - Pajek

KW - Social position

UR - http://www.scopus.com/inward/record.url?scp=84904747374&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84904747374&partnerID=8YFLogxK

U2 - 10.1016/j.socnet.2014.06.003

DO - 10.1016/j.socnet.2014.06.003

M3 - Article

AN - SCOPUS:84904747374

VL - 40

SP - 1

EP - 16

JO - Social Networks

JF - Social Networks

SN - 0378-8733

IS - 1

ER -