|
|
|
| Untersuchte Arbeit: Seite: 438, Zeilen: 12-14, 19-20 |
Quelle: Freeman 1980 Seite(n): 588, Zeilen: 1ff |
|---|---|
| Now we define dependence centrality as the degree to which a node, u, must depend upon another, v, to relay its messages along geodesics to and from all other reachable nodes in the network. Thus, for a network containing n nodes, the dependence centrality of u on v can be found by using: [...]
We can calculate the dependence centrality of each vertex on every other vertex in the network and arrange the results in a matrix [...] |
Now we can define pair-dependency as the degree to which a point, pi, must depend upon another, pj, to relay its messages along geodesics to and from all other reachable points in the network. Thus, for a network containing n points, [...]
We can calculate the pair-dependencies of each point on every other point in the network and arrange the results in a matrix, |
The notion of pair-dependency, which has been known for some time, is called "dependence centrality" in this paper (the used formula is a slight adaptation of the original formula). A source is not mentioned, although some text appears to have been taken from this paper. |
|