voterank_pp: VoteRank++

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

VoteRank++

Description

VoteRank++ algorithm for identifying a set of influential spreaders in complex networks.

Usage

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

Arguments

g	Graph object.
r	Number of spreaders.
lambda	Suppressing factor, where is from interval [0, 1]
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

Panfeng Liu, Longjie Li, Shiyu Fang, Yukai Yao: Identifying influential nodes in social networks: A voting approach, Chaos, Solitons & Fractals 152. 2021. https://doi.org/10.1016/j.chaos.2021.111309 (https://www.sciencedirect.com/science/article/pii/S0960077921006639)

Examples

library(igraphdata)

data(karate)
voterank_pp(karate, 2, 0.8)

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