Opinion Forming in Erdos-Renyi Random Graph and Expanders

05/28/2018
by   Ahad N. Zehmakan, et al.
0

Assume for a graph G=(V,E) and an initial configuration, where each node is blue or red, in each discrete-time round all nodes simultaneously update their color to the most frequent color in their neighborhood and a node keeps its color in case of a tie. We study the behavior of this basic process, which is called majority model, on the binomial random graph G_n,p and regular expanders. First we consider the behavior of the majority model in G_n,p with an initial random configuration, where each node is blue independently with probability p_b and red otherwise. It is shown that in this setting the process goes through a phase transition at the connectivity threshold, namely n/n. Furthermore, we discuss the majority model is a `good' and `fast' density classifier on regular expanders. More precisely, we prove if the second-largest absolute eigenvalue of the adjacency matrix of an n-node Δ-regular graph is sufficiently smaller than Δ then the majority model by starting from (1/2-δ)n blue nodes (for an arbitrarily small constant δ>0) results in fully red configuration in sub-logarithmically many rounds. As a by-product of our results, we show Ramanujan graphs are asymptotically optimally immune, that is for an n-node Δ-regular Ramanujan graph if the initial number of blue nodes is s≤β n, the number of blue nodes in the next round is at most cs/Δ for some constants c,β>0. This settles an open problem by Peleg.

READ FULL TEXT
research
05/28/2018

Opinion Forming in Binomial Random Graph and Expanders

Assume for a graph G=(V,E) and an initial configuration, where each node...
research
05/08/2019

Target Set in Threshold Models

Consider a graph G and an initial coloring, where each node is blue or r...
research
02/14/2023

Random Majority Opinion Diffusion: Stabilization Time, Absorbing States, and Influential Nodes

Consider a graph G with n nodes and m edges, which represents a social n...
research
11/24/2017

(Biased) Majority Rule Cellular Automata

Consider a graph G=(V,E) and a random initial vertex-coloring, where eac...
research
11/30/2022

Distributed Averaging in Population Protocols

We consider two simple asynchronous opinion dynamics on arbitrary graphs...
research
07/05/2021

Stabilization Bounds for Influence Propagation from a Random Initial State

We study the stabilization time of two common types of influence propaga...
research
02/28/2021

A Central Limit Theorem for Diffusion in Sparse Random Graphs

We consider bootstrap percolation and diffusion in sparse random graphs ...

Please sign up or login with your details

Forgot password? Click here to reset