Cookie Setting MathNet Korea

이전페이지 이동
Learning a graph via random colorings
[2018 Discrete Math 세미나]
Date: 2018-06-11
Speaker : Eric Vigoda (Georgia Institute of Technology)
Abstract : For an unknown graph G on n vertices, given random k-colorings of G, can one learn the edges of G? We present results on identifiability/non-identifiability of the graph G and efficient algorithms for learning G. The results have interesting connections to statistical physics phase transitions. This is joint work with Antonio Blanca, Zongchen Chen, and Daniel Stefankovic.
Information Center for Mathematical Sciences KAIST
34141 대전광역시 유성구 대학로 291 (구성동373-1)
한국과학기술원(KAIST) 수리과학정보센터
전화 042-350-8196
e-mail :
Copyright (C) 2018. ICMS All Rights Reserved.