Majority dynamics on random graphs: The multiple states case

IF 1.2 2区 数学 Q3 STATISTICS & PROBABILITY
Jordan Chellig, Nikolaos Fountoulakis
{"title":"Majority dynamics on random graphs: The multiple states case","authors":"Jordan Chellig,&nbsp;Nikolaos Fountoulakis","doi":"10.1016/j.spa.2025.104682","DOIUrl":null,"url":null,"abstract":"<div><div>We study the evolution of majority dynamics with more than two states on the binomial random graph <span><math><mrow><mi>G</mi><mrow><mo>(</mo><mi>n</mi><mo>,</mo><mi>p</mi><mo>)</mo></mrow></mrow></math></span>. In this process, each vertex has a state in <span><math><mrow><mo>{</mo><mn>1</mn><mo>,</mo><mo>…</mo><mo>,</mo><mi>k</mi><mo>}</mo></mrow></math></span>, with <span><math><mrow><mi>k</mi><mo>≥</mo><mn>3</mn></mrow></math></span>, and at each round every vertex adopts state <span><math><mi>i</mi></math></span> if it has more neighbours in state <span><math><mi>i</mi></math></span> than in any other state. Ties are resolved randomly. We show that with high probability the process reaches unanimity in at most three rounds, if <span><math><mrow><mi>n</mi><mi>p</mi><mo>≫</mo><msup><mrow><mi>n</mi></mrow><mrow><mn>2</mn><mo>/</mo><mn>3</mn></mrow></msup></mrow></math></span>.</div></div>","PeriodicalId":51160,"journal":{"name":"Stochastic Processes and their Applications","volume":"189 ","pages":"Article 104682"},"PeriodicalIF":1.2000,"publicationDate":"2025-05-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Stochastic Processes and their Applications","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0304414925001231","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"STATISTICS & PROBABILITY","Score":null,"Total":0}
引用次数: 0

Abstract

We study the evolution of majority dynamics with more than two states on the binomial random graph G(n,p). In this process, each vertex has a state in {1,,k}, with k3, and at each round every vertex adopts state i if it has more neighbours in state i than in any other state. Ties are resolved randomly. We show that with high probability the process reaches unanimity in at most three rounds, if npn2/3.
随机图上的多数动态:多状态情况
研究了二项随机图G(n,p)上具有两个以上状态的多数动力学的演化。在这个过程中,每个顶点都有一个状态{1,…,k},且k≥3,在每一轮中,如果处于状态i的邻居比处于其他状态的邻居多,则每个顶点都采用状态i。平局是随机解决的。我们证明了在np = n2/3的条件下,该过程有高概率在最多三轮内达到一致。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Stochastic Processes and their Applications
Stochastic Processes and their Applications 数学-统计学与概率论
CiteScore
2.90
自引率
7.10%
发文量
180
审稿时长
23.6 weeks
期刊介绍: Stochastic Processes and their Applications publishes papers on the theory and applications of stochastic processes. It is concerned with concepts and techniques, and is oriented towards a broad spectrum of mathematical, scientific and engineering interests. Characterization, structural properties, inference and control of stochastic processes are covered. The journal is exacting and scholarly in its standards. Every effort is made to promote innovation, vitality, and communication between disciplines. All papers are refereed.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信