Consensus in Complex Networks with Noisy Agents and Peer Pressure

Consensus in Complex Networks with Noisy Agents and Peer Pressure

In this paper we study a discrete time consensus model on a connected graph with monotonically increasing peer-pressure and noise perturbed outputs masking a hidden state. We assume that each agent maintains a constant hidden state and a presents a dynamic output that is perturbed by random noise dr...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:arXiv.org 2023-06
Hauptverfasser: Griffin, Christopher, Squicciarini, Anna, Jia, Feiran
Format: Artikel
Sprache:eng
Schlagworte:
Physics - Physics and Society
Random noise
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title arXiv.org
container_volume
creator Griffin, Christopher
Squicciarini, Anna
Jia, Feiran
description In this paper we study a discrete time consensus model on a connected graph with monotonically increasing peer-pressure and noise perturbed outputs masking a hidden state. We assume that each agent maintains a constant hidden state and a presents a dynamic output that is perturbed by random noise drawn from a mean-zero distribution. We show consensus is ensured in the limit as time goes to infinity under certain assumptions on the increasing peer-pressure term and also show that the hidden state cannot be exactly recovered even when model dynamics and outputs are known. The exact nature of the distribution is computed for a simple two vertex graph and results found are shown to generalize (empirically) to more complex graph structures.
doi_str_mv 10.48550/arxiv.2306.14586
format Article
fullrecord <record><control><sourceid>proquest_arxiv</sourceid><recordid>TN_cdi_arxiv_primary_2306_14586</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2829980552</sourcerecordid><originalsourceid>FETCH-LOGICAL-a956-71e88a18a24929fe6b6d1776f3af6a59ca648c59c54ff511305f53f01c4235003</originalsourceid><addsrcrecordid>eNotj7tOwzAYRi0kJKrSB2DCEnOCb79jj1HEpVJVOnSPTGpDSmsHO6Ht2xNaprMcffoOQneU5EIBkEcTj-1PzjiRORWg5BWaMM5ppgRjN2iW0pYQwmTBAPgElVXwyfo0JNx6XIV9t7NHvLT9IcSvhA9t_4mXoU0nXH5Y3yds_AavrI14FW1KQ7S36NqZXbKzf07R-vlpXb1mi7eXeVUuMqNBZgW1ShmqDBOaaWflu9zQopCOGycN6MZIoZqRIJwDSjkBB9wR2gjGgRA-RfeX2XNf3cV2b-Kp_uusz52j8XAxuhi-B5v6ehuG6MdPNVNMa0UAGP8F_OpUPg</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2829980552</pqid></control><display><type>article</type><title>Consensus in Complex Networks with Noisy Agents and Peer Pressure</title><source>arXiv.org</source><source>Free E- Journals</source><creator>Griffin, Christopher ; Squicciarini, Anna ; Jia, Feiran</creator><creatorcontrib>Griffin, Christopher ; Squicciarini, Anna ; Jia, Feiran</creatorcontrib><description>In this paper we study a discrete time consensus model on a connected graph with monotonically increasing peer-pressure and noise perturbed outputs masking a hidden state. We assume that each agent maintains a constant hidden state and a presents a dynamic output that is perturbed by random noise drawn from a mean-zero distribution. We show consensus is ensured in the limit as time goes to infinity under certain assumptions on the increasing peer-pressure term and also show that the hidden state cannot be exactly recovered even when model dynamics and outputs are known. The exact nature of the distribution is computed for a simple two vertex graph and results found are shown to generalize (empirically) to more complex graph structures.</description><identifier>EISSN: 2331-8422</identifier><identifier>DOI: 10.48550/arxiv.2306.14586</identifier><language>eng</language><publisher>Ithaca: Cornell University Library, arXiv.org</publisher><subject>Physics - Physics and Society ; Random noise</subject><ispartof>arXiv.org, 2023-06</ispartof><rights>2023. This work is published under http://arxiv.org/licenses/nonexclusive-distrib/1.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><rights>http://arxiv.org/licenses/nonexclusive-distrib/1.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,776,780,881,27902</link.rule.ids><backlink>$$Uhttps://doi.org/10.1016/j.physa.2022.128263$$DView published paper (Access to full text may be restricted)$$Hfree_for_read</backlink><backlink>$$Uhttps://doi.org/10.48550/arXiv.2306.14586$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Griffin, Christopher</creatorcontrib><creatorcontrib>Squicciarini, Anna</creatorcontrib><creatorcontrib>Jia, Feiran</creatorcontrib><title>Consensus in Complex Networks with Noisy Agents and Peer Pressure</title><title>arXiv.org</title><description>In this paper we study a discrete time consensus model on a connected graph with monotonically increasing peer-pressure and noise perturbed outputs masking a hidden state. We assume that each agent maintains a constant hidden state and a presents a dynamic output that is perturbed by random noise drawn from a mean-zero distribution. We show consensus is ensured in the limit as time goes to infinity under certain assumptions on the increasing peer-pressure term and also show that the hidden state cannot be exactly recovered even when model dynamics and outputs are known. The exact nature of the distribution is computed for a simple two vertex graph and results found are shown to generalize (empirically) to more complex graph structures.</description><subject>Physics - Physics and Society</subject><subject>Random noise</subject><issn>2331-8422</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2023</creationdate><recordtype>article</recordtype><sourceid>BENPR</sourceid><sourceid>GOX</sourceid><recordid>eNotj7tOwzAYRi0kJKrSB2DCEnOCb79jj1HEpVJVOnSPTGpDSmsHO6Ht2xNaprMcffoOQneU5EIBkEcTj-1PzjiRORWg5BWaMM5ppgRjN2iW0pYQwmTBAPgElVXwyfo0JNx6XIV9t7NHvLT9IcSvhA9t_4mXoU0nXH5Y3yds_AavrI14FW1KQ7S36NqZXbKzf07R-vlpXb1mi7eXeVUuMqNBZgW1ShmqDBOaaWflu9zQopCOGycN6MZIoZqRIJwDSjkBB9wR2gjGgRA-RfeX2XNf3cV2b-Kp_uusz52j8XAxuhi-B5v6ehuG6MdPNVNMa0UAGP8F_OpUPg</recordid><startdate>20230626</startdate><enddate>20230626</enddate><creator>Griffin, Christopher</creator><creator>Squicciarini, Anna</creator><creator>Jia, Feiran</creator><general>Cornell University Library, arXiv.org</general><scope>8FE</scope><scope>8FG</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>HCIFZ</scope><scope>L6V</scope><scope>M7S</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope><scope>GOX</scope></search><sort><creationdate>20230626</creationdate><title>Consensus in Complex Networks with Noisy Agents and Peer Pressure</title><author>Griffin, Christopher ; Squicciarini, Anna ; Jia, Feiran</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a956-71e88a18a24929fe6b6d1776f3af6a59ca648c59c54ff511305f53f01c4235003</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2023</creationdate><topic>Physics - Physics and Society</topic><topic>Random noise</topic><toplevel>online_resources</toplevel><creatorcontrib>Griffin, Christopher</creatorcontrib><creatorcontrib>Squicciarini, Anna</creatorcontrib><creatorcontrib>Jia, Feiran</creatorcontrib><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science &amp; Engineering Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Engineering Collection</collection><collection>Engineering Database</collection><collection>Publicly Available Content Database</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Engineering Collection</collection><collection>arXiv.org</collection><jtitle>arXiv.org</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Griffin, Christopher</au><au>Squicciarini, Anna</au><au>Jia, Feiran</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Consensus in Complex Networks with Noisy Agents and Peer Pressure</atitle><jtitle>arXiv.org</jtitle><date>2023-06-26</date><risdate>2023</risdate><eissn>2331-8422</eissn><abstract>In this paper we study a discrete time consensus model on a connected graph with monotonically increasing peer-pressure and noise perturbed outputs masking a hidden state. We assume that each agent maintains a constant hidden state and a presents a dynamic output that is perturbed by random noise drawn from a mean-zero distribution. We show consensus is ensured in the limit as time goes to infinity under certain assumptions on the increasing peer-pressure term and also show that the hidden state cannot be exactly recovered even when model dynamics and outputs are known. The exact nature of the distribution is computed for a simple two vertex graph and results found are shown to generalize (empirically) to more complex graph structures.</abstract><cop>Ithaca</cop><pub>Cornell University Library, arXiv.org</pub><doi>10.48550/arxiv.2306.14586</doi><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier EISSN: 2331-8422
ispartof arXiv.org, 2023-06
issn 2331-8422
language eng
recordid cdi_arxiv_primary_2306_14586
source arXiv.org; Free E- Journals
subjects Physics - Physics and Society
Random noise
title Consensus in Complex Networks with Noisy Agents and Peer Pressure
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-08T00%3A31%3A39IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_arxiv&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Consensus%20in%20Complex%20Networks%20with%20Noisy%20Agents%20and%20Peer%20Pressure&rft.jtitle=arXiv.org&rft.au=Griffin,%20Christopher&rft.date=2023-06-26&rft.eissn=2331-8422&rft_id=info:doi/10.48550/arxiv.2306.14586&rft_dat=%3Cproquest_arxiv%3E2829980552%3C/proquest_arxiv%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2829980552&rft_id=info:pmid/&rfr_iscdi=true