Efficient Algorithms for Citation Network Analysis
arXiv:cs/0309023
Abstract
In the paper very efficient, linear in number of arcs, algorithms for determining Hummon and Doreian's arc weights SPLC and SPNP in citation network are proposed, and some theoretical properties of these weights are presented. The nonacyclicity problem in citation networks is discussed. An approach to identify on the basis of arc weights an important small subnetwork is proposed and illustrated on the citation networks of SOM (self organizing maps) literature and US patents.
Cited by in corpus (5)
- Tracing technological development trajectories: A genetic knowledge persistence-based main path approach
- Technological improvement rate estimates for all technologies: Use of patent data and an extended domain description
- Social Network Analysis: Bibliographic Network Analysis of the Field and its Evolution / Part 1. Basic Statistics and Citation Network Analysis
- Towards a Formal, Visual Framework of Emergent Cognitive Development of Scholars
- Case study to approaches to finding patterns in citation networks