Controllability of network opinion in Erdös-Rényi graphs using sparse control inputs
From MaRDI portal
Publication:5000624
Abstract: This paper considers a social network modeled as an Erdos Renyi random graph. Each individual in the network updates her opinion using the weighted average of the opinions of her neighbors. We explore how an external manipulative agent can drive the opinions of these individuals to a desired state with a limited additive influence on their innate opinions. We show that the manipulative agent can steer the network opinion to any arbitrary value in finite time (i.e., the system is controllable) almost surely when there is no restriction on her influence. However, when the control input is sparsity constrained, the network opinion is controllable with some probability. We lower bound this probability using the concentration properties of random vectors based on the Levy concentration function and small ball probabilities. Further, through numerical simulations, we compare the probability of controllability in Erdos Renyi graphs with that of power-law graphs to illustrate the key differences between the two models in terms of controllability. Our theoretical and numerical results shed light on how controllability of the network opinion depends on the parameters such as the size and the connectivity of the network, and the sparsity constraints faced by the manipulative agent.
Recommendations
- On the control of opinion dynamics in social networks
- Opinion dynamics control in a social network with a communication structure
- Models of opinion control for agents in social networks
- Informational influence and informational control models in social networks
- A dynamic game formulation for control of opinion dynamics over social networks
Cites work
- scientific article; zbMATH DE number 3150484 (Why is no real title available?)
- scientific article; zbMATH DE number 3711820 (Why is no real title available?)
- scientific article; zbMATH DE number 3337198 (Why is no real title available?)
- A mathematical introduction to compressive sensing
- Bounded confidence opinion dynamics with opinion leaders and environmental noises
- Controllability Metrics, Limitations and Algorithms for Complex Networks
- Controllability of Linear Dynamical Systems Under Input Sparsity Constraints
- Controllability of multi-agent systems from a graph-theoretic perspective
- Controllability, identification, and randomness in distributed systems
- How homophily affects the speed of learning and best-response dynamics
- Invertibility of sparse non-Hermitian matrices
- Invertibility of symmetric random matrices
- Linear Algebra and Matrices
- On the control of opinion dynamics in social networks
- Opinion dynamics in social networks with stubborn agents: equilibrium and convergence rate
- Random graphs.
- Reaching a Consensus
- Smallest singular value of a random rectangular matrix
- Social and economic networks.
- Sparse random matrices have simple spectrum
- The Evolution of Random Graphs
- The Littlewood-Offord problem and invertibility of random matrices
- Vulnerability of Network Synchronization Processes: A Minimum Energy Perspective
Cited in
(3)
This page was built for publication: Controllability of network opinion in Erdös-Rényi graphs using sparse control inputs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5000624)
