Large graphs and networks

Faculty members: Pierre-Antoine Absil, Vincent Blondel, Jean-Charles Delvenne, Julien Hendrickx, Paul Van Dooren, Yurii Nesterov

Graduate students and post-doctorates :
Pierre Borckmans, Arnaud Browet, Thomas Cason, Chia-Tche Chang, Etienne Huens, Raphaël Jungers, Gautier Krings, Quentin Rentmeesters.

Description :
We look at some of the most recent and fundamental computational challenges raised by large networks. We concentrate our research activity on questions related to the classification, equilibria calculation, visualization, and stochastic analysis of large networks. We address both theoretical and practical aspects of topics such as data-mining, web-searching, analysis of telephone, traffic and electricity networks, hierarchical reduction of large scale networks, and analysis of dynamical properties of large networks.

Links :
Research group homepage : http://www.inma.ucl.ac.be/networks/
Weekly seminar : http://www.inma.ucl.ac.be/networks/news.php?lng=en
Dynamo cost research action: http://www.lri.fr/~pierre/COST/dynamo.html

Publications : here

Research grants :

  • Research contract with the telecommunication company Mobistar, June 2003-June 2004.
  • Action de Recherche Concertée (ARC) on « Algorithmic challenges in large networks », 04/09-315, September 2004 – September 2009.
  • COST research action 295, DYNAMO: Dynamic Communication Networks: Foundations and Algorithms.

 

| 6/10/2010 |