01Simulates information diffusion using the Independent Cascade model on network graphs.
02Identifies optimal seed nodes using various centrality measures (Betweenness, Degree, Katz, K-Geodesic, Farness) and Greedy Hill Climbing algorithm.
03Analyzes the impact of seed node selection and activation probabilities on network reach.
04Integrates network data mining results with Claude via Model Context Protocol (MCP) connectors.
05Enables natural language querying of network diffusion statistics and behaviors through an LLM.
060 GitHub stars