Majority model on random regular graphs

From MaRDI portal



Abstract: Consider a graph G=(V,E) and an initial random coloring where each vertex vinV is blue with probability Pb and red otherwise, independently from all other vertices. In each round, all vertices simultaneously switch their color to the most frequent color in their neighborhood and in case of a tie, a vertex keeps its current color. The main goal of the present paper is to analyze the behavior of this basic and natural process on the random d-regular graph mathbbGn,d. It is shown that for all epsilon>0, Pble1/2−epsilon results in final complete occupancy by red in mathcalO(logdlogn) rounds with high probability, provided that dgeqc/epsilon2 for a suitable constant c. Furthermore, we show that with high probability, mathbbGn,d is immune; i.e., the smallest dynamic monopoly is of linear size. A dynamic monopoly is a subset of vertices that can take over in the sense that a commonly chosen initial color eventually spreads throughout the whole graph, irrespective of the colors of other vertices. This answers an open question of Peleg.





Cited in
(30)








This page was built for publication: Majority model on random regular graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2294715)