加权复杂网络中节点间距离的标度
Scaling of internode distances in weighted complex networks
摘要：
我们将先前观察到的连接节点间距离和节点度的标度方程扩展到加权网络的情况。我们表明，标度采取类似的形式，从网络中获得的经验数据，其特征在于节点的强度和它的程度之间的不同关系。在s（k）的显式方程（例如线性或无标度）的情况下，可以容易地获得标度方程的新系数。我们支持我们的分析与数值模拟不同的重量分布的Erdos-Renyi随机图。
英文摘要：
We extend the previously observed scaling equation connecting the internode distances and nodes' degrees onto the case of weighted networks. We show that the scaling takes a similar form in the empirical data obtained from networks characterized by different relations between node's strength and its degree. In the case of explicit equation for s(k) (e.g. linear or scale-free), the new coefficients of scaling equation can be easily obtained. We support our analysis with numerical simulations for Erdos-Renyi random graphs with different weight distributions.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
