arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1612.07074cs.DMcs.SIphysics.soc-ph
收藏

网络图的稀疏性度量:基尼指数

Sparsity Measure of a Network Graph: Gini Index

Swati Goswami, C. A. Murthy, Asit K. Das

摘要:

本文研究了一种流行的稀疏性度量方法--基尼指数在网络图上的应用。各种各样的网络图碰巧是稀疏的。但在网络图中通常用来衡量稀疏性的指标是边密度,它反映了图中所有节点的度之和与对应的全连通图中所有可能度之和的比例。因此,边缘密度是一个简单的比率,并带有限制,主要是在其定义中考虑的信息量方面。在本文中,我们提供了一个公式来定义网络图的稀疏性,通过推广基尼指数的概念,并称之为稀疏指数。六处房产中的大多数(即,罗宾汉,缩放,涨潮,克隆,比尔盖茨和婴儿)的稀疏措施通常比较被认为是满意的建议指数。边缘密度和稀疏指数之间的比较已绘制适当的例子,以突出所提出的指数的功效。理论上还表明,对于变化的曲线图,这两种测量遵循类似的趋势,即,随着图的边密度增加,其稀疏性指数减小。此外,本文得出的关系,分析,稀疏指数和幂律分布的指数项之间的关系,分布是已知的近似各种各样的网络图的度分布。最后,文章强调了如何建议的指数与基尼指数可以揭示网络图的重要属性。

英文摘要:

This article examines the application of a popular measure of sparsity, Gini Index, on network graphs. A wide variety of network graphs happen to be sparse. But the index with which sparsity is commonly measured in network graphs is edge density, reflecting the proportion of the sum of the degrees of all nodes in the graph compared to the total possible degrees in the corresponding fully connected graph. Thus edge density is a simple ratio and carries limitations, primarily in terms of the amount of information it takes into account in its definition. In this paper, we have provided a formulation for defining sparsity of a network graph by generalizing the concept of Gini Index and call it sparsity index. A majority of the six properties (viz., Robin Hood, Scaling, Rising Tide, Cloning, Bill Gates and Babies) with which sparsity measures are commonly compared are seen to be satisfied by the proposed index. A comparison between edge density and the sparsity index has been drawn with appropriate examples to highlight the efficacy of the proposed index. It has also been shown theoretically that the two measures follow similar trend for a changing graph, i.e., as the edge density of a graph increases its sparsity index decreases. Additionally, the paper draws a relationship, analytically, between the sparsity index and the exponent term of a power law distribution, a distribution which is known to approximate the degree distribution of a wide variety of network graphs. Finally, the article highlights how the proposed index together with Gini index can reveal important properties of a network graph.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