Growing Attributed Networks through Local Processes release_hpwchrand5fr3linx6fwp332ay

by Harshay Shah, Suhansanu Kumar, Hari Sundaram

Released as a article .

2018  

Abstract

This paper proposes an attributed network growth model. Despite the knowledge that individuals use limited resources to form connections to similar others, we lack an understanding of how local and resource-constrained mechanisms explain the emergence of rich structural properties found in real-world networks. We make three contributions. First, we propose a parsimonious and accurate model of attributed network growth that jointly explains the emergence of in-degree distributions, local clustering, clustering-degree relationship and attribute mixing patterns. Second, our model is based on biased random walks and uses local processes to form edges without recourse to global network information. Third, we account for multiple sociological phenomena: bounded rationality, structural constraints, triadic closure, attribute homophily, and preferential attachment. Our experiments indicate that the proposed Attributed Random Walk (ARW) model accurately preserves network structure and attribute mixing patterns of six real-world networks; it improves upon the performance of eight state-of-the-art models by a statistically significant margin of 2.5-10x.
In text/plain format

Archived Files and Locations

application/pdf  3.5 MB
file_mmqsscvq55d5rhg2ubf3estwuq
arxiv.org (repository)
web.archive.org (webarchive)
Read Archived PDF
Preserved and Accessible
Type  article
Stage   submitted
Date   2018-12-09
Version   v3
Language   en ?
arXiv  1712.10195v3
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: df467e61-274d-4c9b-ae8d-bc691a8861f5
API URL: JSON