h-Degree as a basic measure in weighted networks

Star X. Zhao, Ronald Rousseau and Fred Y. Ye

Journal of Informetrics, 2011, vol. 5, issue 4, 668-677

Abstract: We introduce the h-degree of a node as a basic indicator for weighted networks. The h-degree (dh) of a node is the number dh if this node has at least dh links with other nodes and the strength of each of these links is greater than or equal to dh. Based on the notion of h-degree other notions are developed such as h-centrality and h-centralization, leading to a new set of indicators characterizing nodes in a network.

Keywords: h-Degree; Node strength; Network analysis; Weighted networks; Informetric networks (search for similar items in EconPapers)
Date: 2011
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (23)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S1751157711000691
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:infome:v:5:y:2011:i:4:p:668-677

DOI: 10.1016/j.joi.2011.06.005

Access Statistics for this article

Journal of Informetrics is currently edited by Leo Egghe

More articles in Journal of Informetrics from Elsevier
Bibliographic data for series maintained by Catherine Liu ().