Identifying Influential Individuals on Large-Scale Social Networks
-
Updated
May 9, 2020 - C++
Identifying Influential Individuals on Large-Scale Social Networks
Influence Maximization for Partially Observable Networks with Varying Degree Assortativities
Experimental repo for paper: https://doi.org/10.26599/BDMA.2024.9020010
A visualisation tool to assess the spread of influence.
A repository to supplement the paper "Modeling the Spread of Infectious Diseases through Influence Maximization".
Solving the influence maximization problem with independent cascade diffusion model.
Experimental repo for paper: 10.1109/DSAA54385.2022.10032425
An efficient and effective GRASP algorithm for the Budget Influence Maximization Problem
Fast and accurate influence maximization on large networks with pruned monte-carlo simulations
Influence Maximization in Go (CELF, TIM, MaxDiscount, DegreeDiscount, PMC)
Code for simulations concerning single player Ising Influence Maximisation as well as competitive optimisation structured as a simultaneous or a sequential game.
Course project for CPSC534: Topics in Data Science & Management: Social Networks at UBC 2017
Influence Maximization on a graph (social network)
Implementation of Complex Networks Algorithms
Repository of the paper "Precise influence evaluation in complex networks" by B. Zhu, D. Li and Q. Sun
Social Network Analysis
Unofficial Python Implementation of "Maximizing the Spread of Influence through a Social Network"
In this repo. , "Cost Effective Lazy Forward Selection" Algorithm is implemented from scratch in python with only numpy library.
Add a description, image, and links to the influence-maximization topic page so that developers can more easily learn about it.
To associate your repository with the influence-maximization topic, visit your repo's landing page and select "manage topics."