Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2211.17159

Opinion Evolution among friends and foes: the deterministic Majority Rule - extended abstract

Miriam Di Ianni
View original source ↗Read source document ↗Export metadata ↓

Abstract

The influence of the social relationships of an individual on the individual's opinions (about a topic, a product, or whatever else) is a well known phenomenon and it has been widely studied. This paper considers a network of positive (i.e. trusting) or negative (distrusting) social relationships where every individual has an initial positive or negative opinion (about a topic, a product, or whatever else) that changes over time, at discrete time-steps, due to the influences each individual gets from its neighbors. Here, the influence of a trusted neighbor is consistent with the neighbor's opinion, while the influence of an untrusted neighbor is opposite to the neighbor's opinion. This extended abstract introduces the local threshold-based opinion dynamics and, after stating the computational complexity of some natural reachability problems arising in this setting when individuals change their opinions according to the opinions of the majority of their neighbors, proves an upper bound on the number of opinion configurations met by a symmetric positive-only relationships network evolving according to any of such models, which is polynomial in the size of the network. This generalizes a result in [Krishnendu Chatterjee, Rasmus Ibsen-Jensen, Isma\"el Jecker, and Jakub Svoboda, "Simplified Game of Life: Algorithms and Complexity", 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)]

Explore related subjects

cs.CCcs.SI

Keep this discovery

BibTeXRIS

Miriam Di Ianni. 2022-11-30. Opinion Evolution among friends and foes: the deterministic Majority Rule - extended abstract. https://arxiv.org/abs/2211.17159

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

The Computational Complexity of Holant Problems on 4-regular Graphs from the Stable Subgroup Sequence of $SL(2,\mathbb{C})$

The Holant framework provides a general setting for studying counting problems and includes graph homomorphisms (\#GH) and counting constraint satisfaction problems (\#CSP) as special cases. Over the past twenty years, a series of computational complexity dichotomies have been established for Holant problems, but the classification for complex-valued signatures is still open. The main obstacle is the case in which all signatures have even arity. In this paper, we establish a dichotomy for Holant problems with a complex-valued 4-ary signature, which is a key base case for the full classification of Holant problems. We present a new strategy by introducing Schur's theorem, the classification of finite subgroups of $\mathrm{SL}(2,\mathbb{C})$ and stable subgroup sequences into the proof. These new techniques are of independent interest.

cs.CC↗
arXiv2026

Topology inside NC$^1$

We show that ACC$^0$ is precisely what can be computed with constant-width circuits of polynomial size and polylogarithmic genus. This extends a characterization given by Hansen, showing that planar constant-width circuits also characterize ACC$^0$. Thus polylogarithmic genus provides no additional computational power in this model. We consider other generalizations of planarity, including crossing number and thickness. We show that constant-width circuits of polynomial size and thickness two already suffice to capture all of NC$^1$.

cs.CC↗