On the Limits of Information Spread by Memory-less Agents
We address the self-stabilizing bit-dissemination problem, designed to capture the challenges of spreading information and reaching consensus among entities with minimal cognitive and communication capacities. Specifically, a group of \(n\) agents is required to adopt the correct opinion, initially...
Uloženo v:
| Vydáno v: | arXiv.org |
|---|---|
| Hlavní autoři: | , |
| Médium: | Paper |
| Jazyk: | angličtina japonština |
| Vydáno: |
Ithaca
Cornell University Library, arXiv.org
01.01.2024
|
| Témata: | |
| ISSN: | 2331-8422 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Abstract | We address the self-stabilizing bit-dissemination problem, designed to capture the challenges of spreading information and reaching consensus among entities with minimal cognitive and communication capacities. Specifically, a group of \(n\) agents is required to adopt the correct opinion, initially held by a single informed individual, choosing from two possible opinions. In order to make decisions, agents are restricted to observing the opinions of a few randomly sampled agents, and lack the ability to communicate further and to identify the informed individual. Additionally, agents cannot retain any information from one round to the next. According to a recent publication by Becchetti et al. in SODA (2024), a logarithmic convergence time without memory is achievable in the parallel setting (where agents are updated simultaneously), as long as the number of samples is at least \(\Omega(\sqrt{n \log n})\). However, determining the minimal sample size for an efficient protocol to exist remains a challenging open question. As a preliminary step towards an answer, we establish the first lower bound for this problem in the parallel setting. Specifically, we demonstrate that it is impossible for any memory-less protocol with constant sample size, to converge with high probability in less than an almost-linear number of rounds. This lower bound holds even when agents are aware of both the exact value of \(n\) and their own opinion, and encompasses various simple existing dynamics designed to achieve consensus. Beyond the bit-dissemination problem, our result sheds light on the convergence time of the ``minority'' dynamics, the counterpart of the well-known majority rule, whose chaotic behavior is yet to be fully understood despite the apparent simplicity of the algorithm. |
|---|---|
| AbstractList | We address the self-stabilizing bit-dissemination problem, designed to capture the challenges of spreading information and reaching consensus among entities with minimal cognitive and communication capacities. Specifically, a group of \(n\) agents is required to adopt the correct opinion, initially held by a single informed individual, choosing from two possible opinions. In order to make decisions, agents are restricted to observing the opinions of a few randomly sampled agents, and lack the ability to communicate further and to identify the informed individual. Additionally, agents cannot retain any information from one round to the next. According to a recent publication by Becchetti et al. in SODA (2024), a logarithmic convergence time without memory is achievable in the parallel setting (where agents are updated simultaneously), as long as the number of samples is at least \(\Omega(\sqrt{n \log n})\). However, determining the minimal sample size for an efficient protocol to exist remains a challenging open question. As a preliminary step towards an answer, we establish the first lower bound for this problem in the parallel setting. Specifically, we demonstrate that it is impossible for any memory-less protocol with constant sample size, to converge with high probability in less than an almost-linear number of rounds. This lower bound holds even when agents are aware of both the exact value of \(n\) and their own opinion, and encompasses various simple existing dynamics designed to achieve consensus. Beyond the bit-dissemination problem, our result sheds light on the convergence time of the ``minority'' dynamics, the counterpart of the well-known majority rule, whose chaotic behavior is yet to be fully understood despite the apparent simplicity of the algorithm. |
| Author | D'Archivio, Niccolò Vacus, Robin |
| Author_xml | – sequence: 1 givenname: Niccolò surname: D'Archivio fullname: D'Archivio, Niccolò – sequence: 2 givenname: Robin surname: Vacus fullname: Vacus, Robin |
| BookMark | eNotjc1KAzEYAIMoWGsfwFvA86753WSPpagtrPSgnsuX7Bfd0iY12Yp9ewt6msPAzA25jCkiIXec1cpqzR4g_wzftVBM1JxrLS_IREjJK6uEuCazUraMMdEYcXYT0q4jHT-RdsN-GAtNga5iSHkP45AifT1khJ66E33Bfcqnaoel0PkHxrHckqsAu4Kzf07J-9Pj22JZdevn1WLeVcCVUZUBZXnvgvcIDrTn1gfFoHWtF142Dr11qmE6gPEGnRZtb7QC0NYKDDbIKbn_6x5y-jpiGTfbdMzxvNyIVljDVdMq-QsAkUrT |
| ContentType | Paper |
| Copyright | 2024. This work is published under http://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. |
| Copyright_xml | – notice: 2024. This work is published under http://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. |
| DBID | 8FE 8FG ABJCF ABUWG AFKRA AZQEC BENPR BGLVJ CCPQU DWQXO HCIFZ L6V M7S PHGZM PHGZT PIMPY PKEHL PQEST PQGLB PQQKQ PQUKI PRINS PTHSS |
| DOI | 10.48550/arxiv.2402.11553 |
| DatabaseName | ProQuest SciTech Collection ProQuest Technology Collection Materials Science & Engineering Collection ProQuest Central (Alumni) ProQuest Central UK/Ireland ProQuest Central Essentials ProQuest Central Technology Collection ProQuest One Community College ProQuest Central Korea SciTech Premium Collection ProQuest Engineering Collection Engineering Database (Proquest) Proquest Central Premium ProQuest One Academic Publicly Available Content Database ProQuest One Academic Middle East (New) ProQuest One Academic Eastern Edition (DO NOT USE) ProQuest One Applied & Life Sciences ProQuest One Academic (retired) ProQuest One Academic UKI Edition ProQuest Central China Engineering Collection |
| DatabaseTitle | Publicly Available Content Database Engineering Database Technology Collection ProQuest One Academic Middle East (New) ProQuest Central Essentials ProQuest One Academic Eastern Edition ProQuest Central (Alumni Edition) SciTech Premium Collection ProQuest One Community College ProQuest Technology Collection ProQuest SciTech Collection ProQuest Central China ProQuest Central ProQuest One Applied & Life Sciences ProQuest Engineering Collection ProQuest One Academic UKI Edition ProQuest Central Korea Materials Science & Engineering Collection ProQuest Central (New) ProQuest One Academic ProQuest One Academic (New) Engineering Collection |
| DatabaseTitleList | Publicly Available Content Database |
| Database_xml | – sequence: 1 dbid: PIMPY name: Publicly Available Content Database url: http://search.proquest.com/publiccontent sourceTypes: Aggregation Database |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Physics |
| EISSN | 2331-8422 |
| Genre | Working Paper/Pre-Print |
| GroupedDBID | 8FE 8FG ABJCF ABUWG AFKRA ALMA_UNASSIGNED_HOLDINGS AZQEC BENPR BGLVJ CCPQU DWQXO FRJ HCIFZ L6V M7S M~E PHGZM PHGZT PIMPY PKEHL PQEST PQGLB PQQKQ PQUKI PRINS PTHSS |
| ID | FETCH-LOGICAL-a1474-7a481dbfcceaba5c18cf40a9b9c2c36bec8b4605fa7c7eb529d754aa5882ef8f3 |
| IEDL.DBID | M7S |
| IngestDate | Mon Jun 30 09:20:51 EDT 2025 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | false |
| IsScholarly | false |
| Language | English Japanese |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-a1474-7a481dbfcceaba5c18cf40a9b9c2c36bec8b4605fa7c7eb529d754aa5882ef8f3 |
| Notes | SourceType-Working Papers-1 ObjectType-Working Paper/Pre-Print-1 content type line 50 |
| OpenAccessLink | https://www.proquest.com/docview/2928714694?pq-origsite=%requestingapplication% |
| PQID | 2928714694 |
| PQPubID | 2050157 |
| ParticipantIDs | proquest_journals_2928714694 |
| PublicationCentury | 2000 |
| PublicationDate | 2024-01-01 |
| PublicationDateYYYYMMDD | 2024-01-01 |
| PublicationDate_xml | – month: 01 year: 2024 text: 2024-01-01 day: 01 |
| PublicationDecade | 2020 |
| PublicationPlace | Ithaca |
| PublicationPlace_xml | – name: Ithaca |
| PublicationTitle | arXiv.org |
| PublicationYear | 2024 |
| Publisher | Cornell University Library, arXiv.org |
| Publisher_xml | – name: Cornell University Library, arXiv.org |
| SSID | ssj0002672553 |
| Score | 1.8556923 |
| SecondaryResourceType | preprint |
| Snippet | We address the self-stabilizing bit-dissemination problem, designed to capture the challenges of spreading information and reaching consensus among entities... |
| SourceID | proquest |
| SourceType | Aggregation Database |
| SubjectTerms | Algorithms Convergence Lower bounds Memory Reagents |
| Title | On the Limits of Information Spread by Memory-less Agents |
| URI | https://www.proquest.com/docview/2928714694 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1NSwMxEA3aKnjyGz9qycFrbLPNfuQkKi16aF2sQj2VJJtAQbZ1txb7751JtwoevHhcdheWTHh5O_NmHiGXcIZEgdAR48ZGDFsXWZIFkinV1lzhgCmuvdlEPBgko5FMq4RbWckq15jogTqbGsyRtwKJ3B5-5sT17J2haxRWVysLjU1SxykJ3Ev3ht85liCKgTF3VsVMP7qrpYrPyeIKSwoAFiFaIv-CYH-u9Hb_-0V7pJ6qmS32yYbND8i213Oa8pDIx5wCtaO-f6mkU0erviOMAx3OgCpmVC9pH4W2S_YGeEdvsMuqPCIvve7z3T2rXBKY4gLFlEoA59TOGKu0Cg1PjBNtJbU0gelEEKNEY_HTqdjEVoeBzOJQKBUCt7YucZ1jUsunuT0hlKNlTRsedKETUSKAOuqMuyyW8KLN3ClprFdiXG31cvyzDGd_3z4nOwEwglX-okFq8-LDXpAts5hPyqJJ6rfdQfrU9BGEq_Shn75-AcgOpno |
| linkProvider | ProQuest |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1LTwIxEJ4oaPTkOz5Qe9BjhS376sEYoxIID0nAhBu23TYhMQvuIsqf8jc6XUATD944eN7dZnc6O_06M18_gAtcQ3zmSp86SvvUUhdpGDFOhShJR9gDphyZiU0ErVbY6_H2CnwuuDC2rXIRE7NAHQ2VzZEXGbfYHjdz7s3olVrVKFtdXUhozNyirqfvuGVLr2v3OL-XjFUeundVOlcVoMJxbfOhcBGjSaOUFlJ4ygmVcUuCS66YKvv4TaG0xUIjAhVo6TEeBZ4rhIdYVJvQlHHcVcgjjGA8axXsfOd0mB8gQi_PiqfZUWFFkXwMJle2hIHBybMSzL9CfraOVbb-mwW2Id8WI53swIqOd2E961dV6R7wx5ggdCUZPyslQ0PmvCrrZ6QzQigcETklTdtIPKUvGM_JrWWRpfvwtJS3PYBcPIz1IRDHSvKU8EbjGdcPXYTGMnJMFHB8UEfmCAoLy_fnv3La_zH78d-Xz2Gj2m02-o1aq34CmwzRzyxXU4DcOHnTp7CmJuNBmpxlXkPgedmT9AX11QOv |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=On+the+Limits+of+Information+Spread+by+Memory-less+Agents&rft.jtitle=arXiv.org&rft.au=D%27Archivio%2C+Niccol%C3%B2&rft.au=Vacus%2C+Robin&rft.date=2024-01-01&rft.pub=Cornell+University+Library%2C+arXiv.org&rft.eissn=2331-8422&rft_id=info:doi/10.48550%2Farxiv.2402.11553 |