## Posts tagged ‘actors’

### Degree Centrality and Variation in Tie Weights

A central metric in network research is the number of ties each node has, degree. Degree has been generalised to weighted networks as the sum of tie weights (Barrat et al., 2004), and as a function of the number of ties and the sum of their weights (Opsahl et al., 2010). However, all these measures are insensitive to variation in the tie weights. As such, the two nodes in this diagram would always have the same degree score. This post showcases a new measure that uses a tuning parameter to control whether variation should be taken favourable or discount the degree centrality score of a focal node.

### Article: For the few not the many? The effects of affirmative action on presence, prominence, and social capital of women directors in Norway

A paper called “For the few not the many? The effects of affirmative action on presence, prominence, and social capital of women directors in Norway” that I have co-authored will be published in the Scandinavian Journal of Management. Governments have implemented various affirmative action policies to address vertical sex segregation in organizations. A gender representation law was introduced in Norway, which required public limited companies’ boards to have at least 40 percent representation of each sex by 2008. This law acted as an external shock, and this paper aims to explore its effects. In particular, it explores the gender bias, the emergence and sex of prominent directors, and directors’ social capital. We utilize data from May 2002 to August 2009 to analyze these aspects. The implied intention of the law was to create a larger pool of women acting as directors on boards, and the law has had the effect of increasing the representation of women on boards. However, it has also created a small elite of women directors who rank among the top on a number of proxies of influence.

Continue Reading *September 30, 2010 at 4:02 pm* *
Leave a comment *

### Article: Node centrality in weighted networks: Generalizing degree and shortest paths

A paper called “Node centrality in weighted networks: Generalizing degree and shortest paths” that I have co-authored will be published in Social Networks. Ties often have a strength naturally associated with them that differentiate them from each other. Tie strength has been operationalized as weights. A few network measures have been proposed for weighted networks, including three common measures of node centrality: degree, closeness, and betweenness. However, these generalizations have solely focused on tie weights, and not on the number of ties, which was the central component of the original measures. This paper proposes generalizations that combine both these aspects. We illustrate the benefits of this approach by applying one of them to Freeman’s EIES dataset.

### Closeness centrality in networks with disconnected components

A key node centrality measure in networks is closeness centrality (Freeman, 1978; Wasserman and Faust, 1994). It is defined as the inverse of farness, which in turn, is the sum of distances to all other nodes. As the distance between nodes in disconnected components of a network is infinite, this measure cannot be applied to networks with disconnected components (Opsahl et al., 2010; Wasserman and Faust, 1994). This post highlights a possible work-around, which allows the measure to be applied to these networks and at the same time maintain the original idea behind the measure.

### Similarity between node degree and node strength

This post explores the relationship between node degree and node strength in an online social network. In the online social network, heterogeneity in nodes’ average tie weight across different levels of degree had been reported. Although degree and average tie weight are significantly correlated, this post argues for the similarity of degree and node strength. In particular, high pair-wise correlation between degree and strength is found. In addition, power-law exponents of degree distributions and strength distribution are reported. The exponents are strikingly similar, in fact, they are almost identical.

Continue Reading *October 16, 2009 at 12:57 pm* *
Leave a comment *

### Projecting two-mode networks onto weighted one-mode networks

This post highlights a number of methods for projecting both binary and weighted two-mode networks (also known as affiliation or bipartite networks) onto weighted one-mode networks. Although I would prefer to analyse two-mode networks in their original form, few methods exist for that purpose. These networks can be transformed into one-mode networks by projecting them (i.e., selecting one set of nodes, and linking two nodes if they are connected to the same node of the other set). Traditionally, ties in the one-mode networks are without weights. By carefully considering multiple ways of projecting two-mode networks onto weighted one-mode networks, we can maintain some of the richness contained within the two-mode structure. This enables researchers to conduct a deeper analysis than if the two-mode structure was completely ignored.

*tnet*manual, see Projecting Two-mode Networks.

### Network? Weighted network?

Networks are the cornerstone of this blog, therefore I have decided to make the first post my definition of a network and a few basic network measures.