黑料福利网

is a professor of Computer Science in the Berkeley AI Research Group (BAIR). He is a world-leading researcher at the interface of mathematics, statistical physics, theoretical computer science, and AI for science. He co-invented the field of Graph Limits some 20 years ago and has made profound contributions to it. Graph limits aim to describe large networks, effectively summarizing the global structure of networks, and are widely used in machine learning of networks at scale. This is instrumental for the Internet, the World Wide Web, social and infrastructure networks, and possibly even the brain.

Translating real-world problems

Borgs was nominated for the honorary doctorate by Edwin van den Heuvel, Dean of the Department of Mathematics and Computer Science (M&CS). On behalf of this department, Remco van der Hofstad, professor of Probability, and Nelly Litvak, professor of Algorithms for Complex Networks, are the honorary supervisors. Van der Hofstad explains why Borgs is being awarded an honorary doctorate: 鈥淐hristian excels at translating practical problems, such as those involving networks and recommendation systems, into mathematical models and research questions.鈥�

Profound impact

Van der Hofstad continues: 鈥淗e is also adept at solving those problems. His work has a profound impact on mathematics and across application domains. Christian has played a leading role in connecting industry to academia, particularly as co-founder of two Microsoft Research labs. These labs focus on fundamental research in mathematics, statistical physics, and networks, and their implications for the real world. Further, he has recently helped to create the new field of Generative AI for Materials; his start-up aims to use this to dramatically speed up the synthesis of new materials to address climate change.

Building bridges

Borgs collaborates with 黑料福利网 professors Van der Hofstad and Litvak on a range of topics, including epidemics, fairness, and information diffusion on networks. 鈥淗e builds bridges between different communities within 黑料福利网, from network research at the Department of M&CS, to applications of AI and stochastic modelling at the Institute for Complex Molecular Systems (ICMS),鈥� explains van der Hofstad.

Sign up for Research Day

Borgs will receive his honorary doctorate during 黑料福利网 Research Day on June 23rd, 2026. More information and sign up for Research Day via .