Target Set in Threshold Models

05/08/2019
by   Ahad N. Zehmakan, et al.
0

Consider a graph G and an initial coloring, where each node is blue or red. In each round, all nodes simultaneously update their color based on a predefined rule. In a threshold model, a node becomes blue if a certain number or fraction of its neighbors are blue and red otherwise. What is the minimum number of nodes which must be blue initially so that the whole graph becomes blue eventually? We study this question for graphs which have expansion properties, parameterized by spectral gap, in particular the Erdős-Rényi random graph and random regular graphs.

READ FULL TEXT

page 1

page 2

page 3

page 4

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
07/16/2021

The Paradox of Second-Order Homophily in Networks

Homophily – the tendency of nodes to connect to others of the same type ...
research
05/28/2018

Opinion Forming in Erdos-Renyi Random Graph and Expanders

Assume for a graph G=(V,E) and an initial configuration, where each node...
research
06/03/2020

Spread of Influence in Graphs

Consider a graph G and an initial configuration where each node is black...
research
02/28/2021

A Central Limit Theorem for Diffusion in Sparse Random Graphs

We consider bootstrap percolation and diffusion in sparse random graphs ...
research
02/19/2018

Distributed Recoloring

Given two colorings of a graph, we consider the following problem: can w...
research
10/14/2019

Dynamic Complexity of Parity Exists Queries

Given a graph whose nodes may be coloured red, the parity of the number ...

Please sign up or login with your details

Forgot password? Click here to reset