Geodesic
Weighted graph vertices ranking using absolute potentials of electric circuit nodes
Contributions to game theory and management, Tome 16 (2023), pp. 87-98.

Voir la notice de l'article provenant de la source Math-Net.Ru

A method for ranking the vertices of a graph based on Kirchhoff's laws for determining the potentials of an electrical network is proposed. The graph is represented as an electrical network, where the edge weights are interpreted as electrical conductivities. Then the current is sequentially supplied to all vertices and each time the ranks of the vertices are determined in accordance with their potentials. It is also proposed to take into account the weights of the graph vertices, which allows you to include additional information in the analysis.
Keywords: graph, centrality measure, ranking procedure, Kirchhoff's circuit laws, transportation network, electrical circuit model. 
@article{CGTM_2023_16_a6,
     author = {Vitalia A. Khitraya},
     title = {Weighted graph vertices ranking using absolute potentials of electric circuit nodes},
     journal = {Contributions to game theory and management},
     pages = {87--98},
     publisher = {mathdoc},
     volume = {16},
     year = {2023},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/CGTM_2023_16_a6/}
}
TY  - JOUR
AU  - Vitalia A. Khitraya
TI  - Weighted graph vertices ranking using absolute potentials of electric circuit nodes
JO  - Contributions to game theory and management
PY  - 2023
SP  - 87
EP  - 98
VL  - 16
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/CGTM_2023_16_a6/
LA  - en
ID  - CGTM_2023_16_a6
ER  - 
%0 Journal Article
%A Vitalia A. Khitraya
%T Weighted graph vertices ranking using absolute potentials of electric circuit nodes
%J Contributions to game theory and management
%D 2023
%P 87-98
%V 16
%I mathdoc
%U http://geodesic.mathdoc.fr/item/CGTM_2023_16_a6/
%G en
%F CGTM_2023_16_a6
Vitalia A. Khitraya. Weighted graph vertices ranking using absolute potentials of electric circuit nodes. Contributions to game theory and management, Tome 16 (2023), pp. 87-98. http://geodesic.mathdoc.fr/item/CGTM_2023_16_a6/

[1] Avrachenkov, K., Litvak, N., Medyanikov, V., Sokol, M., “Alpha current flow betweenness centrality”, Lecture Notes in Computer Science, 8305, 2013, 106–117 | DOI | MR | Zbl

[2] Avrachenkov, K. E., Mazalov, V. V., Tsynguev, B. T., “Beta current flow centrality for weighted networks”, Lecture Notes in Computer Science, 9197, 2015, 216–227 | DOI

[3] Brandes, U., “Centrality measures based on current flow”, Lecture Notes in Computer Science, 3404, 2005, 533–544 | DOI | MR | Zbl

[4] Ermolin, N. A., Khitraya, V. A., Khitryi, A. V., Mazalov, V. V., Nikitina, N. N., “Modeling of the City's Transport Network Using Game-Theoretic Methods on the Example of Petrozavodsk”, Contributions to Game Theory and Management, 15 (2022), 18–31 | DOI | MR

[5] Kondratev, A. A, Mazalov, V. V., “Ranking procedure with the Shapley value”, International Journal of Game Theory, 49 (2020), 119–145 | DOI | MR | Zbl

[6] Mazalov, V. V., Khitraya, V. A., “A Modified Myerson Value for Determining the Centrality of Graph Vertices”, Automation and Remote Control, 82:1 (2021), 145–159 | DOI | MR | Zbl

[7] Mazalov, V. V., Khitraya, V. A., “Graph vertices ranking using absolute potentials of electric circuit nodes”, Vestnik of Saint Petersburg University. Applied Mathematics. Computer Science. Control Processes, 19:2 (2023), 233–250 (in Russian) | DOI | MR

[8] Newman, M. E. J., “A measure of betweenness centrality based on random walks”, Social Networks, 27 (2005), 39–54 | DOI