Skip to content

Solving the influence maximization problem with independent cascade diffusion model.

Notifications You must be signed in to change notification settings

castroisabel/influence-maximization-problem

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

10 Commits
 
 
 
 
 
 
 
 

Repository files navigation

influence-maximization-problem

The influence maximization problem (IMP) aims to determine the most influential individuals within a social network under interest. In fact, the problem consist of finding a small subset of nodes (seed nodes) in a graph that could maximize the spread of influence.

In this study, the independent cascade (IC) diffusion model is considered. Regardless of the diffusion model, a node i is called active or influenced if it performs the action of interest or accepts the shared idea. Whenever a node becomes active, it cannot deactivate and remains an active node during the entire broadcast process.

References:
https://www.sciencedirect.com/science/article/abs/pii/S0020025519306504

Releases

No releases published

Packages

No packages published

Languages