Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
97 tokens/sec
GPT-4o
53 tokens/sec
Gemini 2.5 Pro Pro
44 tokens/sec
o3 Pro
5 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Influence maximization under limited network information: Seeding high-degree neighbors (2202.03893v1)

Published 8 Feb 2022 in physics.soc-ph, cs.SI, and stat.ME

Abstract: The diffusion of information, norms, and practices across a social network can be initiated by compelling a small number of seed individuals to adopt first. Strategies proposed in previous work either assume full network information or large degree of control over what information is collected. However, privacy settings on the Internet and high non-response in surveys often severely limit available connectivity information. Here we propose a seeding strategy for scenarios with limited network information: Only the degrees and connections of some random nodes are known. This new strategy is a modification of "random neighbor sampling" and seeds the highest-degree neighbors of randomly selected nodes. In simulations of a linear threshold model on a range of synthetic and real-world networks, we find that this new strategy outperforms other seeding strategies, including high-degree seeding and clustered seeding.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (4)
  1. Jiamin Ou (3 papers)
  2. Vincent Buskens (1 paper)
  3. Arnout Van De Rijt (5 papers)
  4. Debabrata Panja (24 papers)
Citations (3)

Summary

We haven't generated a summary for this paper yet.