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

2022/07/04 by Itaï Benjamini, Benjamini, Itai, Hagai Helman Tov +3
Mathematics · Physics and Astronomy · #Combinatorics (math.CO) #Complex Network Analysis Techniques #FOS: Mathematics #Opinion Dynamics and Social Influence #Probability (math.PR) #Random Matrices and Applications

paper · pdf · doi:10.48550/arxiv.2207.01224

openalex publication_date 2022/07/04 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

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.

Related

• The noisy voter model with general initial conditions
• Quasi-Stationary Distributions for the Voter Model on Complete Bipartite Graphs
• The mean field stubborn voter model
• Evolution of discordant edges in the voter model on random sparse digraphs
• Counting Vertices in a Voter-type Model