Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
97 tokens/sec
GPT-4o
53 tokens/sec
Gemini 2.5 Pro Pro
43 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Transitive Reduction of Citation Networks (1310.8224v2)

Published 30 Oct 2013 in physics.soc-ph, cs.DL, and cs.SI

Abstract: 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 formed from academic papers, patents, and US Supreme Court verdicts. We show how transitive reduction reveals fundamental differences in the citation practices of different areas, how it highlights particularly interesting work, and how it can correct for the effect that the age of a document has on its citation count. Finally, we transitively reduce null models of citation networks with similar degree distributions and show the difference in degree distributions after transitive reduction to illustrate the lack of causal structure in such models.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (4)
  1. James R. Clough (16 papers)
  2. Jamie Gollings (1 paper)
  3. Tamar V. Loach (2 papers)
  4. Tim S. Evans (22 papers)
Citations (74)

Summary

We haven't generated a summary for this paper yet.