Network? Weighted network?
November 28, 2008

, individuals
, groups, organisations, airports
, or even a countries, whereas ties can take the form of friendship, communication, collaboration, alliance, flow, or trade
, to name only a few.

By recording the strength of ties, we can create a weighted network. However, these networks are more difficult to analyse than if ties were simply present or absent. I devoted a large part my Ph.D. thesis
to the analysis of these networks.
Basic network definitions
Throughout this blog I make use of some network terminology beyond nodes and ties, and I would like to clarify my definition of these terms.
Undirected / directed network


Degree and Strength of nodes
The degree of a node is equal to the number of other nodes the node is connected to. For example, node E in the above undirected network has a degree of 2 since it is connected to nodes B and F. In a directed network, each node can have an out-degree and in-degree. Out-degree is the number of nodes that the node connect to, whereas in-degree is the number of nodes that connect to the node. In the directed network, node E would have an out-degree of 2, but only an in-degree of 1 since only node B has directed a tie towards it.
The strength of a node is equal to the sum of weights attached to the ties that connect a node to others. For node E in the undirected network, this would be equal to 3. In a similar fashion as degree, in a directed network, each node has an out-strength and an in-strength. Out-strength is the sum of weights attached to ties originating from the node, whereas in-strength is the sum of weights attached to ties directed toward the node. Therefore, node E would have an out-strength of 3, but only an in-strength of 2.
One-/two-mode networks

Two-mode network projected onto a one-mode weighted network
Although the two-mode structure contains a number of details of the network, few network measures exist for two-mode networks. Therefore, these networks are often projected onto a one-mode network (only one type of nodes). This is done by selecting one of the sets of nodes and linking two nodes from that set if they were connected to the same node (of the other kind). This process is illustrated for the blue nodes of the second part of the diagram above. For example, node E and node F are connected to the same red node, therefore, in the one-mode projection they are tied together.
References
Davis, A., Gardner, B. B., Gardner, M. R., 1941. Deep South. University of Chicago Press, Chicago, IL.
Lazega, E., 2001. The Collegial Phenomenon: The Social Mechanisms of Cooperation Among Peers in a Corporate Law Partnership. Oxford University Press, Oxford, UK.
Newman, M. E. J., 2001. Scientific collaboration networks. II. Shortest paths, weighted networks, and centrality. Physical Review E 64, 016132.
Entry Filed under: Network thoughts. Tags: actors, arcs, complex networks, degree, directed networks, edges, graphs, Links, network, nodes, social network analysis, strength of nodes, strength of ties, ties, undirected networks, valued networks, vertices, weighted networks.
3 Comments Add your own
Leave a Comment
Some HTML allowed:
<a href="" title=""> <abbr title=""> <acronym title=""> <b> <blockquote cite=""> <cite> <code> <pre> <del datetime=""> <em> <i> <q cite=""> <strike> <strong>
Trackback this post | Subscribe to the comments via RSS Feed

1.
Julio Encinas | January 12, 2010 at 4:10 am
I am making the design of a graduate social network, creating groups according their career; then groups by the school, by the campus and finally by the whole university. I think that woul help governance and some sort of competititon among them.
I have found difficult to categorize this kind of network, can you help me about this?
2.
Tore Opsahl | January 12, 2010 at 9:54 am
Julio,
I am not entire sure what you mean by categorization of networks. Are you trying to see if it is a small world, or are you trying to find communities within the network?
Tore
3.
Julio Encinas | January 12, 2010 at 4:20 pm
Dear Tore,
I am trying to give an answer to a disperse UABC alumni community using SN. At the beginnig, I was thinking in one group with free play, everybody mixed up, but now I want to “force” its structure wich would change the performance. Leaders from every group will be chosen and the institution will recognize them. Fresh alumni will be asked to join the net, all interaction with alumni would imply an invitation and data refreshment.
We will have several networks nested…
This project is part of my doctoral studies in engineering education. Do you have references of previous work according with my ideas?
Thank you for your answer, I appreciate very much your kinf attention.
Julio