Structural holes

Last updated

Structural holes is a concept from social network research, originally developed by Ronald Stuart Burt. A structural hole is understood as a gap between two individuals who have complementary sources to information. The study of structural holes spans the fields of sociology, economics, and computer science. Burt introduced this concept in an attempt to explain the origin of differences in social capital. Burt’s theory suggests that individuals hold certain positional advantages/disadvantages from how they are embedded in neighborhoods or other social structures.

Contents

The concept

Most social structures tend to be characterized by dense clusters of strong connections, also known as network closure. The theory relies on a fundamental idea that the homogeneity of information, new ideas, and behavior is generally higher within any group of people as compared to that in between two groups of people. [1] An individual who acts as a mediator between two or more closely connected groups of people could gain important comparative advantages. In particular, the position of a bridge between distinct groups allows him or her to transfer or gatekeep valuable information from one group to another. [2] In addition, the individual can combine all the ideas he or she receives from different sources and come up with the most innovative idea among all. [1] At the same time, a broker also occupies a precarious position, as ties with disparate groups can be fragile and time consuming to maintain.

Two types of network structure Network Structure.jpg
Two types of network structure

If we compare two nodes, node A is more likely to get novel information than node B, even though they have the same number of links. This is so because nodes connected to B are also highly connected between each other. Therefore, any information that any of them could get from B, it could easily get from other nodes as well. Furthermore, the information, which B gets from different connections, is likely to be overlapping, so connections involving node B are said to be redundant. On contrary, the position of node A makes it serve as a bridge or a ‘broker’ between three different clusters. Thus, node A is likely to receive some non-redundant information from its contacts. The term ‘structural holes’ is used for the separation between non-redundant contacts. As a result of the hole between two contacts, they provide network benefits to the third party (to node A).

Measures

Bridge counts

Bridge count is a simple and intuitive measure of structural holes in a network. Bridge is defined as a relation between two individuals if there is no indirect connection between them through mutual contacts. [3]

Effective size

Burt's formula

Burt introduced the measure of a network’s redundancy. He aims to estimate to what extent contact j is redundant with other contacts of node i. Redundancy is understood as an investment of time and energy in a relationship with another node q, with whom node j is strongly connected. [2]

Where piq is proportion of i’s energy invested in relationship with q,

And mjq is calculated as j’s interaction with q divided by j’s strongest relationship with anyone.

The redundancy in network is calculated by summing up this product across all nodes q. One minus this expression expresses the non-redundant portion of relationship. Effective size of i’s network is defined as a sum of the j’s nonredundant contacts.

The more each node is disconnected from other primary contacts, the higher the effective size would be. This indicator varies from 1 (network only provides a single link) to the total number of links N (each contact is non-redundant).

Borgatti's reformulation of Burt's formula

Borgatti developed a simplified formula to calculate effective size for unweighted networks. [4]

Where t is the number of the total ties in the egocentric network (excluding those ties to the ego) and n is the number of total nodes in the egocentric network (excluding the ego). This formula can be modified to calculate the effective size of the ego's network.

Constraint

Network constraint of a network is a sum of each connection's constraints cij:

This indicator measures the extent to which time and energy is concentrated within a single cluster. It consists of two components: direct, when a contact consumes a large proportion of a network's time and energy, and indirect, when a contact controls other individuals, who consume a large proportion of a network's time and energy.

Network constraint measures the extent to which the manager’s network of colleagues is like a straitjacket around the manager, limiting his or her vision of alternative ideas and sources of support. It depends on three network characteristics: size, density, and hierarchy. Constraint on an individual would be generally higher in case of a small network (he or she has just few contacts), and if contacts are highly connected between each other (either directly as in a dense network, or indirectly, through the mutual central contact as in a hierarchical network). [5]

Structural holes vs. Weak ties

The idea behind structural holes theory is somewhat close to the strength of weak ties theory, famously developed by Mark Granovetter. According to weak ties argument, the stronger the tie between two people is, the more likely their contacts will overlap so that they will have common ties with the same third parties. [6] This implies that bridging ties are a potential source of novel ideas. Therefore, Granovetter argues that strong ties are unlikely to transfer any novel information. [6]

Both concepts rely on the same underlying model, however, some differences between them can be distinguished. While Granovetter claims that whether a contact would serve as a bridge depends on a tie’s strength, Burt considers the opposite direction of causality. [7] Thus, he prefers the proximal cause (bridging ties), while Granovetter argues in favor of the distal cause (strength of ties). [7]

Applications

The networks rich in structural holes were referred to as entrepreneurial networks, and the individual who benefits from structural holes is considered as an entrepreneur. Application for this theory can be found in one of Burt's studies of entrepreneurial network. He studied a network of 673 managers in the supply chain for the firm, and measured the degree of social brokerage. All the managers had to submit their ideas about the ways to improve supply chain management, which were then evaluated by judges. [1] The findings of this empirical study:

