Difference between revisions of "Wikipedia Mining of Hidden Links Between Political Leaders"
(Links) |
(Infobox work) |
||
| Line 1: | Line 1: | ||
| + | {{Infobox work | ||
| + | | title = Wikipedia Mining of Hidden Links Between Political Leaders | ||
| + | | date = 2016 | ||
| + | | authors = [[Klaus M. Frahm]]<br />[[Katia Jaffrès-Runser]]<br />[[Dima L. Shepelyansky]] | ||
| + | | doi = 10.1140/epjb/e2016-70526-3 | ||
| + | | link = https://link.springer.com/article/10.1140%2Fepjb%2Fe2016-70526-3 | ||
| + | | plink = https://www.arxiv.org/abs/1609.01948 | ||
| + | }} | ||
'''Wikipedia Mining of Hidden Links Between Political Leaders''' - scientific work related to [[Wikipedia quality]] published in 2016, written by [[Klaus M. Frahm]], [[Katia Jaffrès-Runser]] and [[Dima L. Shepelyansky]]. | '''Wikipedia Mining of Hidden Links Between Political Leaders''' - scientific work related to [[Wikipedia quality]] published in 2016, written by [[Klaus M. Frahm]], [[Katia Jaffrès-Runser]] and [[Dima L. Shepelyansky]]. | ||
== Overview == | == Overview == | ||
Abstract Authors describe a new method of reduced [[Google]] matrix which allows to establish direct and hidden links between a subset of nodes of a large directed network. This approach uses parallels with quantum scattering theory, developed for processes in nuclear and mesoscopic physics and quantum chaos. The method is applied to the [[Wikipedia]] networks in [[different language]] editions analyzing several groups of political leaders of USA, UK, Germany, France, Russia and G20. Authors demonstrate that this approach allows to recover reliably direct and hidden links among political leaders. Authors argue that the reduced Google matrix method can form the mathematical basis for studies in social and political sciences analyzing Leader-Members eXchange (LMX). | Abstract Authors describe a new method of reduced [[Google]] matrix which allows to establish direct and hidden links between a subset of nodes of a large directed network. This approach uses parallels with quantum scattering theory, developed for processes in nuclear and mesoscopic physics and quantum chaos. The method is applied to the [[Wikipedia]] networks in [[different language]] editions analyzing several groups of political leaders of USA, UK, Germany, France, Russia and G20. Authors demonstrate that this approach allows to recover reliably direct and hidden links among political leaders. Authors argue that the reduced Google matrix method can form the mathematical basis for studies in social and political sciences analyzing Leader-Members eXchange (LMX). | ||
Revision as of 10:59, 19 December 2019
Authors | Klaus M. Frahm Katia Jaffrès-Runser Dima L. Shepelyansky |
|---|---|
Publication date | 2016 |
DOI | 10.1140/epjb/e2016-70526-3 |
Links | Original Preprint |
Wikipedia Mining of Hidden Links Between Political Leaders - scientific work related to Wikipedia quality published in 2016, written by Klaus M. Frahm, Katia Jaffrès-Runser and Dima L. Shepelyansky.
Overview
Abstract Authors describe a new method of reduced Google matrix which allows to establish direct and hidden links between a subset of nodes of a large directed network. This approach uses parallels with quantum scattering theory, developed for processes in nuclear and mesoscopic physics and quantum chaos. The method is applied to the Wikipedia networks in different language editions analyzing several groups of political leaders of USA, UK, Germany, France, Russia and G20. Authors demonstrate that this approach allows to recover reliably direct and hidden links among political leaders. Authors argue that the reduced Google matrix method can form the mathematical basis for studies in social and political sciences analyzing Leader-Members eXchange (LMX).
