Académique Documents
Professionnel Documents
Culture Documents
1 Introduction
Thus, the Laplacian matrix for the modified graph G has the form
⎛ ⎞
d1 + β −w1,2 . . . −w1,n −β
⎜ −w2,1 d2 + β . . . −w2,n −β ⎟
⎜ ⎟
⎜ .. ⎟ .
L(G ) = D(G ) − W (G ) = ⎜ ...
..
.
..
.
..
. . ⎟
⎜ ⎟
⎝ −wn,1 −wn,2 . . . dn + β −β ⎠
−β −β . . . −β βn
Suppose that a unit of current flows into node s ∈ V and node n + 1 is grounded.
Let ϕsi be the electric potential at node i when an electric charge is concentrated
at node s. By Kirchhoff’s current law, the vector of all potentials ϕs (G ) =
[ϕs1 , . . . , ϕsn , ϕsn+1 ]T at the nodes of the graph G satisfies the following system
of equations:
L(G )ϕs (G ) = bs , (2)
where bs is the (n + 1)-dimensional vector
1 i = s,
bs (i) = (3)
0 otherwise.
Given that the electric charge is concentrated at node s, the mean value of
the current flowing through node i is
1
And finally, define the beta current flow centrality (βCF-centrality) of node
i in the form
1
s
CFβ (i) = x (i). (7)
n
s∈V
150 V.V. Mazalov and B.T. Tsynguev
First, compute the βCF-centrality of the nodes in this network with β = 0.5.
This method ranks nodes 2 and 11 as higher ones with centrality value 0.291
and node 1 as third with centrality value 0.147. The other nodes have centrality
values 0.127.
Then, calculate the βCF-centrality of the edges in this graph. The βCF-
centrality of the edge (2, 11) is 0.137, and the centrality of edges (1, 2), (1, 11) is
0.101. The other edges have centrality 0.0647.
In fact, the centrality of nodes 2 and 11 is twice as great as that of node 1. At
the same time, the centrality of node 1 and adjacent edges exceeds the centrality
of the other nodes and edges in the network.
D(G) − W (G) + βI
⎛ ⎞
n−2+β 0 −1 −1 . . . −1
⎜ 0 n − 2 + β −1 −1 . . . −1 ⎟
⎜ ⎟
⎜ −1 −1 2 + β 0 ... 0 ⎟
⎜ ⎟
= ⎜ −1 −1 0 2 + β ... 0 ⎟ .
⎜ ⎟
⎜ .. .. .. .. .. .. ⎟
⎝ . . . . . . ⎠
−1 −1 0 0 ... 2 + β
(n − 2)
xs (v1 ) = ,
2(n + β − 2)(β + n)
s 1 (β + n − 1)(n − 2)
x (v2 ) = 1+ ,
2 (n + β)(n + β − 2)
1
xs (v ) = .
2(n + β − 2)
For s = v ,
β + 2n − 4
xs (v1 ) = xs (v2 ) = ,
2(2 + β)(β + n)
152 V.V. Mazalov and B.T. Tsynguev
s 1 2(β + n − 1)
x (s) = 1+ ,
2 (2 + β)(β + n)
1
xs (v ) = ,
(2 + β)(β + n)
which yields
1 n−2 (n − 2)(β + 2n − 4)
CFβ (v1 ) = CFβ (v2 ) = 1+ + ,
2n n+β−2 (2 + β)(β + n)
1 2 2(β + 2n − 4)
CFβ (v ) = 1+ + .
2n n + β − 2 (2 + β)(β + n)
Let V1 = {v1 , v2 , v3 }, v ∈ V2 .
In this case, the Laplacian matrix is
D(G) − W (G) + βI
⎛ ⎞
n−3+β 0 0 −1 −1 . . . −1
⎜ 0 n − 3 + β 0 −1 −1 . . . −1 ⎟
⎜ ⎟
⎜ 0 0 n − 3 +β −1 −1 . . . −1 ⎟
⎜ ⎟
⎜ −1 −1 −1 3+β 0 ... 0 ⎟
=⎜ ⎟.
⎜ −1 −1 −1 0 3+β ... 0 ⎟
⎜ ⎟
⎜ .. .. .. .. .. .. . ⎟
⎝ . . . . . . .. ⎠
−1 −1 −1 0 0 ... 3 + β
1 (n − r)(β + n − 2 + r) (n − r)(β + 2n − 2 − r)
CFβ (v) = 1+ + ,
2n (n + β − r)(β + n) (r + β)(β + n)
1 r(β + n − 2 + r) r(β + 2n − 2 − r)
CFβ (v ) = 1+ + .
2n (n + β − r)(β + n) (r + β)(β + n)
Observe that all edges have the same βCF-centrality for the bipartite graph
Kr,n−r , i.e.,
1 β+n−2+r β + 2n − 2 − r
CFβ (e) = + .
n (n + β − r)(β + n) (r + β)(β + n)
Figure 3 shows the subgraph associated with Math-Net.ru, a Web portal of math-
ematical publications. The total amount of the authors on the portal is 78839.
154 V.V. Mazalov and B.T. Tsynguev
We will consider only one connected component of this graph with 7606 mathe-
maticians and 10747 publications coauthored by them. The nodes of the graph
describe the authors and the link weights give the number of coauthored publi-
cations. Actually, the publications having more that 6 coauthors are ignored.
For simplicity, all links with the weights smaller than 7 are deleted, see the
result in Fig. 4. Clearly, nodes 40, 34, 56 and 20 represent the centers of “local”
stars and, consequently, must have a high centrality. Note that node 32 also
must have a high centrality, as connecting two separate components.
Table 1 combines the ranking results for the first 11 nodes of the graph using
βCF-centrality (formula (8) with the parameter β = 1), the PageRank algorithm
with the parameter α = 0.85 and electric centrality (CF-betweenness) developed
in [7,8].
As supposed, nodes 40, 34, 56 and 20 have high centrality in all ranking
methods considered. But PageRank assigns a low rank (34) to node 32.
Now, let us detect the community structure of the network adhering to the
approach developed in [10]. The whole idea of this approach lies in the following.
If a network contains communities or groups that are only weakly connected via
a few internal edges, then the edges connecting the communities have a high
βCF centrality. By removing these edges, the groups are separated from each
other, and the underlying community structure of the network is revealed.
Kirchhoff Centrality Measure for Collaboration Network 155
First, calculate the βCF -centrality of all edges in the network. Find an edge
with the higher centrality (actually, edge (32,56)) and remove it from the graph.
Next, recalculate the βCF centrality of all edges in the modified network. Again,
find an edge with the higher centrality and remove it from the graph, etc. The
described process is continued until no edges remain.
The results of these computations are presented below.
(32, 56), (9, 30), (47, 52), (20, 75), (22, 26), (34, 119), (128, 132), (9, 11), (4, 5), . . .
After ranking of all edges, all nodes of the network can be divided into the
communities (clusters). Figure 4 shows the resulting community structure of the
collaboration network on the Web portal Math-Net.ru. The graph splits into 7
communities corresponding to different fields of mathematics, namely, coding,
156 V.V. Mazalov and B.T. Tsynguev
6 Conclusion
This paper has investigated the community structure of networks using a new
concept of betweenness centrality measure. The βCF-centrality measure of the
nodes in a network depending on the parameter β was introduced earlier in [3]
based on electric circuit interpretation. In the present paper, this measure has
been extended to the edges in a network. Moreover, the measure has been applied
for detecting the community structure of networks. The proposed method has
been have tested on the graph of mathematical publications available at the Web
portal Math-Net.ru.
References
1. Aumann, R., Myerson, R.: Endogenous formation of links between players and
coalitions: an application of the Shapley value. In: Roth, A. (ed.) The Shapley
Value, pp. 175–191. Cambridge University Press, Cambridge (1988)
2. Avrachenkov, K., Litvak, N., Medyanikov, V., Sokol, M.: Alpha current flow
betweenness centrality. In: Bonato, A., Mitzenmacher, M., Pralat, P. (eds.) WAW
2013. LNCS, vol. 8305, pp. 106–117. Springer, Heidelberg (2013)
Kirchhoff Centrality Measure for Collaboration Network 157
3. Avrachenkov, K.E., Mazalov, V.V., Tsynguev, B.T.: Beta current flow centrality
for weighted networks. In: Thai, M.T., Nguyen, N.T., Shen, H. (eds.) CSoNet 2015.
LNCS, vol. 9197, pp. 216–227. Springer, Heidelberg (2015)
4. Borgatti, S.P., Everett, M.G., Freeman, L.C.: Ucinet for Windows: Software for
Social Network Analysis. Analytic Technologies, Harvard (2002)
5. Borm, P., Owen, G., Tijs, S.: On the position value for communication situations.
SIAM J. Disc. Math. 5(3), 305–320 (1992)
6. Borm, P., van den Nouweland, A., Tijs, S.: Cooperation and communication restric-
tions: a survey. In: Gilles, R.P., Ruys, P.H.M. (eds.) Imperfections and Behavior
in Economic Organizations. Kluwer Academic Publishers, Boston (1994)
7. Brandes, U.: A faster algorithm for betweenness centrality. J. Math. Sociol. 25,
163–177 (2001)
8. Brandes, U., Fleischer, D.: Centrality measures based on current flow. In: Diek-
ert, V., Durand, B. (eds.) STACS 2005. LNCS, vol. 3404, pp. 533–544. Springer,
Heidelberg (2005)
9. Freeman, L.C.: A set of measures of centrality based on betweenness. Sociometry
40, 35–41 (1977)
10. Girvan, M., Newman, M.E.J.: Community structure in social and biological net-
works. Proc. Natl. Acad. Sci. U.S.A. 99(12), 7821–7826 (2002)
11. Jackson, M.O.: Allocation rules for network games. Games Econ. Behav. 51(1),
128–154 (2005)
12. Jackson, M.O.: Social and Economic Networks. Princeton University Press, Prince-
ton (2008)
13. Mazalov, V.V., Trukhina, L.I.: Generating functions and the Myerson vector in
communication networks. Disc. Math. Appl. 24(5), 295–303 (2014)
14. Newman, M.E.J.: A measure of betweenness centrality based on random walks.
Soc. Netw. 27, 39–54 (2005)
15. Opsahl, T., Agneessens, F., Skvoretz, J.: Node centrality in weighted networks:
generalizing degree and shortest paths. Soc. Netw. 32, 245–251 (2010)
16. Slikker, M., Gilles, R.P., Norde, H., Tijs, S.: Directed networks, allocation proper-
ties and hierarchy formation. Math. Soc. Sci. 49(1), 55–80 (2005)
17. Talman, D., Yamamoto, Y.: Average tree solutions and subcore for acyclic graph
games. J. Oper. Res. Soc. Jpn. 51(3), 187–201 (2008)