复杂网络中平衡速度和覆盖率的序贯种子算法
Balancing Speed and Coverage by Sequential Seeding in Complex Networks
摘要：
复杂网络中的信息传播通常被建模为以一定的概率将信息从拥有它的节点扩散到不拥有它的邻居。当一组初始节点（种子）的激活导致扩散到大量节点时，就会触发信息级联。在这里，介绍了几种新的种子启动方法，取代常用的激活所有种子一次启动阶段的序列。后续阶段的顺序策略避免播种已经被阶段之间的扩散激活的高排名节点。当保存的种子被分配给难以通过扩散到达的节点时，增益出现。顺序播种和单阶段的方法进行了比较，使用不同的种子排序方法和实际复杂网络的扩散参数。实验结果表明，无论使用的种子排序方法，顺序播种策略提供更好的覆盖率比单阶段播种在约90%的情况下。较长的播种序列往往会激活更多的节点，但它们也会延长扩散的持续时间。顺序播种的各种变体以不同的方式解决了覆盖范围和扩散速度之间的权衡。
英文摘要：
Information spreading in complex networks is often modeled as diffusing information with certain probability from nodes that possess it to their neighbors that do not. Information cascades are triggered when the activation of a set of initial nodes (seeds) results in diffusion to large number of nodes. Here, several novel approaches for seed initiation that replace the commonly used activation of all seeds at once with a sequence of initiation stages are introduced. Sequential strategies at later stages avoid seeding highly ranked nodes that are already activated by diffusion active between stages. The gain arises when a saved seed is allocated to a node difficult to reach via diffusion. Sequential seeding and a single stage approach are compared using various seed ranking methods and diffusion parameters on real complex networks. The experimental results indicate that, regardless of the seed ranking method used, sequential seeding strategies deliver better coverage than single stage seeding in about 90% of cases. Longer seeding sequences tend to activate more nodes but they also extend the duration of diffusion. Various variants of sequential seeding resolve the trade-off between the coverage and speed of diffusion differently.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
