
handle: 2108/438544
Among the many (mostly randomized) models proposed in the last decades to study how opinions of a set of individuals interconnected by pairwise relations evolve, a novel deterministic model is introduced in this paper that is able to encompass individual choices, strength and sign of relations, and asynchronism. In particular, asynchronism has been considered until now only in randomized settings. It is here studied in which cases the behavior of the resulting dynamical network is predictable, that is, in which cases the number of opinion configurations encountered by the set of individuals before the dynamical network enters a loop is polynomially bounded by the network size.
social networks, computational complexity, graph theory, QA1-939, diffusion processes, network analysis, Mathematics
social networks, computational complexity, graph theory, QA1-939, diffusion processes, network analysis, Mathematics
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 1 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
