Transitive Reduction of Citation Networks

@article{Clough2015TransitiveRO,
  title={Transitive Reduction of Citation Networks},
  author={James R. Clough and Jamie Gollings and Tamar V. Loach and Tim S. Evans},
  journal={J. Complex Networks},
  year={2015},
  volume={3},
  pages={189-203}
}
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 coecients and relationship between time of publication and degree (representing citation count) are changed under transitive reduction. We show that models which accurately reproduce the degree distribution of a citation network… Expand
Diversity from the Topology of Citation Networks
TLDR
It is shown that transitively reduced degree centrality is capable of capturing "diverse" nodes, thus this measure could be a timely alternative to text analysis techniques for retrieving papers, influential in a variety of research fields. Expand
Time and Citation Networks
TLDR
The tools can reveal that citation networks which appear to have very similar structure by standard network measures turn out to have significantly different properties, and interpret the results as indicating that many papers in a bibliography were not directly relevant to the work and that they can provide a simple indicator of the important citations. Expand
Time & Citation Networks
TLDR
The hypothesis is that existing network measures do not take account of the strong constraint imposed by time, and a programme to develop new temporally aware network measures and to prove their utility in the context of citation networks is embarked on. Expand
A geometric graph model for citation networks of exponentially growing scientific papers
TLDR
A geometric graph is proposed to predict some features of the citation networks with exponentially growing papers, which addresses the precondition by using coordinates of nodes to model the research contents of papers, and geometric distances between nodes to diversities of research contents between papers. Expand
Homophily and missing links in citation networks
TLDR
This study proposes a novel method for measuring the similarity between articles through the statistical validation of the overlap between their bibliographies, and indicates that Electromagnetism and Interdisciplinary Physics are the two sub-fields in physics with the smallest percentage of missing citations. Expand
Cycle Analysis of Directed Acyclic Graphs
TLDR
This paper measures the characteristics of the Minimal Cycle Bases of four models of Transitively Reduced Directed Acyclic Graphs and shows that the metrics introduced are able to distinguish the models and are sensitive to their generating mechanisms. Expand
Rooted citation graphs density metrics for research papers influence evaluation
TLDR
This work proposes two measures defined on the citation graph that offer a more intuitive insight into the impact of a paper than the superficial count of citations, and is focused on the identification of influence as an expression of the citation density in the subgraph of citations built for each paper. Expand
What is the dimension of citation space?
TLDR
Novel quantitative methods are provided to characterise that structure of citation networks by adapting methods used in the causal set approach to quantum gravity by considering the networks to be embedded in a Minkowski spacetime and measuring its dimension using Myrheim–Meyer and Midpoint-scaling estimates. Expand
Modelling citation networks
TLDR
The shape of such distributions is characterised by a ‘width’, $$\sigma ^2$$σ2, associated with fitting a log-normal to each distribution, and the width is found to be approximately constant for publications published in different years. Expand
Making communities show respect for order
TLDR
A community detection algorithm in which the communities both respects the intrinsic order of a directed acyclic graph and also finds similar nodes, which shows how well this partitioning algorithm distinguishes and groups together nodes of the same origin. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 31 REFERENCES
Random graph models for directed acyclic networks.
  • B. Karrer, M. Newman
  • Mathematics, Medicine
  • Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2009
TLDR
This work proposes two specific models roughly analogous to the fixed edge number and fixed edge probability variants of traditional undirected random graphs for directed acyclic graphs, finding that theory and measurements agree surprisingly well-far better than the often poor agreement of other random graph models with their corresponding real-world networks. Expand
How citation distortions create unfounded authority: analysis of a citation network
  • S. Greenberg
  • Computer Science, Medicine
  • BMJ : British Medical Journal
  • 2009
TLDR
Citation is both an impartial scholarly method and a powerful form of social communication that can be used to generate information cascades resulting in unfounded authority of claims. Expand
The Transitive Reduction of a Directed Graph
TLDR
It is shown that the time complexity of the best algorithm for finding the transitive reduction of a graph is the same as the time to compute the transitives closure of agraph or to perform Boolean matrix multiplication. Expand
Universality of performance indicators based on citation and reference counts
TLDR
This work demonstrates that comparisons can be made between publications from different disciplines and publication dates, regardless of their citation count and without expensive access to the whole world-wide citation graph. Expand
Stochastic modeling of citation slips
TLDR
The cluster of the mainstream urban studies journals revealed a higher degree of interdisciplinarity than other clusters, and the four-factor solution demonstrated the interrelationships among the overlapping journals loaded high on different factors. Expand
Temporal Networks
TLDR
This review presents the emergent field of temporal networks, and discusses methods for analyzing topological and temporal structure and models for elucidating their relation to the behavior of dynamical systems. Expand
Uncovering space-independent communities in spatial networks
TLDR
This paper argues in this paper for a careful treatment of the constraints imposed by space on network topology and proposes a modularity function adapted to spatial networks for community detection and focuses on the problem of community detection. Expand
Spatial Networks
TLDR
This work will expose thoroughly the current state of the understanding of how the spatial constraints affect the structure and properties of these networks, and review the most recent empirical observations and the most important models of spatial networks. Expand
Organization of growing random networks.
  • P. Krapivsky, S. Redner
  • Mathematics, Medicine
  • Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2001
TLDR
The organizational development of growing random networks is investigated, and the combined age and degree distribution of nodes shows that old nodes typically have a large degree. Expand
The rate of growth in scientific publication and the decline in coverage provided by Science Citation Index
TLDR
It is problematic that SCI has been used and is used as the dominant source for science indicators based on publication and citation numbers, because the declining coverage of the citation databases problematizes the use of this source. Expand
...
1
2
3
4
...