Content deleted Content added
No edit summary Tag: Disambiguation links added |
Carlnordlund (talk | contribs) m →Specialized programs: Cleaned up the reference |
||
(28 intermediate revisions by 17 users not shown) | |||
Line 1:
{{Short description|Analytical method for social structure}}
{{Network Science}}
'''Blockmodeling''' is a set or a coherent [[Conceptual framework|framework]], that is used for analyzing [[social structure]] and also for setting procedure(s) for partitioning (clustering) [[social network]]'s units ([[Node (computer science)|nodes]], [[vertice]]s, [[social actor|actors]]), based on specific patterns, which form a distinctive structure through interconnectivity.<ref>[[Patrick Doreian]], Positional Analysis and Blockmodeling. ''Encyclopedia of Complexity and Systems Science''. DOI: https://doi.org/10.1007/978-0-387-30440-3_412 {{Webarchive|url=https://web.archive.org/web/20230204160352/https://link.springer.com/referenceworkentry/10.1007/978-0-387-30440-3_412 |date=2023-02-04 }}.</ref><ref name="Examples, 1999, pp. 5–34">[[Patrick Doreian]], An Intuitive Introduction to Blockmodeling with Examples, ''BMS: Bulletin of Sociological Methodology'' / ''Bulletin de Méthodologie Sociologique'', January, 1999, No. 61 (January, 1999), pp. 5–34.</ref> It is primarily used in [[statistics]], [[machine learning]] and [[network science]].
As an [[empirical procedure]], blockmodeling assumes
While some
The principles of blockmodeling were first introduced by [[Francois Lorrain]] and [[Harrison C. White]] in 1971.<ref name="Examples, 1999, pp. 5–34"/> 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.<ref name="gener-black">{{Cite book |last1=Doreian |first1=Patrick |last2=Batagelj |first2=Vladimir |last3=Ferligoj |first3=Anuška |title=Generalized
== Definition ==
[[File:Social network characteristics diagram.jpg|thumb|upright=1.5|left|350px|Different characteristics of social networks. A, B, and C show varying centrality and density of networks; panel D shows network closure, i.e., when two actors, tied to a common third actor, tend to also form a direct tie between them. Panel E represents two actors with different attributes (e.g., organizational affiliation, beliefs, gender, education) who tend to form ties. Panel F consists of two types of ties: friendship (solid line) and dislike (dashed line). In this case, two actors being friends both dislike a common third (or, similarly, two actors that dislike a common third tend to be friends).]]
Network as a system is composed (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 (discrete mathematics)|graph]], describing the structure of the network.<ref name="ReferenceA">[[Miha Matjašič]], [[Marjan Cugmas]] and [[Aleš Žiberna]], blockmodeling: An R package for generalized blockmodeling, ''Metodološki zvezki'', 17(2), 2020, 49–66.</ref>▼
▲
During blockmodeling, 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).<ref>{{cite journal |last1=Batagelj |first1=Vladimir |date=1997 |title=Notes on blockmodeling |url= |journal=Social Networks |volume=19 |issue= |pages=143–155}}</ref>▼
▲During blockmodeling, the researcher is faced with two problems: how to partition the units (e.g., how to determine the [[Cluster analysis|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).<ref>{{cite journal |last1=Batagelj |first1=Vladimir |date=1997 |title=Notes on blockmodeling |url= |journal=Social Networks |volume=19 |issue= |pages=143–155}}</ref>
When analyzing a [[social network]] (in [[social sciences]]), the networks are usually [[social network]]s, composed of several individuals (units) and selected [[social relationship]]s among them (links). As such real-world networks can be large and complex, a blockmodeling is used to simplify them into smaller structures, that can be much easier to interpret. Specifically, blockmodeling partitions the units into clusters and then determines the ties among the said clusters. At the same time, blockmodeling can be used to explain the [[social role]]s, existing in such network, as it is assumed that the created cluster of units mimics (or is closely associated) with the units' social roles.<ref name="ReferenceA"/>▼
▲
[[File:6n-graf.svg|thumb|250px|right|In [[graph theory]], the image provides a simplified view of a network, where each of the numbers represents a different node.]]
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.<ref name="ReferenceA"/> Each of these positions in the cluster is defined by a set of (in)direct ties to and from other social positions.<ref name="The Algebra of Blockmodeling">{{cite journal |last1=Bonacich |first1=Phillip |last2=McConaghy |first2=Maureen J. |date=1980 |title=The Algebra of Blockmodeling |url= |journal=Sociological Methodology |volume=11 |issue= |pages=489–532 |doi=10.2307/270873}}</ref> 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.<ref>Brian Joseph Ball, ''Blockmodeling techniques for complex networks: doctoral dissertation.'' University of Michigan, 2014.</ref>{{rp|8}}
A [[Matrix (mathematics)|
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.<ref name="mrvar.fdv.uni-lj.si"/> Units can also be regularly equivalent, when they are equivalently connected to equivalent others.<ref name="Examples, 1999, pp. 5–34"/>
With blockmodeling, it is necessary to consider the issue of results being affected by measurement errors in the initial stage of acquiring the data.<ref name="Absent Ties in Social Networks, the">{{cite journal |last1=Žnidaršič |first1=Anja |last2=Doreian |first2=Patrick |last3=Ferligoj |first3=Anuška |date=2012 |title=Absent Ties in Social Networks, their Treatments, and Blockmodeling Outcomes |url= |journal=Metodološki zvezki |volume=9 |issue=2 |pages=119–138 |doi=}}</ref>
== Different approaches ==
Regarding what kind of network is
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.<ref name="ReferenceA"/>
[[File:Structural_Equivalence.jpg|thumb|Structural equivalence]]
Among direct blockmodeling approaches are: [[structural equivalence]] and [[regular equivalence]].<ref name="Examples, 1999, pp. 5–34"/> Structural equivalence is a state, when units are connected to the rest of the network in an identical way(s), while regular equivalence
[[File:Regular equivalence.jpg|thumb|Regular equivalence]]
Indirect blockmodeling approaches, where partitioning is dealt with as a traditional cluster analysis problem (measuring (dis)[[Similarity (network science)|
* [[conventional blockmodeling]],
* [[generalized blockmodeling]]:
** [[generalized blockmodeling of binary
** [[
** [[generalized homogeneity blockmodeling]],<ref>{{cite journal |last1=Žiberna |first1=Aleš |date=2013 |title=Generalized blockmodeling of sparse networks |url= |journal=Metodološki zvezki |volume=10 |issue=2 |pages=99–119 |doi=}}</ref>
* [[prespecified blockmodeling]].
According to Brusco and Steinley (2011),<ref>{{cite journal |last1=Brusco |first1=Michael |last2=Steinley |first2=Douglas|date=2011 |title=A tabu search heuristic for deterministic two-mode blockmodeling |url= |journal=Psychometrika |volume=76 |issue= |pages=
* [[deterministic blockmodeling|deterministic]] or [[stochastic blockmodeling]],
* [[one–mode network|one–mode]] or [[two–mode network]]s,
Line 45 ⟶ 47:
* [[exploratory blockmodeling|exploratory]] or [[confirmatory blockmodeling]].
==Blockmodels==
'''Blockmodels''' (sometimes also '''block models''') are structures in which:
* vertices (e.g., units, [[node (computer network)|nodes]]) are assembled within a [[Cluster analysis|cluster]], with each cluster identified as a [[Vertex (graph theory)|vertex]]; from such vertices a [[Graph (discrete mathematics)|graph]] can be constructed;
* combinations of all the links (ties), represented in a block as a single link between positions, while at the same time constructing one tie for each block. In a case, when there are no ties in a block, there will be no ties between the two positions that define the block.<ref>[[Patrick Doreian]], Positional Analysis and Blockmodeling. ''Encyclopedia of Complexity and Systems Science''. DOI: https://doi.org/10.1007/978-0-387-30440-3_412 {{Webarchive|url=https://web.archive.org/web/20230204160352/https://link.springer.com/referenceworkentry/10.1007/978-0-387-30440-3_412 |date=2023-02-04 }}.</ref>
Computer programs can partition the social network according to pre-set conditions.<ref name="Exploratory">{{Cite book |last1=Nooy |first1=Wouter de |last2=Mrvar |first2=Andrej |last3=Batagelj |first3=Vladimir |title=Exploratory Social Network Analysis with Pajek. Revised and Expanded Edition for Updated Software. Third Edition |publisher=Cambridge University Press |date=2018 |isbn=978-1-108-47414-6}}</ref>{{rp|333}} 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'.<ref>{{cite journal |last1=Nordlund |first1=Carl |date=2019 |title=Direct blockmodeling of valued and binary networks: a dichotomization-free approach |url= |journal=Social Networks |volume= 61|issue= |pages= 128–143|doi=10.1016/j.socnet.2019.10.004|arxiv=1910.10484|s2cid=204838377 }}</ref> 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.<ref>{{cite journal |last1=Arabie |first1=Phipps |last2=Boorman |first2=Scott A. |last3=Levitt |first3=Paul R. |date=1978 |title=Constructing Blockmodels: How and Why |url= |journal=Journal of Mathematical Psychology |volume=17 |issue= |pages=21–63 |doi=10.2307/270873|jstor=270873 }}</ref>
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 [[Cluster analysis|clustering]] to the corresponding ideal blocks with perfect relations within each cluster and between clusters according to the considered types of connections ([[Equivalence relation|equivalence]])".<ref>{{cite journal |last1=Batagelj |first1=Vladimir |last2=Mrvar |first2=andrej |last3=Ferligoj |first3=Anuška |last4=Doreian |first4=Patrick |date=2004 |title=Generalized Blockmodeling with Pajek |url=https://www.dlib.si/stream/URN:NBN:SI:doc-IK51U9CM/895b643a-1b1d-468f-8970-096c9004202e/PDF |journal=Metodološki zvezki |volume=1 |issue=2 |pages=455–467 |doi= |access-date=2023-01-07 |archive-date=2022-03-22 |archive-url=https://web.archive.org/web/20220322081928/http://www.dlib.si/stream/URN:NBN:SI:DOC-IK51U9CM/895b643a-1b1d-468f-8970-096c9004202e/PDF |url-status=live }}</ref>
=== Types ===
Blockmodels can be specified regarding the [[intuition]], [[wikt:substance|substance]] or the insight into the nature of the studied network; this can result in such models as follows:<ref name="gener-black"/>{{rp|16-24}}
* [[parent-child role]] systems,
* [[organizational hierarchy|organizational hierarchies]],
* systems of [[ranked cluster]]s,...
== Specialized programs ==
Blockmodeling is done with specialized [[computer program]]s, dedicated to the analysis of networks or blockmodeling in particular, as:
* '''BLOCKS''' ([[Tom Snijders]]),<ref name="stats.ox.ac.uk">[https://www.stats.ox.ac.uk/~snijders/socnet.htm STATS.ox.ac.uk – Social Network Analysis]</ref>▼
* '''[[CONCOR]]''',<ref>{{cite journal |last1=Steiber |first1=Steven R. |date=1981 |title=Building better blockmodels: A non–hierarchical extension of CONCOR with applications to regression analysis |url= |journal=Mid–American Review of Sociology |volume=VI |issue= |pages=17–40 |doi=}}</ref>▼
* '''Model''' ([[Vladimir Batagelj]]),<ref name="Generalized Blockmodeling with Paje">{{cite journal |last1=Batagelj |first1=Vladimir |last2=Mrvar |first2=andrej |last3=Ferligoj |first3=Anuška |last4=Doreian |first4=Patrick |date=2004 |title=Generalized Blockmodeling with Pajek |url= |journal=Metodološki zvezki |volume=1 |issue=2 |pages=455–467 |doi=}}</ref>▼
* '''[[Pajek]]''' (Vladimir Batagelj and [[Andrej Mrvar]]),<ref name="Generalized Blockmodeling with Paje"/>
* '''[[R (programming language)|R]]–package Blockmodeling''' ([[Aleš Žiberna]]),<ref name="Absent Ties in Social Networks, the"/><ref>[
* '''Socnet.se''': The blockmodeling console app (Win/Linux/Mac) (Carl Nordlund)<ref>{{Cite web |last=Nordlund |first=Carl |date=2024 |title=Socnet.se: The blockmodeling console app |url=https://socnet.se/ |access-date=2025-06-04 |website=socnet.se |language=en}}</ref>
* '''StOCNET''' (Tom Snijders),...<ref name="stats.ox.ac.uk" />
▲** '''BLOCKS''' ([[Tom Snijders]]),<ref name="stats.ox.ac.uk">
▲* '''[[CONCOR]]''',<ref>{{cite journal |last1=Steiber |first1=Steven R. |date=1981 |title=Building better blockmodels: A non–hierarchical extension of CONCOR with applications to regression analysis |url= |journal=Mid–American Review of Sociology |volume=VI |issue= |pages=17–40 |doi=}}</ref>
▲* '''Model''' and '''Model2''' ([[Vladimir Batagelj]]),<ref name="Generalized Blockmodeling with Paje">{{cite journal |last1=Batagelj |first1=Vladimir |last2=Mrvar |first2=
== See also ==
Line 63 ⟶ 77:
* [[Mathematical sociology]]
* [[Role assignment]]
* [[
* [[
== References ==
Line 71 ⟶ 85:
{{Social networking}}
[[Category:Network science]]
[[Category:Blockmodeling| ]]
|