Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Watts, D., Strogatz, S.: Collective dynamics of small-world networks. Nature 393, 440–442 (June 1998)
Newman, M., Strogatz, S., Watts, D.: Random graphs with arbitrary degree distributions and their applications. Phys. Rev. E 64 (2001)
Newman, M., Watts, D., Strogatz, S.: Random graph models of social networks. PNAS 99, 2566–2572 (2002)
Bourcier, D., Mazzega, P.: Codification law article and graphs. In: Lodder, A.R., Mommers, L. (eds.) Legal Knowledge and Information Systems, JURIX 2007. IOS Press, Amsterdam 29–38 (2007)
Boulet, R., Mazzega, P., Bourcier, D.: A Network Approach to the French System of Legal codes - Part I: Analysis of a Dense Network, Artificial Intelligence and Law, 19, 333–355, 2011.x
Latapy, M., Magnien, C., Del Vecchio, N.: Basic notions for the analysis of large two-mode networks. Soc. Netw. 30(1), 31–48 (January 2008)
Ahn, Y.-Y., Ahnert, S.E., Bagrow, J.P., Barabási, A.-L.: Flavor network and the principles of food pairing. Nature Scientific Reports (2011)
Tumminello, M., Miccichè, S., Lillo, F., Piilo, J., Mantegna, R.: Statistically Validated networks in bipartite complex systems. PLoS ONE, 6 (2011)
Guillaume, J.-L., Latapy, M.: Bipartite graphs as models of complex networks. Physica A 371, 795–813 (2004)
Tarissan, F., Quoitin, B., Mérindol, P., Donnet, B., Latapy, M., Pansiot, J-J.: Towards a bipartite graph modeling of the internet topology. Comput. Netw. 57(11), 2331–2347 (2013)
Schank, T., Wagner, D.: Finding, counting and listing all triangles in large graphs, an experimental study. In: Workshop on Experimental and Efficient Algorithms (WEA) (2005)
Schank, T., Wagner, D.: Approximating clustering coefficient and transitivity. J. Graph Algorithms Appl. (JGAA) 9(2), 265–275 (2005)
Mangan, S., Itzkovitz, S., Zaslaver, A., Alon, U.: The incoherent feed-forward loop accelerates the response-time of the gal system of Escherichia coli. JMB 356, 1073–1081 (2006)
Mangan, S., Alon, U.: Structure and function of the feed-forward loop network motif. PNAS 100, 11980–11985 (2003)
Acknowledgments
This work is partly funded by the National Center for Scientific Research (CNRS) through the PEPS Project “DoRé”.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Tarissan, F., Nollez-Goldbach, R. (2014). The Network of the International Criminal Court Decisions as a Complex System. In: Sanayei, A., Zelinka, I., Rössler, O. (eds) ISCS 2013: Interdisciplinary Symposium on Complex Systems. Emergence, Complexity and Computation, vol 8. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-45438-7_25
Download citation
DOI: https://doi.org/10.1007/978-3-642-45438-7_25
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-45437-0
Online ISBN: 978-3-642-45438-7
eBook Packages: EngineeringEngineering (R0)