- Library
- Systems & Complexity
- Network Theory
- Centrality & Influence
- Centrality for Targeting Interventions
Mental model
Centrality for Targeting Interventions
Use network position to suggest starting people, then assess their likely spread under explicit assumptions.
Discover
In a hypothetical network, everyone adopts a shared tool and forwards it along each arrow on the map. You can start with one person. Whose stated reach is greatest?
Choose a starting person for a hypothetical network
Learn to compare starting people using explicit spreading assumptions.
Understand
Understand
A network is a map of people and their connections. Centrality uses positions on that map to suggest whom to approach first. The best starting group also depends on how influence spreads and whether its members reach the same people. Sketch three contacts and mark whom each could influence.
Full explanation
Full explanation
Centrality heuristics are rules of thumb that select people using their positions in a network. The paper compares targeting people with high degrees or small average distances to other people against an influence-maximization method. Those structural rankings are useful candidate shortcuts, but they are not the same as finding the starting group with the greatest expected spread. [1]
Influence maximization has a different, explicit objective: choose a fixed number of starting adopters to maximize the expected final number of adopters. Expected means averaged across the possible outcomes of a specified spreading process. This evaluates the starting group together, rather than assuming that a collection of individually prominent people is best. [1]
The paper evaluates specified mathematical models for how adoption spreads through connections. A model sets assumptions about the spreading process; a result under those assumptions is not a prediction that every real person will behave that way. The authors prove approximation guarantees for several classes of models. That scope matters when applying a model-based targeting method to a practical intervention. [1]
For a clearly hypothetical example, imagine a tool spreading between three villages along arrows on a map. Assume every recipient adopts and forwards it along every outgoing arrow. The Mayor can reach only Village A, the Doctor only Village B, and the Trader everyone in all three villages. Starting with the Trader reaches everyone under these assumptions. If forwarding becomes uncertain or the arrows change, that conclusion needs reassessment; being a bridge alone does not establish the best choice.
The paper's greedy method builds a starting group one person at a time, each time choosing the person who adds the greatest expected spread beyond the people already selected. This accounts for overlapping reach. The paper proves performance bounds for specified models and reports computational experiments, but neither provides a guarantee of success in a real intervention. As practical guidance, compare candidate groups under plausible spreading assumptions before committing limited resources. [1]
Research
Research
- Theory and objective: Kempe, Kleinberg and Tardos define influence maximization as choosing a fixed number of initial adopters to maximize the expected final number of adopters under a specified diffusion model. They show that finding an exact optimum is NP-hard, a classification of computational difficulty; this does not mean that useful approximate solutions are impossible. [1]
- Theory and guarantee: Using an analysis framework based on submodular functions, the paper shows that a natural greedy strategy obtains a solution provably within about 63% of the optimum for several classes of diffusion models. This is a model-specific approximation result, not a guarantee for every spreading process or real campaign. [1]
- Computational evidence: The paper reports experiments using diffusion models on large collaboration networks in which its approximation algorithms outperform degree and distance centrality heuristics. These are results from modeled diffusion on network data, not observed effects of interventions on people's adoption behavior. The supplied excerpt reports no comparison with betweenness centrality. [1]
Limitations
Limitations
The theoretical guarantees concern expected spread under the specified model, budget and influence parameters. They do not promise the same outcome in every simulated run or establish effectiveness in a real campaign. The basic models assume that initial adopters are activated and that adoption persists; actual behavior may not fit those assumptions. Practical guidance derived from this setup is to examine whether the network and spreading rules fit the intended intervention. The village example is a hypothetical illustration, not empirical evidence, and this source does not establish rules for stopping disease or choosing vaccination targets.
Try it
Synthesize
Choose a pattern from the guide, then pick an action to try with it.
Which pattern stands out?
What will you try?
Choose a pattern above to select an action.
Sources
Sources
- [1] Maximizing the Spread of Influence through a Social NetworkDavid Kempe, Jon Kleinberg, and Éva Tardos - 2015
Try it
Check your understanding
In the hypothetical village example, everyone adopts and forwards the tool along every outgoing arrow. With one starting person, who reaches everyone in all three villages?
Show the guide's explanation
Answer: The Trader, who reaches everyone in all three villages
The Trader has the stated reach to everyone, and forwarding always succeeds in this hypothetical example. That answer depends on those assumptions.
What is the influence-maximization objective studied in the paper?
Show the guide's explanation
Answer: Choose a fixed number of starters to maximize the expected final number of adopters
The objective concerns the whole starting group's expected final spread under a specified diffusion model. A centrality ranking is a selection shortcut, not that objective.
After selecting the first starting adopter, how does the paper's greedy method choose the next person?
Show the guide's explanation
Answer: Choose the person with the greatest additional expected spread given those already selected
The method reassesses the added benefit of each candidate after earlier selections. This accounts for overlap instead of counting the same expected reach repeatedly.
Keep exploring
Find another idea for the decision in front of you.
The complete Reframo library is free to read. Explore another guide whenever you are ready.