The Network of the International Criminal Court Decisions as a Complex System

Many real-world networks lend themselves to the use of graphs for analysing and modeling their structure. This approach has proved to be very useful for a wide variety of networks stemming from very different fields. Yet, only few papers focused their attention on legal networks. This paper intends precisely to remedy this situation by analysing a major legal network by means of complex system methods. The network under investigation is the network composed by decisions taken by the International Criminal Court since its creation. We first model the network by a simple directed graph in which nodes are the decisions and links represent citations between decisions. Our analysis shows that standard properties shared by common real networks are also present in this network. Then we turn to studying the network by means of bipartite graphs that involve both decisions and articles of law. We show that this two-level structure presents several non trivial properties and we show evidences of the relevance of the bipartite representation to explain properties observed in the graph of citations.

[1]  Romain Boulet,et al.  A network approach to the French system of legal codes—part I: analysis of a dense network , 2011, Artificial Intelligence and Law.

[2]  Pierre Mazzega,et al.  Codification, Law Article and Graphs , 2007, JURIX.

[3]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[4]  Jean-Loup Guillaume,et al.  Bipartite graphs as models of complex networks , 2006 .

[5]  M. Tumminello,et al.  Statistically Validated Networks in Bipartite Complex Systems , 2010, PloS one.

[6]  Floris Bex,et al.  Legal Knowledge and Information Systems. JURIX 2006 , 2006 .

[7]  Matthieu Latapy,et al.  Towards a bipartite graph modeling of the internet topology , 2013, Comput. Networks.

[8]  Albert-László Barabási,et al.  Flavor network and the principles of food pairing , 2011, Scientific reports.

[9]  M. Newman,et al.  Random graphs with arbitrary degree distributions and their applications. , 2000, Physical review. E, Statistical, nonlinear, and soft matter physics.

[10]  Dorothea Wagner,et al.  Approximating Clustering Coefficient and Transitivity , 2005, J. Graph Algorithms Appl..

[11]  S H Strogatz,et al.  Random graph models of social networks , 2002, Proceedings of the National Academy of Sciences of the United States of America.

[12]  Dorothea Wagner,et al.  Finding, Counting and Listing All Triangles in Large Graphs, an Experimental Study , 2005, WEA.

[13]  Matthieu Latapy,et al.  Basic notions for the analysis of large two-mode networks , 2008, Soc. Networks.

[14]  U Alon,et al.  The incoherent feed-forward loop accelerates the response-time of the gal system of Escherichia coli. , 2006, Journal of molecular biology.

[15]  S. Mangan,et al.  Structure and function of the feed-forward loop network motif , 2003, Proceedings of the National Academy of Sciences of the United States of America.