Skip to main content
CenXiv.org
This website is in trial operation, support us!
We gratefully acknowledge support from all contributors.
Contribute
Donate
cenxiv logo > cs > arXiv:2509.07625

Help | Advanced Search

Computer Science > Social and Information Networks

arXiv:2509.07625 (cs)
[Submitted on 9 Sep 2025 ]

Title: Influence Maximization Considering Influence, Cost and Time

Title: 考虑影响、成本和时间的影响最大化

Authors:Mingyang Feng, Qi Zhao, Shan He, Yuhui Shi
Abstract: Influence maximization has been studied for social network analysis, such as viral marketing (advertising), rumor prevention, and opinion leader identification. However, most studies neglect the interplay between influence spread, cost efficiency, and temporal urgency. In practical scenarios such as viral marketing and information campaigns, jointly optimizing Influence, Cost, and Time is essential, yet remaining largely unaddressed in current literature. To bridge the gap, this paper proposes a new multi-objective influence maximization problem that simultaneously optimizes influence, cost, and time. We show the intuitive and empirical evidence to prove the feasibility and necessity of this multi-objective problem. We also develop an evolutionary variable-length search algorithm that can effectively search for optimal node combinations. The proposed EVEA algorithm outperforms all baselines, achieving up to 19.3% higher hypervolume and 25 to 40% faster convergence across four real-world networks, while maintaining a diverse and balanced Pareto front among influence, cost, and time objectives.
Abstract: 影响最大化已被用于社交网络分析,例如病毒式营销(广告)、谣言预防和意见领袖识别。 然而,大多数研究忽视了影响扩散、成本效率和时间紧迫性之间的相互作用。 在病毒式营销和信息活动等实际场景中,联合优化影响、成本和时间是至关重要的,但在当前文献中仍基本未被解决。 为弥补这一差距,本文提出了一种新的多目标影响最大化问题,该问题同时优化影响、成本和时间。 我们展示了直观和实证证据,以证明这一多目标问题的可行性和必要性。 我们还开发了一种进化可变长度搜索算法,可以有效搜索最优节点组合。 所提出的EVEA算法优于所有基线,在四个现实世界的网络中,其超体积提高了高达19.3%,收敛速度提高了25%到40%,同时在影响、成本和时间目标之间保持了多样且平衡的帕累托前沿。
Subjects: Social and Information Networks (cs.SI) ; Networking and Internet Architecture (cs.NI)
Cite as: arXiv:2509.07625 [cs.SI]
  (or arXiv:2509.07625v1 [cs.SI] for this version)
  https://doi.org/10.48550/arXiv.2509.07625
arXiv-issued DOI via DataCite

Submission history

From: Mingyang Feng [view email]
[v1] Tue, 9 Sep 2025 11:52:51 UTC (1,019 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • HTML (experimental)
  • TeX Source
  • Other Formats
license icon view license
Current browse context:
cs.SI
< prev   |   next >
new | recent | 2025-09
Change to browse by:
cs
cs.NI

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
a export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender (What is IArxiv?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack

京ICP备2025123034号