On Dissemination Thresholds in Regular and Irregular Graph Classes

Ivan Rapaport (1) , Karol Suchan (2) , Ioan Todinca (2) , Jacques Verstraëte

1 DIM - Departamento de Ingeniería Matemática [Santiago]
2 LIFO - Laboratoire d'Informatique Fondamentale d'Orléans

We investigate the natural situation of the dissemination of information on various graph classes starting with a random set of informed vertices called active. Initially active vertices are chosen independently with probability p, and at any stage in the process, a vertex becomes active if the majority of its neighbours are active, and thereafter never changes its state. We show that in any cubic graph, with high probability, the information will not spread to all vertices in the graph if p<1/2. We give families of graphs in which information spreads to all vertices with high probability for relatively small values of p.

Mots clés: bootstrap percolation; information dissemination; cubic graphs

Domaines: Algorithme et structure de données [cs.DS]

Ivan Rapaport, Karol Suchan, Ioan Todinca, Jacques Verstraëte. On Dissemination Thresholds in Regular and Irregular Graph Classes. LATIN 2008: Theoretical Informatics, Apr 2008, Buzios, Brazil. pp.24-35, ⟨10.1007/978-3-540-78773-0_3⟩. ⟨hal-00462308⟩