---
res:
  bibo_abstract:
  - We introduce a model of information dissemination in signed networks. It is a
    discrete-time process in which uninformed actors incrementally receive information
    from their informed neighbors or from the outside. Our goal is to minimize the
    number of confused actors — that is, the number of actors who receive contradictory
    information. We prove upper bounds for the number of confused actors in signed
    networks and in equivalence classes of signed networks. In particular, we show
    that there are signed networks where, for any information placement strategy,
    almost 60% of the actors are confused. Furthermore, this is also the case when
    considering the minimum number of confused actors within an equivalence class
    of signed graphs.@eng
  bibo_authorlist:
  - foaf_Person:
      foaf_givenName: Ligang
      foaf_name: Jin, Ligang
      foaf_surname: Jin
  - foaf_Person:
      foaf_givenName: Eckhard
      foaf_name: Steffen, Eckhard
      foaf_surname: Steffen
      foaf_workInfoHomepage: http://www.librecat.org/personId=15548
    orcid: 0000-0002-9808-7401
  bibo_doi: 10.1016/j.dam.2025.04.049
  bibo_volume: 373
  dct_date: 2025^xs_gYear
  dct_isPartOf:
  - http://id.crossref.org/issn/0166-218X
  dct_language: eng
  dct_publisher: Elsevier BV@
  dct_title: Information dissemination and confusion in signed networks@
...