wvoterank: WVoteRank

In viliamzigo/voterank: VoteRank algorithm for identifying a set of influential spreaders in complex networks.

WVoteRank

Description

A voting approach to uncover multiple influential spreaders on weighted networks

Usage

wvoterank(
  g,
  r,
  display = F,
  display_layout = layout_nicely(g),
  display_label = T
)

Arguments

g	Weighted graph object.
r	Number of spreaders.
display	Whether to display graph, default FALSE.
display_layout	Custom layout of graph, dafault layout_nicely.
display_label	Whether to display vertex.label, default TRUE.

Value

Vector of r vertices identified as spreaders.

References

Csardi G, Nepusz T: The igraph software package for complex network research, InterJournal, Complex Systems 1695. 2006. https://igraph.org

Hong-liang, S. et al.: A voting approach to uncover multiple influential spreaders on weighted networks. Physica A: Statistical Mechanics and its Applications Volume 519, 2019, Pages 303-312. https://doi.org/10.1016/j.physa.2018.12.001

Examples

library(igraphdata)

data(karate)
wvoterank(karate, 2, weight = E(karate)$weight)

viliamzigo/voterank documentation built on May 5, 2022, 9:54 a.m.