Algorithm Design and Analysis for Implicitly and Incompletely Defined Interaction Networks – ALADDIN

This project deals with the fundamental aspects of interaction networks, including communication networks, social networks, biological networks, etc. The project is mostly oriented towards the design and analysis of algorithms dedicated to these (logical) networks, by taking into account properties inherent to the underlying infrastructures upon which they are built. The infrastructures and/or overlays considered in this project are selected from different contexts, including communication networks (from Internet to sensor networks), and social networks (from the Web to P2P networks). The algorithms will be based on qualitative properties, considered from the nature and/or functionality of the networks, such as bounded growth rate, low doubling dimension, minor excluding, or hyperbolic metrics. The project will tackle some network problems in contexts in which the network is only implicitly and/or partially known. This project is therefore aiming at participating to the establishment of the fundamental bases of the interaction networks, in connection with what is currently investigated in the field of complex networks, and in complement with what is currently done by several communities such as physicists (statistical physics) and network engineering (metrology).