Standard

Kirchhoff Centrality Measure for Collaboration Network. / Mazalov, Vladimir V.; Tsynguev, Bulat T.

2016. 147-157 Работа представлена на 5th International Conference Computational Social Networks
, Ho Chi Minh City, Вьетнам.

Результаты исследований: Материалы конференций › материалы › Рецензирование

Harvard

Mazalov, VV & Tsynguev, BT 2016, 'Kirchhoff Centrality Measure for Collaboration Network', Работа представлена на 5th International Conference Computational Social Networks
, Ho Chi Minh City, Вьетнам, 2/08/16 - 4/08/16 стр. 147-157. https://doi.org/10.1007/978-3-319-42345-6_13

APA

Mazalov, V. V., & Tsynguev, B. T. (2016). Kirchhoff Centrality Measure for Collaboration Network. 147-157. Работа представлена на 5th International Conference Computational Social Networks
, Ho Chi Minh City, Вьетнам. https://doi.org/10.1007/978-3-319-42345-6_13

Vancouver

Mazalov VV, Tsynguev BT. Kirchhoff Centrality Measure for Collaboration Network. 2016. Работа представлена на 5th International Conference Computational Social Networks
, Ho Chi Minh City, Вьетнам. https://doi.org/10.1007/978-3-319-42345-6_13

Author

Mazalov, Vladimir V. ; Tsynguev, Bulat T. / Kirchhoff Centrality Measure for Collaboration Network. Работа представлена на 5th International Conference Computational Social Networks
, Ho Chi Minh City, Вьетнам.11 стр.

BibTeX

@conference{ac2d1027ca9b43669d3356ebf02749dd,
title = "Kirchhoff Centrality Measure for Collaboration Network",
abstract = "This paper extends the concept of betweenness centrality based on Kirchhoff{\textquoteright}s law for electric circuits from centrality of nodes to centrality of edges. It is shown that this new measure admits analytical definition for some classes of networks such as bipartite graphs, with computation for larger networks. This measure is applied for detecting community structure within networks. The results of numerical experiments for some examples of networks, in particular, Math-Net.ru (a Web portal of mathematical publications) are presented, and a comparison with PageRank is given.",
author = "Mazalov, {Vladimir V.} and Tsynguev, {Bulat T.}",
year = "2016",
doi = "10.1007/978-3-319-42345-6_13",
language = "English",
pages = "147--157",
note = "5th International Conference Computational Social Networks<br/>, CSoNet 2016 ; Conference date: 02-08-2016 Through 04-08-2016",

}

RIS

TY - CONF

T1 - Kirchhoff Centrality Measure for Collaboration Network

AU - Mazalov, Vladimir V.

AU - Tsynguev, Bulat T.

PY - 2016

Y1 - 2016

N2 - This paper extends the concept of betweenness centrality based on Kirchhoff’s law for electric circuits from centrality of nodes to centrality of edges. It is shown that this new measure admits analytical definition for some classes of networks such as bipartite graphs, with computation for larger networks. This measure is applied for detecting community structure within networks. The results of numerical experiments for some examples of networks, in particular, Math-Net.ru (a Web portal of mathematical publications) are presented, and a comparison with PageRank is given.

AB - This paper extends the concept of betweenness centrality based on Kirchhoff’s law for electric circuits from centrality of nodes to centrality of edges. It is shown that this new measure admits analytical definition for some classes of networks such as bipartite graphs, with computation for larger networks. This measure is applied for detecting community structure within networks. The results of numerical experiments for some examples of networks, in particular, Math-Net.ru (a Web portal of mathematical publications) are presented, and a comparison with PageRank is given.

U2 - 10.1007/978-3-319-42345-6_13

DO - 10.1007/978-3-319-42345-6_13

M3 - Paper

SP - 147

EP - 157

T2 - 5th International Conference Computational Social Networks<br/>

Y2 - 2 August 2016 through 4 August 2016

ER -

ID: 133691516