Belief Control Strategies for Interactions Over Weakly-Connected Graphs
In diffusion social learning over weakly-connected graphs, it has been shown recently that influential agents shape the beliefs of non-influential agents. This paper analyzes this mechanism more closely and addresses two main questions. First, the article examines how much freedom influential agents...
Main Authors: | , , |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2021-01-01
|
Series: | IEEE Open Journal of Signal Processing |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/9432750/ |
id |
doaj-0896c15a067f4611941b7602a446b285 |
---|---|
record_format |
Article |
spelling |
doaj-0896c15a067f4611941b7602a446b2852021-06-14T23:01:32ZengIEEEIEEE Open Journal of Signal Processing2644-13222021-01-01226527910.1109/OJSP.2021.30810269432750Belief Control Strategies for Interactions Over Weakly-Connected GraphsHawraa Salami0https://orcid.org/0000-0002-7299-4054Bicheng Ying1https://orcid.org/0000-0002-5246-2982Ali H. Sayed2https://orcid.org/0000-0002-5125-5519Department of Electrical Engineering, University of California, Los Angeles, CA, USADepartment of Electrical Engineering, University of California, Los Angeles, CA, USAÉcole Polytechnique Fédérale de Lausanne, EPFL, School of Engineering, Lausanne, SwitzerlandIn diffusion social learning over weakly-connected graphs, it has been shown recently that influential agents shape the beliefs of non-influential agents. This paper analyzes this mechanism more closely and addresses two main questions. First, the article examines how much freedom influential agents have in controlling the beliefs of the receiving agents, namely, whether receiving agents can be driven to arbitrary beliefs and whether the network structure limits the scope of control by the influential agents. Second, even if there is a limit to what influential agents can accomplish, this article develops mechanisms by which they can lead receiving agents to adopt certain beliefs. These questions raise interesting possibilities about belief control over networked agents. Once addressed, one ends up with design procedures that allow influential agents to drive other agents to endorse particular beliefs regardless of their local observations or convictions. The theoretical findings are illustrated by means of examples.https://ieeexplore.ieee.org/document/9432750/Social networksdiffusion learninginfluential agentsleader-follower relationbelief controlweak graph |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Hawraa Salami Bicheng Ying Ali H. Sayed |
spellingShingle |
Hawraa Salami Bicheng Ying Ali H. Sayed Belief Control Strategies for Interactions Over Weakly-Connected Graphs IEEE Open Journal of Signal Processing Social networks diffusion learning influential agents leader-follower relation belief control weak graph |
author_facet |
Hawraa Salami Bicheng Ying Ali H. Sayed |
author_sort |
Hawraa Salami |
title |
Belief Control Strategies for Interactions Over Weakly-Connected Graphs |
title_short |
Belief Control Strategies for Interactions Over Weakly-Connected Graphs |
title_full |
Belief Control Strategies for Interactions Over Weakly-Connected Graphs |
title_fullStr |
Belief Control Strategies for Interactions Over Weakly-Connected Graphs |
title_full_unstemmed |
Belief Control Strategies for Interactions Over Weakly-Connected Graphs |
title_sort |
belief control strategies for interactions over weakly-connected graphs |
publisher |
IEEE |
series |
IEEE Open Journal of Signal Processing |
issn |
2644-1322 |
publishDate |
2021-01-01 |
description |
In diffusion social learning over weakly-connected graphs, it has been shown recently that influential agents shape the beliefs of non-influential agents. This paper analyzes this mechanism more closely and addresses two main questions. First, the article examines how much freedom influential agents have in controlling the beliefs of the receiving agents, namely, whether receiving agents can be driven to arbitrary beliefs and whether the network structure limits the scope of control by the influential agents. Second, even if there is a limit to what influential agents can accomplish, this article develops mechanisms by which they can lead receiving agents to adopt certain beliefs. These questions raise interesting possibilities about belief control over networked agents. Once addressed, one ends up with design procedures that allow influential agents to drive other agents to endorse particular beliefs regardless of their local observations or convictions. The theoretical findings are illustrated by means of examples. |
topic |
Social networks diffusion learning influential agents leader-follower relation belief control weak graph |
url |
https://ieeexplore.ieee.org/document/9432750/ |
work_keys_str_mv |
AT hawraasalami beliefcontrolstrategiesforinteractionsoverweaklyconnectedgraphs AT bichengying beliefcontrolstrategiesforinteractionsoverweaklyconnectedgraphs AT alihsayed beliefcontrolstrategiesforinteractionsoverweaklyconnectedgraphs |
_version_ |
1721377757182558208 |