Time-stamp based network evolution model for citation networks

Citation score has become a very important metric to assess the quality of a publication in the current global ranking scenario. In this context, the study of citation networks gains importance as it helps in understanding the citation process as well as in analyzing citation trends in the research...

Full description

Saved in:
Bibliographic Details
Published in:Scientometrics 2023-06, Vol.128 (6), p.3723-3741
Main Authors: Kammari, Monachary, S, Durga Bhavani
Format: Article
Language:English
Subjects:
Citation analysis
Clustering
Computer Science
Evolution
Graph theory
Information Storage and Retrieval
Library Science
Networks
Quality assessment
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Citation score has become a very important metric to assess the quality of a publication in the current global ranking scenario. In this context, the study of citation networks gains importance as it helps in understanding the citation process as well as in analyzing citation trends in the research world. Citation networks are modeled as directed acyclic graphs in which publications of the authors are considered as nodes and citations between the papers form the links. In this paper, we propose an additive Time-Stamp based Network Evolution(TNE) model for citation networks, extending Price’s preferential attachment model by including the recency effect on the citation process without neglecting the impact of classical papers. We propose a more meaningful definition of clustering coefficient for citation networks in terms of ’citation triangles’. Further, the network simulated by the TNE model with best-fit parameters is compared with the real-world(DBLP) citation network. The results of various significance tests show that the simulated network matches very well with the DBLP citation network in terms of several network properties.
ISSN:0138-9130
1588-2861
DOI:10.1007/s11192-023-04704-7