Blockmodeling Explained

Blockmodeling is a set or a coherent framework, that is used for analyzing social structure and also for setting procedure(s) for partitioning (clustering) social network's units (nodes, vertices, actors), based on specific patterns, which form a distinctive structure through interconnectivity.[1] [2] It is primarily used in statistics, machine learning and network science.

As an empirical procedure, blockmodeling assumes that all the units in a specific network can be grouped together to such extent to which they are equivalent. Regarding equivalency, it can be structural, regular or generalized.[3] Using blockmodeling, a network can be analyzed using newly created blockmodels, which transforms large and complex network into a smaller and more comprehensible one. At the same time, the blockmodeling is used to operationalize social roles.

While some contend that the blockmodeling is just clustering methods, Bonacich and McConaghy state that "it is a theoretically grounded and algebraic approach to the analysis of the structure of relations". Blockmodeling's unique ability lies in the fact that it considers the structure not just as a set of direct relations, but also takes into account all other possible compound relations that are based on the direct ones.[4]

The principles of blockmodeling were first introduced by Francois Lorrain and Harrison C. White in 1971.[2] Blockmodeling is considered as "an important set of network analytic tools" as it deals with delineation of role structures (the well-defined places in social structures, also known as positions) and the discerning the fundamental structure of social networks.[5] According to Batagelj, the primary "goal of blockmodeling is to reduce a large, potentially incoherent network to a smaller comprehensible structure that can be interpreted more readily".[6] Blockmodeling was at first used for analysis in sociometry and psychometrics, but has now spread also to other sciences.[7]

Definition

A network as a system is composed of (or defined by) two different sets: one set of units (nodes, vertices, actors) and one set of links between the units. Using both sets, it is possible to create a graph, describing the structure of the network.[8]

During blockmodeling, the researcher is faced with two problems: how to partition the units (e.g., how to determine the clusters (or classes), that then form vertices in a blockmodel) and then how to determine the links in the blockmodel (and at the same time the values of these links).[9]

In the social sciences, the networks are usually social networks, composed of several individuals (units) and selected social relationships among them (links). Real-world networks can be large and complex; blockmodeling is used to simplify them into smaller structures that can be easier to interpret. Specifically, blockmodeling partitions the units into clusters and then determines the ties among the clusters. At the same time, blockmodeling can be used to explain the social roles existing in the network, as it is assumed that the created cluster of units mimics (or is closely associated with) the units' social roles.[8] Blockmodeling can thus be defined as a set of approaches for partitioning units into clusters (also known as positions) and links into blocks, which are further defined by the newly obtained clusters. A block (also blockmodel) is defined as a submatrix, that shows interconnectivity (links) between nodes, present in the same or different clusters.[8] Each of these positions in the cluster is defined by a set of (in)direct ties to and from other social positions.[10] These links (connections) can be directed or undirected; there can be multiple links between the same pair of objects or they can have weights on them. If there are not any multiple links in a network, it is called a simple network.[11]

A matrix representation of a graph is composed of ordered units, in rows and columns, based on their names. The ordered units with similar patterns of links are partitioned together in the same clusters. Clusters are then arranged together so that units from the same clusters are placed next to each other, thus preserving interconnectivity. In the next step, the units (from the same clusters) are transformed into a blockmodel. With this, several blockmodels are usually formed, one being core cluster and others being cohesive; a core cluster is always connected to cohesive ones, while cohesive ones cannot be linked together. Clustering of nodes is based on the equivalence, such as structural and regular.[8] The primary objective of the matrix form is to visually present relations between the persons included in the cluster. These ties are coded dichotomously (as present or absent), and the rows in the matrix form indicate the source of the ties, while the columns represent the destination of the ties.[10]

Equivalence can have two basic approaches: the equivalent units have the same connection pattern to the same neighbors or these units have same or similar connection pattern to different neighbors. If the units are connected to the rest of network in identical ways, then they are structurally equivalent.[3] Units can also be regularly equivalent, when they are equivalently connected to equivalent others.[2]

With blockmodeling, it is necessary to consider the issue of results being affected by measurement errors in the initial stage of acquiring the data.[12]

Different approaches

Regarding what kind of network is undergoing blockmodeling, a different approach is necessary. Networks can be one–mode or two–mode. In the former all units can be connected to any other unit and where units are of the same type, while in the latter the units are connected only to the unit(s) of a different type.[5] Regarding relationships between units, they can be single–relational or multi–relational networks. Further more, the networks can be temporal or multilevel and also binary (only 0 and 1) or signed (allowing negative ties)/values (other values are possible) networks.

Different approaches to blockmodeling can be grouped into two main classes: deterministic blockmodeling and stochastic blockmodeling approaches. Deterministic blockmodeling is then further divided into direct and indirect blockmodeling approaches.[8] Among direct blockmodeling approaches are: structural equivalence and regular equivalence.[2] Structural equivalence is a state, when units are connected to the rest of the network in an identical way(s), while regular equivalence occurs when units are equally related to equivalent others (units are not necessarily sharing neighbors, but have neighbour that are themselves similar).[3] [5] Indirect blockmodeling approaches, where partitioning is dealt with as a traditional cluster analysis problem (measuring (dis)similarity results in a (dis)similarity matrix), are:[8] [2]

According to Brusco and Steinley (2011),[14] the blockmodeling can be categorized (using a number of dimensions):[15]

Blockmodels

Blockmodels (sometimes also block models) are structures in which:

