Transitive reduction of citation networks

Journal of Complex Networks

Volumn 3, Issue 2, 2015, Pages 189-203

  Clough, James R ^a   Gollings, Jamie ^a   Loach, Tamar V ^a   Evans, Tim S ^a  

^a IMPERIAL COLLEGE LONDON   (United Kingdom)

Author keywords

Academic paper citations; Directed acyclic graph; Patent citations; US supreme court citations

Indexed keywords

COMPLEX NETWORKS; LAW ENFORCEMENT; PATENTS AND INVENTIONS;

ACADEMIC PAPER; CITATION NETWORKS; DIRECTED ACYCLIC GRAPH (DAG); IN-DEGREE DISTRIBUTION; PATENT CITATION; SIMILAR DEGREE; TRANSITIVE REDUCTIONS; US SUPREME COURT;

DIRECTED GRAPHS;

EID: 84930944287     PISSN: 20511310     EISSN: 20511329     Source Type: Journal    
DOI: 10.1093/comnet/cnu039     Document Type: Article

References (25)

1. Bartusch, M., Möhring, R. H. & Radermacher, F. J. (1988) Scheduling project networks with resource constraints and time windows. Ann. Oper. Res., 16, 199-240.
2. Dowker, F. (2006) Causal sets as discrete spacetime. Contemp. Phys., 47, 1-9.
3. Holme, P. & Saramäki, J. (2012) Temporal networks. Phys. Rep., 519, 97-125.
4. Aho, A., Garey, M. R. & Ullman, J. D. (1972) The transitive reduction of a directed graph. SIAM J. Sci. Comput., 1, 131.
5. de Solla Price, D. J. (1961) Science Since Babylon. New Haven, CT: Yale University Press.
6. Larsen, P. O. & von Ins, M. (2010) The rate of growth in scientific publication and the decline in coverage provided by science citation index. Scientometrics, 84, 575-603.
7. Brooks, T. A. (1986) Evidence of complex citer motivations. J. Am. Soc. Inf. Sci. Technol., 37, 34-36.
8. MacRoberts, M. H. & MacRoberts, B. R. (1996) Problems of citation analysis. Scientometrics, 36, 435-444.
9. Simkin, M. V. & Roychowdhury, V. P. (2003) Read before you cite! Complex Syst., 14, 269-274.
10. Simkin, M. V. & Roychowdhury, V. P. (2005) Stochastic modeling of citation slips. Scientometrics, 62, 367-384.
11. Greenberg, S. A. (2009) How citation distortions create unfounded authority: analysis of a citation network. BMJ, 339, b2680. http://dx.doi.org/10.1136/bmj.b2680.
12. Jaffe, A. & Trajtenberg, M. (2002) Patents, Citations and Innovations. Cambridge, MA: MIT Press.
13. Data for KDD cup (2003) http://www.cs.cornell.edu/projects/kddcup/datasets.html.
14. Clough, J. R., Gollings, J., Loach, T. V. & Evans, T. S. (2013) Transitive reduction of citation networks. http://dx.doi.org/10.6084/m9.figshare.834935
15. Data for US patent citation network from the National Bureau of Economic Research (2001) http://www.nber.org/patents/.
16. Hall, B. H., Jaffe, A. B. & Trajtenberg, M. (2001) The NBER Patent Citation Data File: Lessons, Insights and Methodological Tools. No. w8498. National Bureau of Economic Research.
17. Fowler, J. & Jeon, S. (2008) The Authority of Supreme Court precedent. Soc. Netw., 30, 16-30.
18. Clauset, A., Shalizi, C. R. & Newman, M. E. J. (2009) Power-law distributions in empirical data. SIAM Rev., 51, 661-703.
19. Alstott, J., Bullmore, E. & Plenz, D. (2014) powerlaw: A python package for analysis of heavy-tailed distributions. PLoS ONE, 9, e85777. http://dx.doi.org/10.1371/journal.pone.0085777
20. Evans, T. S., Hopkins, N. & Kaube, B. S. (2012) Universality of performance indicators based on citation and reference counts. Scientometrics, 93, 473-495. http://dx.doi.org/10.1007/s11192-012-0694-9, arXiv:1110.3271.
21. Krapivsky, P. L. & Redner, S. (2001) Organization of growing random networks. Phys. Rev. E, 63, 066123.
22. Molloy, M. & Reed, B. (1995) A critical point for random graphs with a given degree sequence. Random Struct. Algorithms, 6, 161.
23. Karrer, B. & Newman, M. (2009) Random graph models for directed acyclic networks. Phys. Rev. E, 80, 046110. http://dx.doi.org/10.1103/PhysRevE.80.046110, arXiv:0907.4346
24. Barthélemy, M. (2011) Spatial networks. Phys. Rep., 499, 1-101.
25. Expert, P., Evans, T. S., Blondel, V. D. & Lambiotte, R. (2011) Uncovering space-independent communities in spatial networks. Proc. Natl Acad. Sci. USA, 108, 7663-7668.