📣 2D Influence Maximization: Independent Cascade, Greedy Seed Selection, Lazy CELF and the 1 - 1/e Bound
Plan view of a preferential-attachment social network: seed beacons, cascade waves, greedy versus degree versus random spread curves and diminishing marginal gains, with five independent numerical checks (exact enumeration, Monte Carlo, submodularity, 1 - 1/e bound, CELF equivalence).
⚙ Under the hood
Plan view of a preferential-attachment social network: seed beacons, cascade waves, greedy versus degree versus random spread curves and diminishing marginal gains, with five independent numerical checks (exact enumeration, Monte Carlo, submodularity, 1 - 1/e bound, CELF equivalence).
Influence MaximizationIndependent CascadeSubmodularityGreedy AlgorithmCELFLive-Edge ModelSocial NetworksNetwork Science
2D · HTML5 Canvas 2D · 60 FPS target · runs fully client-side, no install