Entropic Dynamics of Networks
arXiv:2102.02355 · doi:10.22191/nejcs/vol3/iss1/5
Abstract
Here we present the entropic dynamics formalism for networks. That is, a framework for the dynamics of graphs meant to represent a network derived from the principle of maximum entropy and the rate of transition is obtained taking into account the natural information geometry of probability distributions. We apply this framework to the Gibbs distribution of random graphs obtained with constraints on the node connectivity. The information geometry for this graph ensemble is calculated and the dynamical process is obtained as a diffusion equation. We compare the steady state of this dynamics to degree distributions found on real-world networks.
References in corpus (8)
- Entropy measures for complex networks: Toward an information theory of complex topologies
- An elementary introduction to information geometry
- The Shannon and the Von Neumann entropy of random networks with heterogeneous expected degree
- Nonadditive Entropies Yield Probability Distributions with Biases not Warranted by the Data
- Moral foundations in an interacting neural networks society
- Entropic Dynamics: Reconstructing Quantum Field Theory in Curved Space-time
- Bayesian sparse reconstruction: a brute-force approach to astronomical imaging and machine learning
- Riemannian-geometric entropy for measuring network complexity