Department of Computer Science | Institute of Theoretical Computer Science | CADMO

Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar (in cooperation with A. Steger, D. Steurer and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Tuesday, May 17, 2016, 12:15 pm

Duration: 30 minutes

Location: OAT S15/S16/S17

Speaker: Ahad N. Zehmakan

Color War on Grid

You are Given a graph $G(V,E)$ and an initial random vertex-coloring such that each vertex $v\in V$ is blue with probability $p$ and red with probability $1-p$. In each step, all vertices change their current color synchronously to the most frequent color in their neighborhood (in the case of a tie, a vertex conserves its current color). We discuss the asymptotic behavior of this (random) process which is called color war. We mostly focus on grid and torus (probabilistic cellular automata) and, as a main result, show there exits $0 < q < 1$ as a threshold such that if $p \ll q$ a grid (torus) $G(V,E)$ reaches a red generation (all vertices red) in a constant number of steps, but $p \gg q$ results in the coexistence of both colors in a configuration of period one or two in at most $2|V|$ steps. You can also assume in the case of a tie, a vertex flips a coin to choose blue or red. We name this Markov chain random color war, and present also some interesting properties regarding its behavior.

Upcoming talks     |     All previous talks     |     Talks by speaker     |     Upcoming talks in iCal format (beta version!)

Previous talks by year:   2024  2023  2022  2021  2020  2019  2018  2017  2016  2015  2014  2013  2012  2011  2010  2009  2008  2007  2006  2005  2004  2003  2002  2001  2000  1999  1998  1997  1996  

Information for students and suggested topics for student talks

Automatic MiSe System Software Version 1.4803M   |   admin login