网络的熵动力学
Entropic Dynamics of Networks
摘要：
在这里，我们提出了网络的熵动力学形式主义。也就是说，一个框架的动态图的意思是代表一个网络的最大熵和过渡率的原则得到考虑到自然的信息几何的概率分布。我们应用这个框架的吉布斯分布的随机图上的节点连接的约束。计算了该图系综的信息几何，并将动力学过程作为扩散方程得到。我们将这种动态的稳定状态与现实网络中的度分布进行了比较。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
