利用适应度模型重构复杂网络的拓扑性质
Reconstructing topological properties of complex networks using the fitness model
摘要:
复杂社会经济系统研究中的一个主要问题是隐私问题$-$,它会严重限制可访问信息的数量,迫使在不完整知识的基础上构建模型。本文研究了一种从有限信息出发重构复杂网络全局拓扑性质的新方法。该方法使用节点的固有属性(表示为适应度)的知识,以及仅有限的节点子集的连接数,以生成代表真实系统的指数随机图的集合,并且可以用于估计其拓扑属性。在这里,我们特别关注于重建通常用于描述网络的最基本属性:链接密度,重复性,聚类。我们测试的基准合成网络和真实的经济和金融系统的方法,发现一个显着的鲁棒性相对于用于校准的节点数量。因此,该方法代表了一个有价值的工具,以获得对隐私保护系统的见解。
英文摘要:
A major problem in the study of complex socioeconomic systems is represented by privacy issues$-$that can put severe limitations on the amount of accessible information, forcing to build models on the basis of incomplete knowledge. In this paper we investigate a novel method to reconstruct global topological properties of a complex network starting from limited information. This method uses the knowledge of an intrinsic property of the nodes (indicated as fitness), and the number of connections of only a limited subset of nodes, in order to generate an ensemble of exponential random graphs that are representative of the real systems and that can be used to estimate its topological properties. Here we focus in particular on reconstructing the most basic properties that are commonly used to describe a network: density of links, assortativity, clustering. We test the method on both benchmark synthetic networks and real economic and financial systems, finding a remarkable robustness with respect to the number of nodes used for calibration. The method thus represents a valuable tool for gaining insights on privacy-protected systems.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。