Home▸AI & Machine Learning▸Influence Maximization (2D): Greedy Seed Selection Under the Independent Cascade Model

Influence Maximization (2D): Greedy Seed Selection Under the Independent Cascade Model

A flat, pan-and-zoom 2D rendering of the same Barabasi-Albert social graph and Independent Cascade diffusion: watch the (1-1/e)-approximate greedy algorithm pick seeds by real Monte-Carlo marginal gain, compare it against high-degree and random baselines, and read the diminishing-returns (submodularity) bar chart it produces.

AI & Machine Learning2DAdvanced60 FPS📱 Mobile-adapted⇄ 3D version

Details

CategoryAI & Machine Learning

RenderingCanvas 2D

DifficultyAdvanced

Target FPS60

ControlsSliders for seed-set size k, propagation probability p and cascade wave speed, buttons to switch between Greedy / High-Degree / Random seed-selection strategies, a Compute Seed Set button (fills the marginal-gain strip chart for Greedy), a Simulate Cascade button that animates one Independent Cascade realization wave by wave (switches the strip chart to cumulative activated count), and a Reset Graph button. Drag the graph to pan and scroll/pinch to zoom; hover a node for its degree.

influence maximizationgraph algorithmssocial networksindependent cascadegreedy algorithmviral marketing

Related simulations

Friendship Paradox & Network SuperspreadersA 3D contact network where a handful of high-degree hub nodes disproportionately drive an…

Industrial Symbiosis Network (2D)Interactive 2D eco-industrial park map: byproduct streams (waste heat, CO2, slag, fly ash,…

Non-Maximum Suppression: IoU Matrix & Arc Diagram2D non-maximum suppression simulator: candidate detection boxes become rank-ordered columns… ⊞ All 1161 in AI & Machine Learning →

The flat, pan-and-zoom counterpart to the 3D network view: the same Barabási–Albert graph of 44 accounts, the same Independent Cascade diffusion with Monte-Carlo estimation, and the same provably (1 − 1/e)-approximate greedy algorithm — compared against high-degree and random baselines, with a strip chart underneath making the diminishing-returns shape of submodular marginal gain directly visible.

⚙ Under the hood

The flat, pan-and-zoom 2D rendering of the same Barabasi-Albert social graph and Independent Cascade diffusion: watch a real (1-1/e)-approximate greedy algorithm select seeds by marginal Monte-Carlo gain, compare it against high-degree and random baselines with an animated cascade, and read the diminishing-returns marginal-gain strip chart it produces.

influence maximizationgraph algorithmssocial networksindependent cascadegreedy algorithmviral marketing

2D · HTML5 Canvas 2D · 60 FPS target · runs fully client-side, no install