Density decompositions of networks
Social and Information Networks
2017-12-18 v3 Data Structures and Algorithms
Physics and Society
Abstract
We introduce a new topological descriptor of a network called the density decomposition which is a partition of the nodes of a network into regions of uniform density. The decomposition we define is unique in the sense that a given network has exactly one density decomposition. The number of nodes in each partition defines a density distribution which we find is measurably similar to the degree distribution of given real networks (social, internet, etc.) and measurably dissimilar in synthetic networks (preferential attachment, small world, etc.).
Keywords
Cite
@article{arxiv.1405.1001,
title = {Density decompositions of networks},
author = {Glencora Borradaile and Theresa Migler and Gordon Wilfong},
journal= {arXiv preprint arXiv:1405.1001},
year = {2017}
}