Absolute centrality in a signed Friedkin-Johnsen based model: a graphical characterisation of influence
This paper studies the evolution of opinions governed by a Friedkin Johnsen (FJ) based model in arbitrary network structures with signed interactions. The agents contributing to the opinion formation are characterised as being influential. Initially, the agents are classified as opinion leaders and followers based on network connectivity and the nature of interactions. However, the addition of stubbornness leads to interesting behaviours wherein a non influential agent can now become influential and vice versa. Thereafter, a signal flow graph (SFG) based method is proposed to quantify the influence of an influential agents' opinions. Additionally, it helps illustrate the role played by network topology in shaping the final opinions of the agents. Based on this analysis, the absolute centrality measure is proposed to determine the overall influence of all the agents in the network. Unlike most of the existing measures, it is applicable to any network structure and considers the effect of stubbornness and antagonism. Examples are presented throughout the paper to illustrate and validate these results.
Code (0)
등록된 구현이 없습니다.
Methods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Towards influence centrality: where to not add an edge in the network?
In this work, we consider a strongly connected group of individuals involved in decision-making. The opinions of the individuals evolve using the Friedkin-Johnsen (FJ) model. We consider that there are two competing `inf…
Decision MakingFriedkin-Johnsen Model with Diminishing Competition
This letter studies the Friedkin-Johnsen (FJ) model with diminishing competition, or stubbornness. The original FJ model assumes that each agent assigns a constant competition weight to its initial opinion. In contrast, …
modelOn final opinions of the Friedkin-Johnsen model over random graphs with partially stubborn community
This paper studies the formation of final opinions for the Friedkin-Johnsen (FJ) model with a community of partially stubborn agents. The underlying network of the FJ model is symmetric and generated from a random graph …
FJ-MM: The Friedkin-Johnsen Opinion Dynamics Model with Memory and Higher-Order Neighbors
The Friedkin-Johnsen (FJ) model has been extensively explored and validated, spanning applications in social science, systems and control, game theory, and algorithmic research. In this paper, we introduce an advanced ge…
Sublinear-Time Algorithms for Diagonally Dominant Systems and Applications to the Friedkin-Johnsen Model
We study sublinear-time algorithms for solving linear systems $Sz = b$, where $S$ is a diagonally dominant matrix, i.e., $|S_{ii}| \geq δ+ \sum_{j \ne i} |S_{ij}|$ for all $i \in [n]$, for some $δ\geq 0$. We present rand…