Characterization of Some Dynamic Network Models

Abstract

Dynamic random network models are presented as a mathematical framework for modelling and analyzing the time evolution of complex networks. Such framework allows the time analysis of several network characterizing features such as link density, clustering coefficient, degree distribution, as well as entropy-based complexity measures, providing new insight on the evolution of random networks. Some simple dynamic models are analyzed with the aim to provide several basic reference evolution behaviors. Simulation examples are discussed to illustrate the applicability of the proposed framework.

Keywords

• complex networks
• stochastic modelling
• entropy
• estimation