|
Abstract |
In this talk, I will overview the general flavor for the topic of “combinatorial statistics”, and I will describe some recent progress on shotgun assembling problems as well as random graph matching problems. Through these examples, I wish to convey the flavor of the topic of combinatorial statistics, and why it calls for joint efforts from statisticians, probabilists, computer scientists and researchers from applied sciences. The talk is based on recent joint works in various combinations with undergraduate students Hang Du, Haoyu Liu and Zhangsong Li, as well as graduate students Shuyang Gong, Heng Ma and Yiyang Jiang from Peking University. |
|
Affiliation |
Jian Ding is Chair Professor at Peking University. His main research area is in probability theory, with focus on interactions with statistical physics and theoretical computer science. He also has a broad interest in probability questions that arise from "application-oriented" problems. Before joining PKU, he has been a postdoc at Stanford and a faculty member at University of Chicago as well as University of Pennsylvania, after his Ph.D. at UC Berkeley in 2011. |
