XFlow - A Python Library for Graph Flow

Social network analysis code examples for PyCon 2019 talk

Top-K Influential Nodes in Social Networks: A Game Perspective (SIGIR'17)

Source code for blog post at https://hautahi.com/im_greedycelf

Code for Influence Maximization Problem

Algorithms for online influence maximization

This telegram bot manages an instagram engagement group maintaining a current list of active users

Python package for simulating spreading phenomena in complex networks

Temporal IMLinUCB - a solution for Online Influence Maximization problem in Temporal Networks (based on IMLinUCB)

Implementation of Influence Maximisation on a graph dataset.

code in article Identifying influential nodes in social networks: A voting approach, link: https://doi.org/10.1016/j.chaos.2021.111309,

Source code for blog post at https://hautahi.com/im_ris

Influence Maximization in Near-Linear Time: A Martingale Approach Scala implementation

Correlation Robust Influence Maximization

Python GPU Code for IM Algorithms

Influential nodes identification & CELF implementation

Evaluation and improvement of cascade diffusion robustness against node attacks.

Our group capstone project site for UC Berkeley's MIDS W210/Capstone.

NetMax is a python library that provides the implementation of several algorithms for the problem of Influence Maximization in Social Networks. It also addresses the problem of Competitive Influence Maximization as an extensive-form strategic game setting.

An analysis on the cascading behavior between Taiwanese Instagram food bloggers, based on Asynchronous Independent Cascade Model (AsIC) and Influence Maximization Model.