eprintid: 1824
rev_number: 7
eprint_status: archive
userid: 6
dir: disk0/00/00/18/24
datestamp: 2013-10-04 10:20:55
lastmod: 2013-10-04 10:20:55
status_changed: 2013-10-04 10:20:55
type: article
metadata_visibility: show
creators_name: Morrison, Greg
creators_name: Mahadevan, L.
creators_id: greg.morrison@imtlucca.it
creators_id: 
title: Asymmetric network connectivity using weighted harmonic averages
ispublished: pub
subjects: QA
subjects: QC
divisions: EIC
full_text_status: none
keywords: Mathematical physics  -  PACS: 02.10.Ox Combinatorics; graph theory
abstract: 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.
date: 2011
date_type: published
publication: EPL (Europhysics Letters)
volume: 93
number: 4
publisher: IOPscience
pagerange: 40002
id_number: 10.1209/0295-5075/93/40002
refereed: TRUE
issn: 0295-5075      
official_url: http://dx.doi.org/10.1209/0295-5075/93/40002
citation:   Morrison, Greg and Mahadevan, L.  Asymmetric network connectivity using weighted harmonic averages.  EPL (Europhysics Letters), 93 (4).  p. 40002.  ISSN 0295-5075       (2011)