Smallest decisive sets in the majority dynamics on graphs
Speaker
Ron Peretz
Date
29/11/2022 - 12:30 - 11:00Add To Calendar
2022-11-29 11:00:00
2022-11-29 12:30:00
Smallest decisive sets in the majority dynamics on graphs
Consider the majority dynamics on a graph. We say that subset of vertices is decisive if setting the opinion of that subset to 1 at every time period leads anyone in the network to adopt opinion 1 eventually. In this preliminary work, we obtain a few bounds on the smallest cardinality of decisive sets in certain families of graphs.
Joint with Itai Arieli, Galit Ashkenazi-Golan, Yevgeny Tsodikovich.
BIU Economics common room
אוניברסיטת בר-אילן - Department of Economics
Economics.Dept@mail.biu.ac.il
Asia/Jerusalem
public
Place
BIU Economics common room
Affiliation
Bar Ilan University
Abstract
Consider the majority dynamics on a graph. We say that subset of vertices is decisive if setting the opinion of that subset to 1 at every time period leads anyone in the network to adopt opinion 1 eventually. In this preliminary work, we obtain a few bounds on the smallest cardinality of decisive sets in certain families of graphs.
Joint with Itai Arieli, Galit Ashkenazi-Golan, Yevgeny Tsodikovich.
Last Updated Date : 27/11/2022
