XFlow - A Python Library for Graph Flow
-
Updated
Jun 5, 2024 - Python
XFlow - A Python Library for Graph Flow
Temporal IMLinUCB - a solution for Online Influence Maximization problem in Temporal Networks (based on IMLinUCB)
This telegram bot manages an instagram engagement group maintaining a current list of active users
code in article Identifying influential nodes in social networks: A voting approach, link: https://doi.org/10.1016/j.chaos.2021.111309,
An analysis on the cascading behavior between Taiwanese Instagram food bloggers, based on Asynchronous Independent Cascade Model (AsIC) and Influence Maximization Model.
This repository contains a complimentary code for the article "Content-based Network Influence Probabilities: Extraction and Application". The repository contains trained dataset, solvers for the node immunization problem, code for crawling and downloading VK social network, and script for extracting influence probabilities based on the download…
in this repo. greedy hill climbing and lazy hill climbing is implemented from scratch with only numpy and scipy library. this project is tested on the facebook101-Princeton dataset.
Repository of the paper "Precise influence evaluation in complex networks" by B. Zhu, D. Li and Q. Sun
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."