Content deleted Content added
Rescuing 6 sources and tagging 0 as dead.) #IABot (v2.0.9.3 |
Copy editing |
||
Line 12:
[[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).]]
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>
[[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"/>
Line 27:
== 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.<ref name="gener-black"/>{{rp|6–10}} 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.<ref name="ReferenceA"/>
|