[igraph] Key player problem (KPP)

[Bob Pap]

Dear all,

I am looking into the problem of identifying key player in a network, as suggested by Borgatti (2006), Identifying sets of key players in a social network,”Computational Mathematical
Organization Theory, 12(1), 21–34.

I have only found reference to 2 libraries that are either discontinued and not available (http://radar.det.unifi.it/~parlanti/netpackage_api/public/netpackage.simulations.findKeyPlayers-module.html) or in a Java library that sounds challenging to implement (https://bitbucket.org/sorend/jgrapht-sna/src).

Would anybody have reference to the first or another implementation in igraph/python/R?

Alternatively, having a network function whose value is to be minimised (such as the fragmentation referred to by Borgatti), would you know of an algorithm to run over all possible networks created by substracting nodes in groups? For 1 is relatively straight forward, but for groups of 1, 2, ..., n probably there may be an existing implementation.

Many thanks in advance for any help.

--

Kindly,

Bob Pap