COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. |

## Local graph coloringAdd to your list(s) Download to your calendar using vCal - Holroyd, AE (Microsoft Research)
- Tuesday 17 March 2015, 15:30-16:30
- Seminar Room 1, Newton Institute.
If you have a question about this talk, please contact Mustapha Amrani. Random Geometry Co-authors: Oded Schramm (), David B Wilson () How can we color the vertices of a graph by a local rule based on i.i.d. vertex labels? More precisely, suppose that the color of vertex v is determined by examining the labels within a finite (but perhaps random and unbounded) distance R of v, with the same rule applied at each vertex. (The coloring is then said to be a finitary factor of the i.i.d. labels). Focusing on Z^d, we investigate what can be said about the random variable R if the coloring is required to be proper, i.e. if adjacent vertices must have different colors. Depending on the dimension and the number of colors, the optimal tail decay is either a power law, or a tower of exponentials. I will briefly discuss generalizations to shifts of finite type and finitely dependent processes. This talk is part of the Isaac Newton Institute Seminar Series series. ## This talk is included in these lists:- All CMS events
- Featured lists
- INI info aggregator
- Isaac Newton Institute Seminar Series
- School of Physical Sciences
- Seminar Room 1, Newton Institute
- bld31
Note that ex-directory lists are not shown. |
## Other listsGates Conversation Summer Hebrew Ulpan Anatomy Revision Type the title of a new list here Cambridge Infectious Diseases Qatar Carbonates and Carbon Storage Research Centre: Status update after three years of fundamental research## Other talksOn being a "barang": Experiences of interviewing fishermen in Cambodia and Indonesia How archaeologists resolve the inductive risk argument RA250 at the Fitz: academicians celebrating 250 years of the Royal Academy Simulating wave propagation in elastic systems using the Finite-Difference-Time-Domain method Paracelsus' Chickens - Strange Tales from the History of Chemistry SciBarHealth: Heart Month |