Global information from local observations of the noisy voter model on a graph

IF 2.1 1区 数学 Q1 STATISTICS & PROBABILITY Annals of Probability Pub Date : 2023-09-01 DOI:10.1214/23-aop1637
Itai Benjamini, Hagai Helman Tov, Maksim Zhukovskii
{"title":"Global information from local observations of the noisy voter model on a graph","authors":"Itai Benjamini, Hagai Helman Tov, Maksim Zhukovskii","doi":"10.1214/23-aop1637","DOIUrl":null,"url":null,"abstract":"We observe the outcome of the discrete time noisy voter model at a single vertex of a graph. We show that certain pairs of graphs can be distinguished by the frequency of repetitions in the sequence of observations. We prove that this statistic is asymptotically normal and that it distinguishes between (asymptotically) almost all pairs of finite graphs. We conjecture that the noisy voter model distinguishes between any two graphs other than stars.","PeriodicalId":50763,"journal":{"name":"Annals of Probability","volume":null,"pages":null},"PeriodicalIF":2.1000,"publicationDate":"2023-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Annals of Probability","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1214/23-aop1637","RegionNum":1,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"STATISTICS & PROBABILITY","Score":null,"Total":0}
引用次数: 1

Abstract

We observe the outcome of the discrete time noisy voter model at a single vertex of a graph. We show that certain pairs of graphs can be distinguished by the frequency of repetitions in the sequence of observations. We prove that this statistic is asymptotically normal and that it distinguishes between (asymptotically) almost all pairs of finite graphs. We conjecture that the noisy voter model distinguishes between any two graphs other than stars.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
全局信息来自局部观测的有噪声选民模型上的一个图
我们在图的单个顶点上观察离散时间噪声选民模型的结果。我们证明某些图对可以通过观察序列中重复的频率来区分。我们证明了这个统计量是渐近正态的,并且它可以(渐近地)区分几乎所有的有限图对。我们推测,噪声选民模型可以区分除星形图以外的任意两个图。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Annals of Probability
Annals of Probability 数学-统计学与概率论
CiteScore
4.60
自引率
8.70%
发文量
61
审稿时长
6-12 weeks
期刊介绍: The Annals of Probability publishes research papers in modern probability theory, its relations to other areas of mathematics, and its applications in the physical and biological sciences. Emphasis is on importance, interest, and originality – formal novelty and correctness are not sufficient for publication. The Annals will also publish authoritative review papers and surveys of areas in vigorous development.
期刊最新文献
Most transient random walks have infinitely many cut times Scaling limit of the heavy tailed ballistic deposition model with p-sticking Decay of convolved densities via Laplace transform On strong solutions of Itô’s equations with Dσ and b in Morrey classes containing Ld Global information from local observations of the noisy voter model on a graph
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1