报告题目：The naming game on the complete graph
报告人：Dr Eric Foxall （University of Alberta）
报告摘要：We consider a model of language development, known as the naming game, in which agents invent, share and then select descriptive words for a single object, in such a way as to promote local consensus. When formulated on a finite and connected graph, a global consensus eventually emerges in which all agents use a common unique word. Previous numerical studies of the model on the complete graph with agents suggest that when no words initially exist, the time to consensus is of order , assuming each agent speaks at a constant rate. We show rigorously that the time to consensus is at least , and that it is at most constant times when only two words remain. In order to do so we develop some useful estimates for semimartingales with bounded jumps.
报告人简介：Professor Eric Foxall got his bachelor’s degree from University of British Columbia (UBC) and majored in engineering physics. Then he majored in applied mathematics in University of Victoria and got his master degree and PHD. Then he continued his postdoctoral research in Arizona State University (ASU). After that, within the next two years, he worked in University of Albert. From this year he will continue to work in UBC Okanagan. Eric’s research interest is stochastic processes and modeling of interacting populations. He has published a series of high-quality papers, many of which were published in top journals such as Nature Communications, Journal of Mathematical Biology et al.