There are several practical scenarios related to structural hole-related applications, including enterprise settings, information diffusion in social networks, software development, mobile applications, and machine learning (ML)-based social prediction. [8]

Related Research Articles

<span class="mw-page-title-main">Social network analysis</span> Analysis of social structures using network and graph theory

Social network analysis (SNA) is the process of investigating social structures through the use of networks and graph theory. It characterizes networked structures in terms of nodes and the ties, edges, or links that connect them. Examples of social structures commonly visualized through social network analysis include social media networks, meme spread, information circulation, friendship and acquaintance networks, peer learner networks, business networks, knowledge networks, difficult working relationships, collaboration graphs, kinship, disease transmission, and sexual relationships. These networks are often visualized through sociograms in which nodes are represented as points and ties are represented as lines. These visualizations provide a means of qualitatively assessing networks by varying the visual representation of their nodes and edges to reflect attributes of interest.

<span class="mw-page-title-main">Centrality</span> Degree of connectedness within a graph

In graph theory and network analysis, indicators of centrality assign numbers or rankings to nodes within a graph corresponding to their network position. Applications include identifying the most influential person(s) in a social network, key infrastructure nodes in the Internet or urban networks, super-spreaders of disease, and brain networks. Centrality concepts were first developed in social network analysis, and many of the terms used to measure centrality reflect their sociological origin.

The finite element method (FEM) is a powerful technique originally developed for numerical solution of complex problems in structural mechanics, and it remains the method of choice for complex systems. In the FEM, the structural system is modeled by a set of appropriate finite elements interconnected at discrete points called nodes. Elements may have physical properties such as thickness, coefficient of thermal expansion, density, Young's modulus, shear modulus and Poisson's ratio.

<span class="mw-page-title-main">Interpersonal ties</span>

In social network analysis and mathematical sociology, interpersonal ties are defined as information-carrying connections between people. Interpersonal ties, generally, come in three varieties: strong, weak or absent. Weak social ties, it is argued, are responsible for the majority of the embeddedness and structure of social networks in society as well as the transmission of information through these networks. Specifically, more novel information flows to individuals through weak rather than strong ties. Because our close friends tend to move in the same circles that we do, the information they receive overlaps considerably with what we already know. Acquaintances, by contrast, know people that we do not, and thus receive more novel information.

A personal network is a set of human contacts known to an individual, with whom that individual would expect to interact at intervals to support a given set of activities. In other words, a personal network is a group of caring, dedicated people who are committed to maintain a relationship with a person in order to support a given set of activities. Having a strong personal network requires being connected to a network of resources for mutual development and growth.

Mixing patterns refer to systematic tendencies of one type of nodes in a network to connect to another type. For instance, nodes might tend to link to others that are very similar or very different. This feature is common in many social networks, although it also appears sometimes in non-social networks. Mixing patterns are closely related to assortativity; however, for the purposes of this article, the term is used to refer to assortative or disassortative mixing based on real-world factors, either topological or sociological.

<span class="mw-page-title-main">Assortativity</span> Tendency for similar nodes to be connected

Assortativity, or assortative mixing, is a preference for a network's nodes to attach to others that are similar in some way. Though the specific measure of similarity may vary, network theorists often examine assortativity in terms of a node's degree. The addition of this characteristic to network models more closely approximates the behaviors of many real world networks.

<span class="mw-page-title-main">Triadic closure</span>

Triadic closure is a concept in social network theory, first suggested by German sociologist Georg Simmel in his 1908 book Soziologie [Sociology: Investigations on the Forms of Sociation]. Triadic closure is the property among three nodes A, B, and C, that if the connections A-B and A-C exist, there is a tendency for the new connection B-C to be formed. Triadic closure can be used to understand and predict the growth of networks, although it is only one of many mechanisms by which new connections are formed in complex networks.

Social network analysis (SNA) software is software which facilitates quantitative or qualitative analysis of social networks, by describing features of a network either through numerical or visual representation.

<span class="mw-page-title-main">Network science</span> Academic field

Network science is an academic field which studies complex networks such as telecommunication networks, computer networks, biological networks, cognitive and semantic networks, and social networks, considering distinct elements or actors represented by nodes and the connections between the elements or actors as links. The field draws on theories and methods including graph theory from mathematics, statistical mechanics from physics, data mining and information visualization from computer science, inferential modeling from statistics, and social structure from sociology. The United States National Research Council defines network science as "the study of network representations of physical, biological, and social phenomena leading to predictive models of these phenomena."

<span class="mw-page-title-main">Modularity (networks)</span> Measure of network community structure

Modularity is a measure of the structure of networks or graphs which measures the strength of division of a network into modules. Networks with high modularity have dense connections between the nodes within modules but sparse connections between nodes in different modules. Modularity is often used in optimization methods for detecting community structure in networks. Biological networks, including animal brains, exhibit a high degree of modularity. However, modularity maximization is not statistically consistent, and finds communities in its own null model, i.e. fully random graphs, and therefore it cannot be used to find statistically significant community structures in empirical networks. Furthermore, it has been shown that modularity suffers a resolution limit and, therefore, it is unable to detect small communities.

