go-v.orgdoi

Influence Maximization in Social Signed Multi-Networks

Antonios Tsakonas, Ioannis E. Antoniou, Stavros G. Stavrinides · Mathematics · 2026

  • DOI 10.3390/math14101702
  • Publisher Multidisciplinary Digital Publishing Institute
  • Type article
  • Issued 2026

Not cached yet. This record was fetched live for this request and is stored after the lookup. Reopening the page should serve the cached copy.

Mathematics · Multidisciplinary Digital Publishing Institute · article · 2026

Abstract

The Influence Maximization Problem addresses the challenge of selecting a set of spreaders with the aim of maximizing the spread influence on the network. In this work we propose a novel influence spreading model formulated for Social Signed Multi-Networks. We combine the assumption that only infected nodes express their opinion with the bounded confidence assumption. We solve the Influence Maximization Problem under this model by proposing a novel proxy-based Greedy method. We validate the effectiveness of our method through simulations on multi-networks constructed from two real online social signed networks, Epinions and Slashdot, and compare it against several baseline methods.

The simulation results demonstrate that our proposed method consistently outperforms all other baselines in each case tested.

Open the resolved locator · 10.3390/math14101702

Metadata licence: OpenAlex metadata (CC0)

Registry
OpenAlex DOI index + API
Fetched
2026-11-19 21:19 UTC
Cache state
not cached yet (bulk-index+openalex)
Locator
https://doi.org/10.3390/math14101702
Metadata licence
OpenAlex metadata (CC0)
Scope
Metadata as returned by the resolver; abstracts are never generated here.