具有层次约束拓扑结构的复杂网络的熵
Entropies of complex networks with hierarchically constrained topologies
摘要：
在稀疏随机网络系综中，层次网络拓扑的熵是给定网络拓扑出现在所选系综中的对数似然，本文给出了这种熵的一般公式，在一些简单的极限情况下，它有一个清晰而简单的解释。结果提供了新的钥匙，以解决“拟合”一个给定的网络与一个适当的合奏随机网络的一般问题。
英文摘要：
The entropy of a hierarchical network topology in an ensemble of sparse random networks with "hidden variables" associated to its nodes, is the log-likelihood that a given network topology is present in the chosen ensemble.We obtain a general formula for this entropy,which has a clear simple interpretation in some simple limiting cases. The results provide new keys with which to solve the general problem of "fitting" a given network with an appropriate ensemble of random networks.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