A bridge is a type of social tie that connects two different groups in a social network.

<span class="mw-page-title-main">Weighted network</span> Network where the ties among nodes have weights assigned to them

A weighted network is a network where the ties among nodes have weights assigned to them. A network is a system whose elements are somehow connected. The elements of a system are represented as nodes and the connections among interacting elements are known as ties, edges, arcs, or links. The nodes might be neurons, individuals, groups, organisations, airports, or even countries, whereas ties can take the form of friendship, communication, collaboration, alliance, flow, or trade, to name a few.

<span class="mw-page-title-main">Betweenness centrality</span> Measure of a graphs centrality, based on shortest paths

In graph theory, betweenness centrality is a measure of centrality in a graph based on shortest paths. For every pair of vertices in a connected graph, there exists at least one shortest path between the vertices such that either the number of edges that the path passes through or the sum of the weights of the edges is minimized. The betweenness centrality for each vertex is the number of these shortest paths that pass through the vertex.

Complex contagion is the phenomenon in social networks in which multiple sources of exposure to an innovation are required before an individual adopts the change of behavior. It differs from simple contagion in that unlike a disease, it may not be possible for the innovation to spread after only one incident of contact with an infected neighbor. The spread of complex contagion across a network of people may depend on many social and economic factors; for instance, how many of one's friends adopt the new idea as well as how many of them cannot influence the individual, as well as their own disposition in embracing change.

<span class="mw-page-title-main">Social network</span> Social structure made up of a set of social actors

A social network is a social structure made up of a set of social actors, sets of dyadic ties, and other social interactions between actors. The social network perspective provides a set of methods for analyzing the structure of whole social entities as well as a variety of theories explaining the patterns observed in these structures. The study of these structures uses social network analysis to identify local and global patterns, locate influential entities, and examine network dynamics.

In graph theory and network analysis, node influence metrics are measures that rank or quantify the influence of every node within a graph. They are related to centrality indices. Applications include measuring the influence of each person in a social network, understanding the role of infrastructure nodes in transportation networks, the Internet, or urban networks, and the participation of a given node in disease dynamics.

In mathematical modeling of social networks, link-centric preferential attachment is a node's propensity to re-establish links to nodes it has previously been in contact with in time-varying networks. This preferential attachment model relies on nodes keeping memory of previous neighbors up to the current time.

<span class="mw-page-title-main">Temporal network</span> Network whose links change over time

A temporal network, also known as a time-varying network, is a network whose links are active only at certain points in time. Each link carries information on when it is active, along with other possible characteristics such as a weight. Time-varying networks are of particular relevance to spreading processes, like the spread of information and disease, since each link is a contact opportunity and the time ordering of contacts is included.

Cognitive assets are tangible and intangible organizational assets that constitute sources of the cognition that is necessary for action coordination. These assets allow for the integrity and efficiency of the multiple conversions of individual knowledge into organizational knowledge.

References

  1. 1 2 3 Burt, R. (2004). "Structural holes and good ideas". American Journal of Sociology. 110 (2): 349–399. CiteSeerX   10.1.1.388.2251 . doi:10.1086/421787.
  2. 1 2 Burt, Ronald S. (1995). Structural Holes: The Social Structure of Competition. Cambridge: Harvard University Press. ISBN   978-0-674-84372-1.
  3. Burt, R. S.; Hogarth, R. M.; Michaud, C. (2000). "The social capital of French and American managers". Organization Science. 11 (2): 123–147. doi:10.1287/orsc.11.2.123.12506.
  4. Borgatti, Stephen (1997). "Structural Holes: Unpacking Burt's Redundancy Measures". Connections. INSNA. Retrieved 2021-06-02.
  5. Buskens, V.; van de Rijt, A. (2008). "Dynamics of Networks if Everyone Strives for Structural Holes" (PDF). The American Journal of Sociology. 114 (2): 371–407. doi:10.1086/590674. hdl: 11370/e69c3271-5cff-40a3-b64f-3d75ef039e0e . S2CID   16347266.
  6. 1 2 Granovetter, M. S. (1973). "The Strength of Weak Ties" (PDF). The American Journal of Sociology. 78 (6): 1360–1380. doi:10.1086/225469.
  7. 1 2 Borgatti, S. P.; Kidwell, V. Carrington, P.; Scott, J. (eds.). "Network Theorizing". The Sage Handbook of Social Network Analysis. Sage Publications.
  8. Lin, Zihang; Zhang, Yuwei; Gong, Qingyuan; Chen, Yang; Oksanen, Atte; Ding, Aaron Yi (2022). "Structural Hole Theory in Social Network Analysis: A Review" (PDF). IEEE Transactions on Computational Social Systems. 9 (3): 724–739. doi:10.1109/TCSS.2021.3070321. S2CID   234947970.