全局信息来自局部观测的有噪声选民模型上的一个图

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":"全局信息来自局部观测的有噪声选民模型上的一个图","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":"{\"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}","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

摘要

我们在图的单个顶点上观察离散时间噪声选民模型的结果。我们证明某些图对可以通过观察序列中重复的频率来区分。我们证明了这个统计量是渐近正态的，并且它可以(渐近地)区分几乎所有的有限图对。我们推测，噪声选民模型可以区分除星形图以外的任意两个图。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

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

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Annals of Probability 数学-统计学与概率论

CiteScore

4.60

自引率

8.70%

发文量

审稿时长

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.