Nominal assortativity (or discrete assortativity) is widely used to characterize group mixing patterns and homophily in networks, enabling researchers to analyze how groups interact with one another. Here we demonstrate that the measure presents severe shortcomings when applied to networks with unequal group sizes and asymmetric mixing. We characterize these shortcomings analytically and use synthetic and empirical networks to show that nominal assortativity fails to account for group imbalance and asymmetric group interactions, thereby producing an inaccurate characterization of mixing patterns. We propose adjusted nominal assortativity and show that this adjustment recovers the expected assortativity in networks with various level of mixi...
Assortativity by degree for complex networks is quantified by the Newman coefficient, and it describ...
Inconsistencies in the empirical support for balance theory are often explained by recourse to compe...
Why are some networks degree-degree correlated (assortative), while most of the real-world ones are ...
Author name used in this publication: Xiao-Ke Xu2009-2010 > Academic research: refereed > Publicatio...
Assortative mixing in networks is the tendency for nodes with the same attributes, or metadata, to l...
Clustering, assortativity, and communities are key features of complex networks. We probe dependenci...
Network connections have been shown to be correlated with structural or external attributes of the n...
A network's assortativity is the tendency of vertices to bond with others based on similarities, usu...
We consider the network constraints on the bounds of the assortativity coefficient, which aims to qu...
The friendship paradox is the observation that friends of individuals tend to have more friends or b...
Assortative matching is a network phenomenon that arises when nodes exhibit a bias towards connectio...
Since the seminal work of Litvak and van der Hofstad [12], it has been known that Newman\u2019s asso...
Mixing patterns in large self-organizing networks, such as the Internet, the World Wide Web, and soc...
Assortativity by degree for complex networks is quantified by the Newman coefficient, and it describ...
Inconsistencies in the empirical support for balance theory are often explained by recourse to compe...
Why are some networks degree-degree correlated (assortative), while most of the real-world ones are ...
Author name used in this publication: Xiao-Ke Xu2009-2010 > Academic research: refereed > Publicatio...
Assortative mixing in networks is the tendency for nodes with the same attributes, or metadata, to l...
Clustering, assortativity, and communities are key features of complex networks. We probe dependenci...
Network connections have been shown to be correlated with structural or external attributes of the n...
A network's assortativity is the tendency of vertices to bond with others based on similarities, usu...
We consider the network constraints on the bounds of the assortativity coefficient, which aims to qu...
The friendship paradox is the observation that friends of individuals tend to have more friends or b...
Assortative matching is a network phenomenon that arises when nodes exhibit a bias towards connectio...
Since the seminal work of Litvak and van der Hofstad [12], it has been known that Newman\u2019s asso...
Mixing patterns in large self-organizing networks, such as the Internet, the World Wide Web, and soc...
Assortativity by degree for complex networks is quantified by the Newman coefficient, and it describ...
Inconsistencies in the empirical support for balance theory are often explained by recourse to compe...
Why are some networks degree-degree correlated (assortative), while most of the real-world ones are ...