Open Access. Powered by Scholars. Published by Universities.®

Mathematics Commons

Open Access. Powered by Scholars. Published by Universities.®

Articles 1 - 2 of 2

Full-Text Articles in Mathematics

Entropic Dynamics Of Networks, Felipe Xavier Costa, Pedro Pessoa Mar 2021

Entropic Dynamics Of Networks, Felipe Xavier Costa, Pedro Pessoa

Northeast Journal of Complex Systems (NEJCS)

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.


Complexity Reduction In State-Based Modeling, Martin Zwick Oct 1998

Complexity Reduction In State-Based Modeling, Martin Zwick

Systems Science Faculty Publications and Presentations

For a system described by a relation among qualitative variables (or quantitative variables "binned" into symbolic states), expressed either set-theoretically or as a multivariate joint probability distribution, complexity reduction (compression of representation) is normally achieved by modeling the system with projections of the overall relation. To illustrate, if ABCD is a four variable relation, then models ABC:BCD or AB:BC:CD:DA, specified by two triadic or four dyadic relations, respectively, represent simplifications of the ABCD relation. Simplifications which are lossless are always preferred over the original full relation, while simplifications which lose constraint are still preferred if the reduction of complexity more …