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 influencers' (stubborn agents) vying for control over the final opinion of the group. We investigate the impact of modifying the network interactions on their respective control over the final opinions (influence centrality). We use signal flow graphs (SFG) to relate the network interactions with the influence that each influencer' exerts on others. We present the sufficient conditions on the edge modifications which lead to the increase of the influence of an `influencer' at the expense of the other. Interestingly, the analysis also reveals the existence of redundant edge modifications that result in no change in the influence centrality of the network. We present several numerical examples to illustrate these results.
Code (0)
등록된 구현이 없습니다.
Tasks
Decision MakingSimilar Papers 제목 키워드 기반
Complex Network Influence Evaluation based on extension of Grueblers Equation
It is greatly significant in evaluating nodes Influence ranking in complex networks. Over the years, many researchers present different measures for quantifying node interconnectedness within networks. Therefore, this pa…
Fast Geometric Embedding for Node Influence Maximization
Computing classical centrality measures such as betweenness and closeness is computationally expensive on large-scale graphs. In this work, we introduce an efficient force layout algorithm that embeds a graph into a low-…
Identifying Influential Nodes in Two-mode Data Networks using Formal Concept Analysis
Identifying important actors (or nodes) in a two-mode network often remains a crucial challenge in mining, analyzing, and interpreting real-world networks. While traditional bipartite centrality indices are often used to…
Improving Power Systems Controllability via Edge Centrality Measures
Improving the controllability of power networks is crucial as they are highly complex networks operating in synchrony; even minor perturbations can cause desynchronization and instability. To that end, one needs to asses…
LayerPlexRank: Exploring Node Centrality and Layer Influence through Algebraic Connectivity in Multiplex Networks
As the calculation of centrality in complex networks becomes increasingly vital across technological, biological, and social systems, precise and scalable ranking methods are essential for understanding these networks. T…