An integrated approach to path analysis for weighted citation networks

Hiran H. Lathabai (), Susan George (), Thara Prabhakaran () and Manoj Changat ()
Additional contact information
Hiran H. Lathabai: University of Kerala
Susan George: University of Kerala
Thara Prabhakaran: University of Kerala
Manoj Changat: University of Kerala

Scientometrics, 2018, vol. 117, issue 3, No 27, 1904 pages

Abstract: Abstract Profuse growth of scientometrics as a research field owes a discernible attribution to the introduction of citation networks and other scientograms. Centrality analysis, path analysis and cluster analysis are three major network analysis tools. Hummon and Doreian’s introduction of path retrieval methods based on (1) traversal count as weight assignment (for arcs) method and (2) search methods such as local (forward) search and global search, marked the commencement of path analysis. Original Hummon–Doreian traversal count based weight assignment methods such as Search Path Link Count and Search Path Node Pair were computationally complex. Along with the computational improvement of these weights, Batagelj added another computationally efficient traversal count method to the path analysis literature known as Search Path Count. A major development in search methods was seen recently with the introduction of innovative search methods such as backward (local) search and key-route (local and global) search by Liu and Lu. They also powered the available and new local search methods with a parameter to control the search. Major advantage of Liu–Lu methods lies in the fact that these can reveal more paths or more papers that are usually missed out in classical methods. All these contributions considered unweighted citation networks as the object of analysis. Despite being a tool of tremendous potential, path analysis is much underexplored relative to other network analysis tools. Inspired by these, we generalise Liu–Lu integrated approach, the present state-of-art in path analysis to an integrated approach for weighted networks. We demonstrate a manifold improvement in analysis opportunities with the generalized integrated approach using FV gradient weights for weight assignment, on a case study of the field ‘IT for engineering’. Integrated approach for weighted networks do not need additional implementation effort in PAJEK and this will be beneficial for a multitude of analysts and decision makers.

Keywords: Citation networks; Path analysis; Weighted networks; Flow vergence effect; Flow vergence paths; Integrated approach (search for similar items in EconPapers)
Date: 2018
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
http://link.springer.com/10.1007/s11192-018-2917-1 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

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:spr:scient:v:117:y:2018:i:3:d:10.1007_s11192-018-2917-1

Ordering information: This journal article can be ordered from
http://www.springer.com/economics/journal/11192

DOI: 10.1007/s11192-018-2917-1

Access Statistics for this article

Scientometrics is currently edited by Wolfgang Glänzel

More articles in Scientometrics from Springer, Akadémiai Kiadó
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().