  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.
