Computes group centrality scores and identifies the most central group of players in a network.
|Author||Weihua An; Yu-Hsin Liu|
|Date of publication||2016-04-16 10:33:52|
|Maintainer||Yu-Hsin Liu <email@example.com>|
contract: Group the Chosen Players in a Network
delta.score: The change on objective function for greedy search...
diffusion: Compute the Diffusion Centrality Score in a Network
fragment: Compute the Fragmentation Centrality Score in a Netwrok
Friends: The friendship network of 21 managers in a high-tech company
group.mreach.closeness: Compute the Group-level mreach.closeness Centrality Score in...
group.mreach.degree: Compute the group-level mreach.degree Centrality Score in a...
kpcent: Compute Group Centraltiy in a Network
kpnode: Return the most central player in sequentially reduced...
kpset: Selecting the Most Central Group of Players in a Network
mreach.closeness: Compute the M-reach Closeness Centrality Score in a Netwrok
mreach.degree: Compute the M-reach Degree Centrality Score in a Netwrok
topnode: Orders players by individual centrality from high to low
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.