## Edge flipping on the complete graph

- March 18, 2016
- 2:30 p.m.
- LeConte 312

## Abstract

Given a graph with vertices colored red and blue we can consider the following process on the state graph of all possible colorings: Pick an edge of the graph and with probability $p$ color both of its vertices blue, otherwise with probability $1-p$ color both of its vertices red. We will talk about the stationary distribution of this process, including alternative ways to determine this, and in particular give results for the complete graph.

This is joint work with Fan Chung, Jay Cummings and Ron Graham.