Computer programs can partition the social network according to pre-set conditions.[17] When empirical blocks can be reasonably approximated in terms of ideal blocks, such blockmodels can be reduced to a blockimage, which is a representation of the original network, capturing its underlying 'functional anatomy'.[18] Thus, blockmodels can "permit the data to characterize their own structure", and at the same time not seek to manifest a preconceived structure imposed by the researcher.[19]

Blockmodels can be created indirectly or directly, based on the construction of the criterion function. Indirect construction refers to a function, based on "compatible (dis)similarity measure between paris of units", while the direct construction is "a function measuring the fit of real blocks induced by a given clustering to the corresponding ideal blocks with perfect relations within each cluster and between clusters according to the considered types of connections (equivalence)".[20]

Types

Blockmodels can be specified regarding the intuition, substance or the insight into the nature of the studied network; this can result in such models as follows:[5]

Specialized programs

Blockmodeling is done with specialized computer programs, dedicated to the analysis of networks or blockmodeling in particular, as:

See also

Notes and References

  1. [Patrick Doreian]
  2. [Patrick Doreian]
  3. [Anuška Ferligoj]
  4. Bonacich . Phillip . McConaghy . Maureen J. . 1980 . The Algebra of Blockmodeling . Sociological Methodology . 11 . 489–532 . 10.2307/270873 .
  5. Book: Doreian . Patrick . Batagelj . Vladimir . Ferligoj . Anuška . Generalized Blockmodeling . Cambridge University Press . 2005 . 0-521-84085-6.
  6. Batagelj . Vladimir . 1999 . Generalized Blockmodeling . Informatica . 23 . 501–506 .
  7. Web site: WEBER, M. (2007), “Introducing blockmodeling to input-output analysis”. 16th International I-Ot Conf, Istanbul, Turkey. . 2021-08-23 . 2021-08-23 . https://web.archive.org/web/20210823084150/https://www.iioa.org/conferences/16th/files/Papers/Weber%20Introducing%20blockmodeling%20to%20input-output%20analysis.doc . live .
  8. [Miha Matjašič]
  9. Batagelj . Vladimir . 1997 . Notes on blockmodeling . Social Networks . 19 . 143–155.
  10. Bonacich . Phillip . McConaghy . Maureen J. . 1980 . The Algebra of Blockmodeling . Sociological Methodology . 11 . 489–532 . 10.2307/270873.
  11. Brian Joseph Ball, Blockmodeling techniques for complex networks: doctoral dissertation. University of Michigan, 2014.
  12. Žnidaršič . Anja . Doreian . Patrick . Ferligoj . Anuška . 2012 . Absent Ties in Social Networks, their Treatments, and Blockmodeling Outcomes . Metodološki zvezki . 9 . 2 . 119–138 .
  13. Žiberna . Aleš . 2013 . Generalized blockmodeling of sparse networks . Metodološki zvezki . 10 . 2 . 99–119 .
  14. Brusco . Michael . Steinley . Douglas. 2011 . A tabu search heuristic for deterministic two-mode blockmodeling . Psychometrika . 76 . 612–633 .
  15. Brusco . Michael . Doreian . Patrick . Steinley . Douglas . Satornino . Cinthia B. . 2013 . Multiobjective blockmodeling for social network analysis . Psychometrika . 78 . 3 . 498–525 . 10.1007/S11336-012-9313-1 .
  16. [Patrick Doreian]
  17. Book: Nooy . Wouter de . Mrvar . Andrej . Batagelj . Vladimir . Exploratory Social Network Analysis with Pajek. Revised and Expanded Edition for Updated Software. Third Edition . Cambridge University Press . 2018 . 978-1-108-47414-6.
  18. Nordlund . Carl . 2019 . Direct blockmodeling of valued and binary networks: a dichotomization-free approach . Social Networks . 61. 128–143. 10.1016/j.socnet.2019.10.004. 1910.10484. 204838377 .
  19. Arabie . Phipps . Boorman . Scott A. . Levitt . Paul R. . 1978 . Constructing Blockmodels: How and Why . Journal of Mathematical Psychology . 17 . 21–63 . 10.2307/270873. 270873 .
  20. Batagelj . Vladimir . Mrvar . andrej . Ferligoj . Anuška . Doreian . Patrick . 2004 . Generalized Blockmodeling with Pajek . Metodološki zvezki . 1 . 2 . 455–467 . 2023-01-07 . 2022-03-22 . https://web.archive.org/web/20220322081928/http://www.dlib.si/stream/URN:NBN:SI:DOC-IK51U9CM/895b643a-1b1d-468f-8970-096c9004202e/PDF . live .
  21. Web site: STATS.ox.ac.uk – Social Network Analysis . 2021-08-18 . 2021-08-18 . https://web.archive.org/web/20210818092755/https://www.stats.ox.ac.uk/~snijders/socnet.htm . live .
  22. Steiber . Steven R. . 1981 . Building better blockmodels: A non–hierarchical extension of CONCOR with applications to regression analysis . Mid–American Review of Sociology . VI . 17–40 .
  23. Batagelj . Vladimir . Mrvar . Andrej . Ferligoj . Anuška . Doreian . Patrick . 2004 . Generalized Blockmodeling with Pajek . Metodološki zvezki . 1 . 2 . 455–467 .
  24. https://cran.r–project.org/web/packages/blockmodeling/blockmodeling.pdf Cran.R–project.org – Package 'blockmodeling'