Controllability of Network Opinion in Erdös--Rényi Graphs Using Sparse Control Inputs

DOI10.1137/20M1327860zbMath1468.91115arXiv2003.12817OpenAlexW3173955505MaRDI QIDQ5000624

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

Publication date: 15 July 2021

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

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

zbMATH Keywords

concentration inequalitiesErdős-Rényi graphlinear propagationsocial network opinionsparse controllability

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bounded confidence opinion dynamics with opinion leaders and environmental noises
• A mathematical introduction to compressive sensing
• Invertibility of sparse non-Hermitian matrices
• On the control of opinion dynamics in social networks
• Sparse random matrices have simple spectrum
• Opinion dynamics in social networks with stubborn agents: equilibrium and convergence rate
• The Littlewood-Offord problem and invertibility of random matrices
• Controllability, Identification, and Randomness in Distributed Systems
• Vulnerability of Network Synchronization Processes: A Minimum Energy Perspective
• Smallest singular value of a random rectangular matrix
• The Evolution of Random Graphs
• Reaching a Consensus
• How Homophily Affects the Speed of Learning and Best-Response Dynamics
• Linear Algebra and Matrices
• Controllability of Multi-Agent Systems from a Graph-Theoretic Perspective
• Controllability Metrics, Limitations and Algorithms for Complex Networks
• Invertibility of symmetric random matrices
• Controllability of Linear Dynamical Systems Under Input Sparsity Constraints

This page was built for publication: Controllability of Network Opinion in Erdös--Rényi Graphs Using Sparse Control Inputs