Christian Borgs is the 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 BuressurYvettes, and the MaxPlanckInstitute 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 cofound the Theory Group. He was a manager of the Theory group until 2008, when he cofounded Microsoft Research New England.
Christian Borgs is well known for his work on the mathematical theory of firstorder phase transitions and finitesize effects, for which he won the 1993 KarlScheel 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 selforganized networks (such as the Internet, the World Wide Web and social networks), as well as the analysis of processes and algorithms on networks. His current interests include the following areas:

His most recent research includes game theoretic models of online social networks, the development of pricing algorithms to incentivize energy conservation in cloud computing, the analysis of local graph algorithms, and the development of methods to reconstruct gene regulatory networks in order to find potential drug targets for cancer treatment. On the more mathematical side, he has been one of the founders of the area of convergent graphs sequences, a field which characterizes the properties of sequences of growing networks and studies the properties of their limiting structures.
Christian Borgs has authored about 120 research papers and is named as an inventor on a litle over 30 patents. Among the honors he has received are a scholarship from the German National Merit Foundation, the above mentioned KarlScheel 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 longterm 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), and the governing board of the Institute for Mathematics and its Applications. He 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 scalefree graphs (with B. Bollobas, J. T. Chayes and O. Riordan) Proceedings of the 14th Annual ACMSIAM Symposium on Discrete Algorithms (SODA), 132139 (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), 725738, 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), 783787 (2004).  
Newsgroup cluster data referred to in the above paper.  
Competitioninduced 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), 208221, Lecture Notes in Computer Science 3142 (2004).  
Degree distribution of competitioninduced preferential attachment graphs (with N. Berger, J. T. Chayes, R. D'Souza and R. D. Kleinberg) Combinatorics, Probability and Computing 14, 697721 (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, 61126117 (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), 135144 (2007). 
On the spread of viruses on the Internet (with N. Berger, J. T. Chayes and A. Saberi) Proceedings of the 16th ACMSIAM Symposium on Discrete Algorithm (SODA), 301310 (2005).  
Local computation of pagerank contributions (with R. Andersen, , J. T. Chayes., J. Hopcroft, V. Mirrokni and S. Teng) Proceedings of the 5th Workshop on Algorithms and Models for the Web Graph (WAW), 150165 (2007).  
Robust PageRank and locally computable spam detection features (with R. Andersen, J. T. Chayes, J. E. Hopcroft, K. Jain, V.S. Mirrokni and S.H. Teng) AIRWeb 2008, 6976 (2008).  
On the stability of web crawling and web search (with R. Andersen, J. T. Chayes, J. E. Hopcroft, V.S. Mirrokni and S.H. Teng) ISAAC 2008, 680691 (2008).  
How to distribute antidote to control epidemics (with J. T. Chayes, A. Ganesh, and A. Saberi) Random Struct. Algorithms 37, 204222 (2010).  
We know who you followed last summer: inferring social link creation times in twitter (with B. Meeder, B. Karrer, A. Sayedi, R. Ravi and J.T. Chayes) Proceedings of the 20th International World Wide Web Conference (WWW), 517526 (2011).  
A sublinear time algorithm for PageRank computations (with M. Brautbar, J.T. Chayes and S.H. Teng) Proceedings of the 9th Workshop on Algorithms and Models for the Web Graph (WAW), 4153 (2012).  
The power of local information in social networks (with M. Brautbar, J. Chayes, S. Khanna, B. Lucier) Proceedings of the 8th International Workshop on Internet and Network Economics (WINE), 406  419 (2012).  
Finding endogenously formed communities (with M.F. Balcan, M. Braverman, J.T. Chayes and S.H. Teng) 24th Annual ACMSIAM Symposium on Discrete Algorithm (SODA), 767783 (2013).  
MultiScale Matrix Sampling and SublinearTime PageRank (with M. Brautbar, J.T. Chayes and S.H. Teng) to appear in Internet Mathematics, http://dx.doi.org/10.1080/15427951.2013.802752 (2013).  
Maximizing social influence in nearly optimal time (with M. Brautbar, J. Chayes and B. Lucier) Proceedings of the 25nd Annual ACMSIAM Symposium on Discrete Algorithm (SODA), 946957 (2014). 
Multiunit auctions with budgetconstrained bidders (with J. T. Chayes, N. Immorlica, M. Mahdian and A. Saberi) Proceedings of the 6th ACM Conference on Electronic Commerce (EC), 4451 (2005).  
Bid optimization in online advertisement auctions (with J. T. Chayes, O. Etesami, N. Immorlica and M. Mahdian) 2^{nd} Workshop on Sponsored Search Auctions (2006) and Proceedings of the 16th international conference on World Wide Web (WWW), 531540 (2007).  
The myth of the folk theorem (with J. T. Chayes, N. Immorlica, A. Kalai, V. Mirrokni and C. Papadimitriou) Proceedings of the 40st Annual ACM Symposium on the Theory of Computing (STOC) , 365372 (2008).  
Trustbased recommendation systems: An axiomatic approach (with R. Andersen, J. T. Chayes, U.Feige, A. Flaxman, A. Kalai, V. Mirrokni and M. Tennenholtz) Proceedings of the 17th international conference on World Wide Web (WWW), 199208 (2008).  
A novel approach to propagating distrust (with J. T. Chayes, A. Kalai, A. Malekiany, M. Tennenholtz) Proceedings of the 6th International Workshop on Internet and Network Economics (WINE) 87105 (2010).  
Gametheoretic models of information overload in social networks (with J. T. Chayes, B. Karrer, B. Meeder, R. Ravi, R. Reagans and A. Sayedi) Proceedings of the 7th Workshop on Algorithms and Models for the Web Graph (WAW) 146  161 (2010).  
Fast convergence of natural bargaining dynamics in exchange networks (with Y. Kanoria, M. Bayati, J. T. Chayes, and A. Montanari) Proceedings of the 22nd Annual ACMSIAM Symposium on Discrete Algorithm (SODA), 15181537 (2011).  
The hitchhiker's guide to affiliation networks: A gametheoretic approach (with J. T. Chayes, J. Ding and B. Lucier) Proceedings of the 2nd Symposium on Innovations in Computer Science (ICS), 389400 (2011).  
Pricing and queuing (with J.T. Chayes, S. Doroudi, M. HarcholBalter, K. Xu) ACM SIGMETRICS Performance Evaluation Review 40(3): 7173 (2012).  
Optimal multiperiod pricing with service guarantees (with O. Candogan, J.T. Chayes, I. Lobel, and H. Nazerzadeh), to appear in Management Science, http://dx.doi.org/10.1287/mnsc.2013.1839 (2013).  
Priority pricing in queues with a continuous distribution of customer valuations (S. Doroudi, M. Akan, M. HarcholBalter, J. Karp, C. Borgs, J.T. Chayes) Preprint 2013.  
The optimal admission threshold in observable queues with state dependent pricing (with J.T. Chayes, S. Doroudi, M. HarcholBalter, K. Xu) Probability in the Engineering and Informational Sciences 28, 101110 (2014).  
Bargaining dynamics in exchange networks (with M. Bayati, J.T. Chayes, Y. Kanoria and A. Montanari), to appear in J. Econ. Theory, http://dx.doi.org/10.1016/j.jet.2014.02.007, (2014). 