Link to the University of Pittsburgh Homepage
Link to the University Library System Homepage Link to the Contact Us Form

VA-index: Quantifying assortativity patterns in networks with multidimensional nodal attributes

Pelechrinis, K and Wei, D (2016) VA-index: Quantifying assortativity patterns in networks with multidimensional nodal attributes. PLoS ONE, 11 (1).

[img]
Preview
PDF
Published Version
Available under License : See the attached license file.

Download (2MB)
[img] Plain Text (licence)
Available under License : See the attached license file.

Download (1kB)

Abstract

Network connections have been shown to be correlated with structural or external attributes of the network vertices in a variety of cases. Given the prevalence of this phenomenon network scientists have developed metrics to quantify its extent. In particular, the assortativity coefficient is used to capture the level of correlation between a single-dimensional attribute (categorical or scalar) of the network nodes and the observed connections, i.e., the edges. Nevertheless, in many cases a multi-dimensional, i.e., vector feature of the nodes is of interest. Similar attributes can describe complex behavioral patterns (e.g., mobility) of the network entities. To date little attention has been given to this setting and there has not been a general and formal treatment of this problem. In this study we develop a metric, the vector assortativity index (VA-index for short), based on network randomization and (empirical) statistical hypothesis testing that is able to quantify the assortativity patterns of a network with respect to a vector attribute. Our extensive experimental results on synthetic network data show that the VA-index outperforms a baseline extension of the assortativity coefficient, which has been used in the literature to cope with similar cases. Furthermore, the VAindex can be calibrated (in terms of parameters) fairly easy, while its benefits increase with the (co-)variance of the vector elements, where the baseline systematically over(under)estimate the true mixing patterns of the network.


Share

Citation/Export:
Social Networking:
Share |

Details

Item Type: Article
Status: Published
Creators/Authors:
CreatorsEmailPitt UsernameORCID
Pelechrinis, Kkpele@pitt.eduKPELE0000-0002-6443-3935
Wei, D
Date: 1 January 2016
Date Type: Publication
Access Restriction: No restriction; Release the ETD for access worldwide immediately.
Journal or Publication Title: PLoS ONE
Volume: 11
Number: 1
DOI or Unique Handle: 10.1371/journal.pone.0146188
Institution: University of Pittsburgh
Schools and Programs: School of Information Sciences > Telecommunications
Refereed: Yes
PubMed Central ID: PMC4731394
PubMed ID: 26816262
Date Deposited: 30 Jun 2016 20:20
Last Modified: 30 Mar 2021 13:55
URI: http://d-scholarship.pitt.edu/id/eprint/28333

Metrics

Monthly Views for the past 3 years

Plum Analytics

Altmetric.com


Actions (login required)

View Item View Item