Results 1  10
of
6,720
Aging in citation networks
 Elsevier Science
, 2004
"... In many growing networks, the age of the nodes plays an important role in deciding the attachment probability of the incoming nodes. For example, in a citation network, very old papers are seldom cited while recent papers are usually cited with high frequency. We study actual citation networks to fi ..."
Abstract

Cited by 9 (0 self)
 Add to MetaCart
In many growing networks, the age of the nodes plays an important role in deciding the attachment probability of the incoming nodes. For example, in a citation network, very old papers are seldom cited while recent papers are usually cited with high frequency. We study actual citation networks
Tracking modularity in citation networks
 Scientometrics
, 2010
"... Clustering using cocitation and bibliographic coupling is an effective tool to analyze the structure of scientific research, but its arbitrariness in the setting of a clustering threshold is a problem. This study tracked modularity of citation networks in research domains, and we found that there ar ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
Clustering using cocitation and bibliographic coupling is an effective tool to analyze the structure of scientific research, but its arbitrariness in the setting of a clustering threshold is a problem. This study tracked modularity of citation networks in research domains, and we found
Transitive reduction of citation networks
, 2014
"... In many complex networks the vertices are ordered in time, and edges represent causal connections. We propose methods of analysing such directed acyclic graphs taking into account the constraints of causality and highlighting the causal structure. We illustrate our approach using citation networks ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
In many complex networks the vertices are ordered in time, and edges represent causal connections. We propose methods of analysing such directed acyclic graphs taking into account the constraints of causality and highlighting the causal structure. We illustrate our approach using citation networks
Transitive reduction of citation networks
, 2013
"... Citation networks form directed acyclic graphs. The transitive reduction of such a DAG removes all edges in the graph that are implied by transitivity, but retains the causal structure of the original network. We investigate how the degree distribution, clustering coefficients and relationship betwe ..."
Abstract
 Add to MetaCart
Citation networks form directed acyclic graphs. The transitive reduction of such a DAG removes all edges in the graph that are implied by transitivity, but retains the causal structure of the original network. We investigate how the degree distribution, clustering coefficients and relationship
Statistics of Citation Networks
 Physics EPrint Archive: arXiv:condmat/0105031 (http://arxiv.org/abs/condmat/0105031
, 2001
"... The outdegree distribution of citation networks is investigated. Statistical data of the number of papers cited within a paper (outdegree) for different journals in the period 19911999 is reported. The outdegree distribution is characterized by a maximum at intermediate outdegrees. At the left ..."
Abstract

Cited by 12 (0 self)
 Add to MetaCart
The outdegree distribution of citation networks is investigated. Statistical data of the number of papers cited within a paper (outdegree) for different journals in the period 19911999 is reported. The outdegree distribution is characterized by a maximum at intermediate outdegrees. At the left
Efficient algorithms for citation network analysis
, 2002
"... 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 ..."
Abstract

Cited by 25 (7 self)
 Add to MetaCart
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
Modelling Citation Networks
"... The distribution of the number of academic publications as a function of citation count for a given year is remarkably similar from year to year. We measure this similarity as a width of the distribution and find it to be approximately constant from year to year. We show that simple citation models ..."
Abstract
 Add to MetaCart
models fail to capture this behaviour. We then provide a simple three parameter citation network model using a mixture of local and global search processes which can reproduce the correct distribution over time. We use the citation network of papers from the hepth section of arXiv to test our model
Learning and the structure of citation networks
, 2012
"... The distribution of citations received by scientific publications can be approximated by a power law, a finding that has been explained by “cumulative advantage”. This paper argues that socially embedded learning is a plausible mechanism behind this cumulative advantage. A model assuming that scient ..."
Abstract
 Add to MetaCart
if there is relatively more learning. The predicted exponent for the distribution of citations is independent of the average in(or out) degree, contrary to an untested prediction of the reference model (Price, 1976). Using publicly available citation networks, an estimate of the share of time devoted to learning
The effects of dangling nodes on citation networks
"... This study discusses the effects of dangling nodes on citation networks through the PageRank algorithm. The origins of dangling nodes for citation networks are introduced and three methods are applied to handle dangling nodes: retaining all dangling nodes, deleting dangling nodes, and clustering dan ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
This study discusses the effects of dangling nodes on citation networks through the PageRank algorithm. The origins of dangling nodes for citation networks are introduced and three methods are applied to handle dangling nodes: retaining all dangling nodes, deleting dangling nodes, and clustering
Exploration and Evaluation of Citation Networks
"... This paper deals with the definitions, explanations and testing of the PageRank formula modified and adapted for bibliographic networks. Our modifications of PageRank take into account not only the citations but also the coauthorship relationships. We verified the capabilities of the developed algor ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
This paper deals with the definitions, explanations and testing of the PageRank formula modified and adapted for bibliographic networks. Our modifications of PageRank take into account not only the citations but also the coauthorship relationships. We verified the capabilities of the developed
Results 1  10
of
6,720