Building and Analyzing Network Models

Building and Analyzing Network Models

Researchers have found that disparate networks, arising in nature or society, share numerous properties. Since the first properties were found in the late 1990s, a considerable body of work has been devoted to designing models of networks expressing given properties that are tunable by the user. Our contributions in this area were twofold. First, we analyzed existing models to better understand their key characteristics. In particular, we proved close-forms formulas for the average path length in deterministic and stochastic networks (Giabbanelli et al, 2010; Giabbanelli et al, 2011). Second, we designed a new model for complex networks, which considerably generalized previous fractal models. This was important because properties demonstrated on this general model would then apply to all sub-models, thus avoiding the need to demonstrate the same aspect many times (Giabbanelli 2011). As this Alcatel-funded project came to an end, we concluded by showing how complex network models were relevant for the design of backbone networks (Giabbanelli 2010).

Key references:

  • Giabbanelli, P.J., Mazauric, D., Perennes, S. (2010) Computing the average path length and a label-based routing in a small-world graph. In Proceedings of the 12th AlgoTel.
  • Giabbanelli, P.J. (2010) Impact of complex network properties on routing in backbone networks. In Proceedings of IEEE GLOBECOM, 389-393.
  • Giabbanelli, P.J., Mazauric, D., Bermond, J-C (2011) On the average path length of deterministic and stochastics recursive networks. Complex Networks, 1-12.
  • Giabbanelli, P.J. (2011) The small-world property in networks growing by active edges. Advances in Complex Systems, 14(6), 853-869.

Key collaborators:

  • Dr. Dorian Mazauric, INRIA, France
  • Dr. Jean-Claude Bermond, CNRS, France