{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,26]],"date-time":"2025-12-26T07:11:20Z","timestamp":1766733080261,"version":"build-2065373602"},"reference-count":25,"publisher":"MDPI AG","issue":"1","license":[{"start":{"date-parts":[[2023,12,21]],"date-time":"2023-12-21T00:00:00Z","timestamp":1703116800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Air Force Office of Scientific Research","award":["FA9550-23-1-0107","EPCN-1944403","AG285"],"award-info":[{"award-number":["FA9550-23-1-0107","EPCN-1944403","AG285"]}]},{"name":"NSF CAREER Award","award":["FA9550-23-1-0107","EPCN-1944403","AG285"],"award-info":[{"award-number":["FA9550-23-1-0107","EPCN-1944403","AG285"]}]},{"name":"ARO MURI Grant","award":["FA9550-23-1-0107","EPCN-1944403","AG285"],"award-info":[{"award-number":["FA9550-23-1-0107","EPCN-1944403","AG285"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Entropy"],"abstract":"<jats:p>We consider information dissemination over a network of gossiping agents. In this model, a source keeps the most up-to-date information about a time-varying binary state of the world, and n receiver nodes want to follow the information at the source as accurately as possible. When the information at the source changes, the source first sends updates to a subset of m\u2264n nodes. Then, the nodes share their local information during the gossiping period, to disseminate the information further. The nodes then estimate the information at the source, using the majority rule at the end of the gossiping period. To analyze the information dissemination, we introduce a new error metric to find the average percentage of nodes that can accurately obtain the most up-to-date information at the source. We characterize the equations necessary to obtain the steady-state distribution for the average error and then analyze the system behavior under both high and low gossip rates. We develop an adaptive policy that the source can use to determine its current transmission capacity m based on its past transmission rates and the accuracy of the information at the nodes. Finally, we implement a clustered gossiping network model, to further improve the information dissemination.<\/jats:p>","DOI":"10.3390\/e26010009","type":"journal-article","created":{"date-parts":[[2023,12,21]],"date-time":"2023-12-21T08:16:02Z","timestamp":1703146562000},"page":"9","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["The Role of Gossiping in Information Dissemination over a Network of Agents"],"prefix":"10.3390","volume":"26","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5122-0642","authenticated-orcid":false,"given":"Melih","family":"Bastopcu","sequence":"first","affiliation":[{"name":"Coordinated Science Laboratory, University of Illinois Urbana-Champaign, Urbana, IL 61801, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2087-6136","authenticated-orcid":false,"given":"Seyed Rasoul","family":"Etesami","sequence":"additional","affiliation":[{"name":"Coordinated Science Laboratory, University of Illinois Urbana-Champaign, Urbana, IL 61801, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4406-7875","authenticated-orcid":false,"given":"Tamer","family":"Ba\u015far","sequence":"additional","affiliation":[{"name":"Coordinated Science Laboratory, University of Illinois Urbana-Champaign, Urbana, IL 61801, USA"}]}],"member":"1968","published-online":{"date-parts":[[2023,12,21]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","unstructured":"Shah, D. (2009). Gossip Algorithms, Now Publishers Inc.","DOI":"10.1109\/ICASSP.2009.4960423"},{"key":"ref_2","doi-asserted-by":"crossref","unstructured":"Mosk-Aoyama, D., and Shah, D. (2006, January 9\u201314). Information dissemination via network coding. Proceedings of the IEEE ISIT, Seattle, DC, USA.","DOI":"10.1109\/ISIT.2006.261654"},{"key":"ref_3","unstructured":"Boyd, S., Ghosh, A., Prabhakar, B., and Shah, D. (2004, January 14\u201317). Analysis and optimization of randomized gossip algorithms. Proceedings of the IEEE CDC, Nassau, Bahamas."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"2508","DOI":"10.1109\/TIT.2006.874516","article-title":"Randomized gossip algorithms","volume":"52","author":"Boyd","year":"2006","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1007\/s004460050031","article-title":"Keeping track of the latest gossip in a distributed system","volume":"10","author":"Mukund","year":"1997","journal-title":"Distrib. Comput."},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Israeli, A., and Li, M. (1987, January 12\u201314). Bounded time-stamps. Proceedings of the 28th Annual Symposium on Foundations of Computer Science, Los Angeles, CA, USA.","DOI":"10.1109\/SFCS.1987.10"},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/978-3-031-79293-9","article-title":"Age of information: A new metric for information freshness","volume":"12","author":"Sun","year":"2019","journal-title":"Synth. Lect. Commun. Netw."},{"key":"ref_8","first-page":"1183","article-title":"Age of information: An introduction and survey","volume":"39","author":"Yates","year":"2021","journal-title":"IEEE JSAC"},{"key":"ref_9","doi-asserted-by":"crossref","unstructured":"Yates, R.D. (2021, January 12\u201320). The age of gossip in networks. Proceedings of the IEEE ISIT, Melbourne, Australia.","DOI":"10.1109\/ISIT45174.2021.9517796"},{"key":"ref_10","first-page":"85","article-title":"Version age of information in clustered gossip networks","volume":"3","author":"Buyukates","year":"2022","journal-title":"IEEE JSAC"},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Bastopcu, M., Buyukates, B., and Ulukus, S. (2021, January 7\u201311). Gossiping with binary freshness metric. Proceedings of the IEEE Globecom Workshops, Madrid, Spain.","DOI":"10.1109\/GCWkshps52748.2021.9682174"},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"390","DOI":"10.1145\/958942.958945","article-title":"Effective page refresh policies for web crawlers","volume":"28","author":"Cho","year":"2003","journal-title":"Acm Trans. Database Syst."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"8099","DOI":"10.1073\/pnas.1801519115","article-title":"Tractable near-optimal policies for crawling","volume":"115","author":"Azar","year":"2018","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"ref_14","doi-asserted-by":"crossref","unstructured":"Kolobov, A., Peres, Y., Lubetzky, E., and Horvitz, E. (2019, January 21\u201325). Optimal freshness crawl under politeness constraints. Proceedings of the ACM SIGIR Conference, Paris, France.","DOI":"10.1145\/3331184.3331241"},{"key":"ref_15","unstructured":"Minnaard, W., de Laat, C.T.A.M., and van Loosen MSc, M. (2014). Timestomping NTFS, University of Amsterdam. IMSc Final Research Project Report."},{"key":"ref_16","doi-asserted-by":"crossref","unstructured":"Kaswan, P., and Ulukus, S. (2022). Susceptibility of age of gossip to timestomping. arXiv.","DOI":"10.1109\/ITW54588.2022.9965757"},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"2352","DOI":"10.1109\/TAC.2018.2884998","article-title":"Distributed discrete-time optimization in multiagent networks using only sign of relative state","volume":"64","author":"Zhang","year":"2019","journal-title":"IEEE Trans. Autom. Control."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"109676","DOI":"10.1016\/j.automatica.2021.109676","article-title":"Decentralized online convex optimization based on signs of relative states","volume":"129","author":"Cao","year":"2021","journal-title":"Automatica"},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1109\/TCNS.2018.2806179","article-title":"Influence of conformist and manipulative behaviors on public opinion","volume":"6","author":"Etesami","year":"2018","journal-title":"IEEE Trans. Control. Netw. Syst."},{"key":"ref_20","unstructured":"Coban, \u00d6., Truic\u0103, C.O., and Apostol, E.S. (2023). CONTAIN: A Community-based Algorithm for Network Immunization. arXiv."},{"key":"ref_21","doi-asserted-by":"crossref","unstructured":"Petrescu, A., Truic\u0103, C.O., Apostol, E.S., and Karras, P. (2021, January 1\u20135). Sparse shield: Social network immunization vs. harmful speech. Proceedings of the 30th ACM International Conference on Information & Knowledge Management, Virtual Event.","DOI":"10.1145\/3459637.3482481"},{"key":"ref_22","unstructured":"Truic\u0103, C.O., Apostol, E.S., and Karras, P. (2023). DANES: Deep Neural Network Ensemble Architecture for Social and Textual Context-aware Fake News Detection. arXiv."},{"key":"ref_23","unstructured":"Bastopcu, M., Etesami, S.R., and Ba\u015far, T. (July, January 26). The dissemination of time-varying information over networked agents with gossiping. Proceedings of the IEEE ISIT, Espoo, Finland."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"1861","DOI":"10.1109\/TWC.2020.3037144","article-title":"Information freshness in cache updating systems","volume":"20","author":"Bastopcu","year":"2021","journal-title":"IEEE Trans. Wirel. Commun."},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1089\/big.2020.0062","article-title":"Fakenewsnet: A data repository with news content, social context, and spatiotemporal information for studying fake news on social media","volume":"8","author":"Shu","year":"2020","journal-title":"Big Data"}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/26\/1\/9\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T21:39:39Z","timestamp":1760132379000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/26\/1\/9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,21]]},"references-count":25,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2024,1]]}},"alternative-id":["e26010009"],"URL":"https:\/\/doi.org\/10.3390\/e26010009","relation":{},"ISSN":["1099-4300"],"issn-type":[{"type":"electronic","value":"1099-4300"}],"subject":[],"published":{"date-parts":[[2023,12,21]]}}}