Controllability of network opinion in Erdös-Rényi graphs using sparse control inputs

DOI10.1137/20M1327860zbMATH Open1468.91115arXiv2003.12817OpenAlexW3173955505MaRDI QIDQ5000624FDOQ5000624

Authors: Geethu Joseph, Buddhika Nettasinghe, Vikram Krishnamurthy, Pramod K. Varshney 

Publication date: 15 July 2021

Published in: SIAM Journal on Control and Optimization (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/2003.12817

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

zbMATH Keywords

concentration inequalitieslinear propagationErdős-Rényi graphsocial network opinionsparse controllability

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Social networks; opinion dynamics (91D30) Controllability (93B05)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• A mathematical introduction to compressive sensing
• Random graphs.
• Reaching a Consensus
• Controllability of multi-agent systems from a graph-theoretic perspective
• How homophily affects the speed of learning and best-response dynamics
• Controllability Metrics, Limitations and Algorithms for Complex Networks
• Invertibility of symmetric random matrices
• Social and economic networks.
• The Littlewood-Offord problem and invertibility of random matrices
• Smallest singular value of a random rectangular matrix
• Title not available (Why is that?)
• Invertibility of sparse non-Hermitian matrices
• The Evolution of Random Graphs
• Bounded confidence opinion dynamics with opinion leaders and environmental noises
• On the control of opinion dynamics in social networks
• Linear Algebra and Matrices
• Opinion dynamics in social networks with stubborn agents: equilibrium and convergence rate
• Vulnerability of Network Synchronization Processes: A Minimum Energy Perspective
• Sparse random matrices have simple spectrum
• Controllability, identification, and randomness in distributed systems
• Controllability of Linear Dynamical Systems Under Input Sparsity Constraints

Cited In (3)

• Sufficient control of complex networks
• Further on pinning synchronization of dynamical networks with coupling delay
• On the control of opinion dynamics in social networks

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)