2013/11/19 by Radoslav Marinov, Marinov, Radoslav
Mathematics · #05C81 (Primary) 60J05 #82B20 (Secondary) #FOS: Mathematics #Probability (math.PR) #math.PR #msc:05C81 #msc:60J05 #msc:82B20
paper · pdf · doi:10.48550/arxiv.1311.4807
arxiv created 2013/11/19 · arxiv updated 2013/11/20
The Neighborhood Attack model is a Voter type model, which takes a finite graph, assigns 1's and -1's to its nodes (vertices), and then runs a Markov chain on the graph by uniformly at random picking a node at every turn, and then switching the values of the node and its neighbors to 1's or -1's according to a (not necessarily fair) coin toss. We show, via a Stein's method argument, that for certain (highly symmetric) families of graphs the number of 1's in the Neighbourhood Attack Voter-type model is asymptotically normally distributed as the number of nodes tends to infinity.