Research on large graphs and networks is conducted by 11 professors and about 30 PhD students and postdocs.
Principal Investigators :
Research Labs :
Research Areas :
We look at some of the most recent and fundamental computational challenges raised by large networks. We study questions related to the classification, equilibria calculation, visualization, hierarchical reduction, analysis of dynamical properties and stochastic analysis of large networks. We also develop new analysis techniques allowing to extract useful information from graphs and networks, for example by detecting tightly connected groups within the network, finding the most prestigious nodes, categorizing unlabeled nodes thanks to some labeled ones, computing similarities between nodes, etc.
Applications include topics such as data-mining of text documents, web-searching, analysis of telephone, traffic and electricity networks. The Internet, the largest deployed network today, is of particular interest. Measurement and modeling tools and techniques that we develop allow us to obtain more accurate information about its organization (interconnections between Internet Service Providers, network topologies, ...) and to build realistic models of computer networks. We are using these tools and models to better understand the structure of the Internet, and also to evaluate the performance of new networking protocols.
Most recent publications
Below are listed the 10 most recent journal articles and conference papers produced in this research area. You also can access all publications by following this link : see all publications.