collective_influence_influential: Returns the most influential nodes in a graph using...

In seekme94/influence.mining: Provides various methods for influence mining on Graphs

Returns the most influential nodes in a graph using Collective influence heuristic

Description

Returns the most influential nodes in a graph using Collective influence heuristic

Usage

collective_influence_influential(
  graph,
  budget = 1,
  test_method = c("RESILIENCE", "INFLUENCE_LT", "INFLUENCE_IC")
)

Arguments

graph	is the igraph object
budget	number of influential nodes to be fetched. Default value is 1
test_method	specifies the method to measure influence. Value MUST be "RESILIENCE", "INFLUENCE_IC" or "INFLUENCE_LT"

Value

object containing: 1. Vector of influential nodes. 2. Measure of influence. 3. Elapsed time in seconds.

References

Morone, F., & Makse, H. a. (2015). Influence maximization in complex networks through optimal percolation: supplementary information. Current Science, 93(1), 17–19.

seekme94/influence.mining documentation built on Aug. 2, 2022, 10:19 p.m.