扩散
价值(数学)
计算机科学
统计
数学
物理
热力学
作者
Mohammad Akbarpour,Suraj Malladi,Amin Saberi
摘要
Identifying the optimal set of individuals to first receive information (“seeds”) in a social network to maximize expected diffusion is a widely studied question in many settings. Several studies propose network-centrality-based heuristics to select seeds likely to increase diffusion. Here, we show that, for the classic independent cascade model of diffusion, either seeding a few more individuals at random can prompt a larger diffusion than optimal seeding or optimal seeding itself results in limited spread. These findings hold across a broad range of random networks and are supported by simulations on real-world networks. (JEL D83, D85, O12, O18, P25, P32, Z13)
科研通智能强力驱动
Strongly Powered by AbleSci AI