atlas

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

Maximizing Influence in an Ising Network: A Mean-Field Optimal Solution

NeurIPS 2016 · Learning theory and algorithms › Submodular and game algorithms · approach: Submodular influence maximization · 16 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (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
Shift in MF-optimal field from high-degree to low-degree nodes as interaction strength increasesMF-IIM on hub-and-spoke network · hub-and-spoke network, H=1average degree of optimal field nodesHelped
MF optimal external field versus exact optimal fieldMF-IIM on hub-and-spoke network · hub-and-spoke network, H=1ratio of MF to exact magnetizationMixed
MF optimal field versus degree-proportional, centrality-proportional, and random heuristics at beta_cMF-IIM on stochastic block network · stochastic block network, 100 nodes, H=20magnetization (Monte Carlo)Helped
MF optimal field versus node-selection heuristics at beta_cMF-IIM on arXiv collaboration network · collaboration network, 904 nodes, H=40magnetizationHelped
Shift in MF-optimal field from high- to low-degree nodes near beta_c=0.05MF-IIM on arXiv collaboration network · collaboration network, 904 nodes, H=40node degree of selected nodesHelped

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