AI Paper Atlas

Research map / Learning theory and algorithms / Submodular and game algorithms

Scalable Influence Maximization for Multiple Products in Continuous-Time Diffusion Networks

Nan Du, Yingyu Liang, Maria-Florina Balcan, Manuel Gomez-Rodriguez, Hongyuan Zha, Le Song

JMLR 2017 · Learning theory and algorithms › Submodular and game algorithms · approach: Submodular influence maximization · 38 citations (OpenAlex)

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
increase number of random samples and random labels in ConTinEst (ablation)ConTinEst · Kronecker networks, Weibullrelative error: relative error smaller than 0.01 for 10,000 random samples with 5 random labelsImproved
use BudgetMax instead of degree-based GreedyDegree heuristicproduct allocation · 64 product networks, 1,048,576 nodes eachestimated influenceImproved
raise budget per user for fixed budget per product (ablation)BudgetMax · 64 products, product budget 8estimated influenceNo clear effect

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy