Issue |
EPL
Volume 93, Number 4, February 2011
|
|
---|---|---|
Article Number | 40002 | |
Number of page(s) | 6 | |
Section | General | |
DOI | https://doi.org/10.1209/0295-5075/93/40002 | |
Published online | 24 February 2011 |
Asymmetric network connectivity using weighted harmonic averages
School of Engineering and Applied Sciences, Harvard University - Cambridge, MA 02138, USA
a
gmorriso@seas.harvard.edu
b
lm@seas.harvard.edu
Received:
22
November
2010
Accepted:
21
January
2011
We propose a non-metric measure of the “closeness” felt between two nodes in an undirected, weighted graph using a simple weighted harmonic average of connectivity, that is a real-valued Generalized Erdös Number (GEN). While our measure is developed with a collaborative network in mind, the approach can be of use in a variety of artificial and real-world networks. We are able to distinguish between network topologies that standard distance metrics view as identical, and use our measure to study some simple analytically tractable networks. We show how this might be used to look at asymmetry in authorship networks such as those that inspired the integer Erdös numbers in mathematical coauthorships. We also show the utility of our approach to devise a ratings scheme that we apply to the data from the NetFlix prize, and find a significant improvement using our method over a baseline.
PACS: 02.10.Ox – Combinatorics; graph theory
© EPLA, 2011
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.