Motifs in weighted networks and their Hirsch subgraphs

Main Article Content

Simon S. Li
Ronald Rousseau
Fred Y. Ye
Simon S. Li
Ronald Rousseau
Fred Y. Ye

Abstract

Motifs are patterns of interactions occurring in complex networks and characterized by the fact that they occur significantly more than expected. Network indicators derived from motifs are introduced in this contribution. They provide yet another numerical view on network structures. Based on the notion of a motif’s h-index the motif’s Hirsch subgraph is constructed. This subgraph is a new characteristic structure in weighted networks. Use of these notions has been illustrated in two case studies: one involving a co-authorship and one involving a co-keyword network.


 

Downloads

Download data is not yet available.

Article Details

How to Cite
Li, S. S., Rousseau, R., Ye, F. Y., Li, S. S., Rousseau, R., & Ye, F. Y. (2016). Motifs in weighted networks and their Hirsch subgraphs. Malaysian Journal of Library and Information Science, 21(3), 21–34. https://doi.org/10.22452/mjlis.vol21no3.2
Section
Articles

Most read articles by the same author(s)