Christian Borgs is co-founder and deputy managing director of Microsoft Research New England in Cambridge, Massachusetts.
He studied physics at the University of Munich, the University Pierre et Marie Curie in Paris, the Institut des Hautes Etudes in Bures-sur-Yvettes, and the Max-Planck-Institute for Physics in Munich. He received his Ph.D. in mathematical physics from the University of Munich, held a postdoctoral fellowship at the ETH Zurich, and received his Habilitation in mathematical physics from the Free University in Berlin. After his Habilitation he became the C4 Chair for Statistical Mechanics at the University of Leipzig, and in 1997 he joined Microsoft Research to co-found the Theory Group. He was a manager of the Theory group until 2008, when he co-founded Microsoft Research New England.
Christian Borgs is well known for his work on the mathematical theory of first-order phase transitions and finite-size effects, for which he won the 1993 Karl-Scheel Prize of the German Physical Society. Since joining Microsoft, Christian Borgs has become one of the world leaders in the study in phase transitions in combinatorial optimization, and more generally, the use of methods from statistical physics and probability theory in problems of interest to computer science and technology. He is one of the top researchers in the modeling and analysis of self-organized networks (such as the Internet, the World Wide Web and social networks), as well as the analysis of processes and algorithms on networks.
His recent research includes the analysis of local graph algorithms, game theoretic models of online social networks, and the development of methods to reconstruct gene regulatory networks for cancer. He is one of the inventors of the field of limits of graph sequences (graphons), which are now being used in the machine learning of non-parametric models for large sparse networks, as well as the development of recommendation systems when the matrix of known recommendations is very sparse. He has also started to work on privacy, as well as fairness and accountability in machinge learning.
Christian Borgs has authored almost 140 research papers and is named as coinventor of over 30 patents. Among the honors he has received are a scholarship from the German National Merit Foundation, the above mentioned Karl-Scheel Prize, and the Heisenberg Fellowship of the German Research Council. He has been invited by the Conference Board of Mathematical Sciences (CBMS) to give a lecture series on "Statistical Physics Expansion Methods in Combinatorics and Computer Sciences." He has been a long-term visitor at Princeton, Harvard, and UCLA, and has twice been a member of the Institute for Advanced Study in Princeton. Among the boards and councils on which he has served or is still serving are the Council of the University of Leipzig, the Editorial Boards of the Journal of Statistical Physics, the SIAM Journal on Discrete Mathematics, the Journal of Statistical Mechanics, the Annales de l'Institut Henri Poincaré D , the Board of Trustees of the Institute for Pure and Applied Mathematics (IPAM), the Governing Board of the Institute for Mathematics and its Applications (IMA), the Adivosry Board of the Harvard Insitute for Applied Computer Science (IACS) and the External Advisory Board for Computing at NYU. He has been chair of Board of Governors of the IMA from 2017-2018, and is currently past chair of that board. Christian Borgs is a Fellow of the American Mathematical Society, and the Association of the Advancement of Science.
Christian Borgs is married to Jennifer Chayes, who is also at Microsoft Research, and with whom he collaborates on most of his scientific work. In his rare spare time, he enjoys art, theatre and classical music, as well as skiing and swimming.
Directed scale-free graphs (with B. Bollobas, J. T. Chayes and O. Riordan). Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 132-139 (2003). | |
Degree distribution of the FKP network model (with N. Berger, B. Bollobas, J. T. Chayes and O. Riordan). Proceedings of the 30th International Colloquium on Automata, Languages and Programming (ICALP), 725-738, Lecture Notes in Computer Science 2719 (2003). | |
Exploring the community structure of newsgroups (with J. T. Chayes, M. Mahdian and A. Saberi). Proceedings of the 10th ACM SIGKDD International Conference on Knowledge, Discovery and Data Mining (KKD), 783-787 (2004). | |
Newsgroup cluster data referred to in the above paper. | |
Competition-induced preferential attachment (with N. Berger, J. T. Chayes, R. D'Souza and R. D. Kleinberg). Proceedings of the 31st International Colloquium on Automata, Languages and Programming (ICALP), 208-221, Lecture Notes in Computer Science 3142 (2004). | |
Degree distribution of competition-induced preferential attachment graphs (with N. Berger, J. T. Chayes, R. D'Souza and R. D. Kleinberg). Combinatorics, Probability and Computing 14, 697-721 (2005). | |
Emergence of tempered preferential attachment from optimization (with N. Berger, J. T. Chayes, R. D'Souza and R. D. Kleinberg). Proceedings of the National Academy of Sciences (PNAS) 104, 6112-6117 (2007), cover article. | |
Fitting the WHOIS Internet data A short note with technical details left out in the above paper. | |
First to market is not everything: an analysis of preferential attachment with fitness (with J. T. Chayes, C. Daskalakis and S.Roch). Proceedings of the 39rd annual ACM Symposium on the Theory of Computing (STOC), 135-144 (2007). |