Sparsity of weighted networks: measures and applications
Swati Goswami, Asit K. Das, Subhas C. Nandy

TL;DR
This paper introduces a sparsity index for weighted networks that characterizes their structural diversity, analyzes its properties, and demonstrates its application in community detection with validated results on real and artificial networks.
Contribution
It develops a novel sparsity measure for weighted networks, derives its properties analytically, and applies it effectively to community detection tasks.
Findings
Sparsity index ranges are analytically derived for connected networks.
Edge-weight distribution impacts the sparsity index bounds.
Application in community detection shows improved network analysis.
Abstract
A majority of real life networks are weighted and sparse. The present article aims at characterization of weighted networks based on sparsity, as a measure of inherent diversity, of different network parameters. It utilizes sparsity index defined on ordered degree sequence of simple networks and derives further properties of this index. The range of possible values of sparsity index of any connected network, with edge-count in specific intervals, is worked out analytically in terms of node-count; a pattern is uncovered in corresponding degree sequences to produce highest sparsities. Given the edge-weight frequency distribution of a network, we have formulated an expression of the sparsity index of edge-weights. Its properties are analyzed under different distributions of edge-weights. For example, the upper and lower bounds of sparsity index of edge-weights of a network, having all…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
