Vincent Blondel

Vincent D. Blondel
Born (1965-04-28)April 28, 1965
Antwerp, Belgium
Nationality Belgium
Fields Applied mathematics
Discrete mathematics
Institutions Université catholique de Louvain
Massachusetts Institute of Technology
Alma mater Université catholique de Louvain
Imperial College, London
Doctoral advisor Michel Gevers

Vincent D. Blondel (born April 28, 1965) is a Belgian professor of applied mathematics at the Université catholique de Louvain (UCL) and a visiting professor at the Massachusetts Institute of Technology (MIT). Blondel's research lies in the area of mathematical control theory and theoretical computer science. He is mostly known for his contributions in computational complexity in control,[1] multi-agent coordination[2] and complex networks.[3][4]

Education

Blondel studied philosophy, mathematics, engineering and computer science in Louvain-la-Neuve, Grenoble, London and Oxford. He completed a master thesis in engineering at the Institut National Polytechnique de Grenoble, he holds a MSc in mathematics from Imperial College of Science and Technology and a degree in philosophy, a master's degree in engineering (summa cum laude) and a PhD in applied mathematics from Université catholique de Louvain.

Career

In 1993-1994 he was a Göran Gustafsson Fellow at the Royal Institute of Technology (Stockholm) and in 1994-1995 he was a Research Fellow at the National Institute for Research in Computer Science and Control (INRIA) in Paris. From 1995 to 1999 he was an assistant professor at the Institute of Mathematics of the Université de Liège before joining the School of Engineering of the Université catholique de Louvain where he has been since then. He was a research visitor with the Australian National University, the University of California at Berkeley, the Santa Fe Institute, the Mittag-Leffler Institute of the Royal Swedish Academy of Sciences and Harvard University. He was a visiting professor of the Ecole Nationale Supérieure in Lyon in 1998 and at the Université Paris VII - Diderot in 1999, 2000 and 2002. In 2005-2006 he was a visiting professor and a Fulbright scholar with the Department of Electrical Engineering and Computer Science of the Massachusetts Institute of Technology. In 2010-2011 he was a visiting professor with the MIT Laboratory for Information and Decision Systems (LIDS) of the Massachusetts Institute of Technology.

Blondel is a former associate editor of the European Journal of Control (Springer) and of Systems and Control Letters (Elsevier). He is an editor of the journal Mathematics of Control, Signals, and Systems He has published about 100 journal articles and 6 books.

At UCL, Blondel has founded the Group on Large Graphs and Networks. He has supervised 20 doctoral and postdoctoral researchers and 15 visiting professors. He was department head in 2003-2010 and a university president candidate in 2009.

In 2013, Blondel has become the dean of the Louvain School of engenering.

He was elected the Rector of the Université catholique de Louvain for the term 2014-2019.[5]

Honors and awards

Teaching

In 2012, he is in charge of the following courses at Université catholique de Louvain :

The last course is following the online course of M. Chiang from Princeton University : "20Q about networks : Friends, Money and Bytes" [6]

References

  1. ↑ Blondel, V.D; Tsitsiklis, J.N. (2000). Survey of computational complexity results in systems and control. Automatica. 36 (9). pp. 1249–1274. doi:10.1016/S0005-1098(00)00050-9.
  2. ↑ Blondel, V.D; Hendrickx, J.M.; Olshevsky, A.; Tsitsiklis, J.N. (2005). "Convergence in multiagent coordination, consensus, and flocking". 44th IEEE Conference on Decision and Control, 2005 and 2005 European Control Conference. CDC-ECC '05. pp. 2996–3000.
  3. ↑ Blondel, V.D; Guillaume, J.-L.; Lambiotte, R., Lefebvre, E.; (2008). Fast unfolding of communities in large networks. Journal of Statistical Mechanics. P10008 (9). pp. 1742–5468. Cite uses deprecated parameter |coauthors= (help)
  4. ↑ Blondel, V.D; Gajardo, A.; Heymans, M.; Senellart, P.; Van Dooren, P.; (2004). A measure of similarity between graph vertices. With applications to synonym extraction and web searching. SIAM Review. 46 (4). pp. 647–666. Cite uses deprecated parameter |coauthors= (help)
  5. ↑ http://www.vincentblondel.be/
  6. ↑ {https://www.coursera.org/course/friendsmoneybytes}
This article is issued from Wikipedia - version of the 5/11/2016. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.