An Information Theory Approach to Network Evolution Models

A novel Markovian network evolution model is introduced and analysed by means of information theory. It will be proved that the model, called network evolution chain, is a stationary and ergodic stochastic process. Therefore, the asymptotic equipartition property can be applied to it. The model’s entropy rate and typical sequences are also explored. Extracting particular information from the network and methods to simulate network evolution in the continuous time domain are discussed. Additionally, the Erdős–Rényi network evolution chain is introduced as a subset of our model with the additional property of its stationary distribution matching the Erdős–Rényi random graph model. The stationary distributions of nodes and graphs are calculated for this subset alongside its entropy rate. The simulation results at the end of the article back up the proved theorems and calculated values.