Title   name
2018 Discrete Math 세미나
  Speaker   Eric Vigoda    
  Date 2018-06-11
  Place KAIST
  File  의 1 번째 Real Media 동영상입니다.
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.