A Maximum Entropy Method for the Prediction of Size Distributions
arXiv:1811.04972 · doi:10.3390/e22030312
Abstract
We propose a method to derive the stationary size distributions of a system, and the degree distributions of networks, using maximisation of the Gibbs-Shannon entropy. We apply this to a preferential attachment-type algorithm for systems of constant size, which contains exit of balls and urns (or nodes and edges for the network case). Knowing mean size (degree) and turnover rate, the power law exponent and exponential cutoff can be derived. Our results are confirmed by simulations and by computation of exact probabilities. We also apply this entropy method to reproduce existing results like the Maxwell-Boltzmann distribution for the velocity of gas particles, the Barabasi-Albert model and multiplicative noise systems.
arXiv comment6 figures
References in corpus (18)
- Emergence of scaling in random networks
- Power laws, Pareto distributions and Zipf's law
- Scale-free brain functional networks
- Scale-free topology of e-mail networks
- Scaling Behaviour of Developing and Decaying Networks
- Interacting Individuals Leading to Zipf's Law
- The Growth of Business Firms: Theoretical Framework and Empirical Evidence
- Exact solutions for models of evolving networks with addition and deletion of nodes
- Power-law tails from multiplicative noise
- Scale-Free and Stable Structures in Complex {\em Ad hoc} networks
- Scaling laws in the dynamics of crime growth rate
- Dense Power-law Networks and Simplicial Complexes
- The configuration model for Barabasi-Albert networks
- Generalised central limit theorems for growth rate distribution of complex systems
- The Bass diffusion model on finite Barabasi-Albert networks
- Fat-tailed fluctuations in the size of organizations: the role of social influence
- A Model for Scaling in Firms' Size and Growth Rate Distribution
- Spectral similarity for Barabási-Albert and Chung-Lu models