A network approach to the French system of legal codes—part I: analysis of a dense network

We explore one aspect of the structure of a codified legal system at the national level using a new type of representation to understand the strong or weak dependencies between the various fields of law. In Part I of this study, we analyze the graph associated with the network in which each French legal code is a vertex and an edge is produced between two vertices when a code cites another code at least one time. We show that this network distinguishes from many other real networks from a high density, giving it a particular structure that we call concentrated world and that differentiates a national legal system (as considered with a resolution at the code level) from small-world graphs identified in many social networks. Our analysis then shows that a few communities (groups of highly wired vertices) of codes covering large domains of regulation are structuring the whole system. Indeed we mainly find a central group of influent codes, a group of codes related to social issues and a group of codes dealing with territories and natural resources. The study of this codified legal system is also of interest in the field of the analysis of real networks. In particular we examine the impact of the high density on the structural characteristics of the graph and on the ways communities are searched for. Finally we provide an original visualization of this graph on an hemicyle-like plot, this representation being based on a statistical reduction of dissimilarity measures between vertices. In Part II (a following paper) we show how the consideration of the weights attributed to each edge in the network in proportion to the number of citations between two vertices (codes) allows deepening the analysis of the French legal system.

[1]  Ulrike von Luxburg,et al.  A tutorial on spectral clustering , 2007, Stat. Comput..

[2]  J. A. Hartigan,et al.  A k-means clustering algorithm , 1979 .

[3]  E. A. Leicht,et al.  Large-scale structure of time evolving citation networks , 2007, 0706.0015.

[4]  Fabrice Rossi,et al.  Batch kernel SOM and related Laplacian methods for social network analysis , 2008, Neurocomputing.

[5]  P. Schuck.  Legal Complexity: Some Causes, Consequences, and Cures , 1992 .

[6]  Mark E. J. Newman.  A measure of betweenness centrality based on random walks , 2005, Soc. Networks.

[7]  Pierre Mazzega,et al.  Toward measures of complexity in legal systems , 2007, ICAIL.

[8]  Jacques Le Goff,et al.  Droit et complexité : pour une nouvelle intelligence du droit vivant : actes du colloque de Brest du 24 mars 2006 , 2007 .

[9]  Pascale Kuntz-Cosperec.  Représentation euclidienne d'un graphe abstrait en vue de sa segmentation , 1992 .

[10]  J. B. Ruhl.  Thinking of Environmental Law as a Complex Adaptive System: How to Clean Up the Environment by Making a Mess of Environmental Law , 2009 .

[11]  André Berten,et al.  Mireille Delmas-Marty, Les forces imaginantes du droit. Vol. I: Le relatif et l'universel ; Mireille Delmas-Marty, Les forces imaginantes du droit. Vol. II: Le pluralisme ordonné ; Mireille Delmas-Marty, Les forces imaginantes du droit. Vol. III: La refondation du pouvoir , 2007 .

[12]  Santo Fortunato,et al.  Community detection in graphs , 2009, ArXiv.

[13]  D. Bourcier,et al.  Legal Knowledge and Information Systems: Jurix 2003 the Sixteenth Annual Conference , 2004 .

[14]  Ulrik Brandes,et al.  Network Analysis: Methodological Foundations (Lecture Notes in Computer Science) , 2005 .

[15]  Hubert de Fraysseix,et al.  An Heuristic for Graph Symmetry Detection , 1999, GD.

[16]  B. Gaume,et al.  Balades aléatoires dans les Petits Mondes Lexicaux , 2004 .

[17]  Alan M. Frieze,et al.  Random graphs , 2006, SODA '06.

[18]  Mason A. Porter,et al.  Communities in Networks , 2009, ArXiv.

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

[20]  Louis Kaplow,et al.  A Model of the Optimal Complexity of Legal Rules , 1995 .

[21]  Valérie Larrosa.  Compte-rendu de "Doat (Mathieu), Le Goff (Jacques) et Pédrot (Philippe), Droit et complexité : pour une nouvelle intelligence du droit vivant, Rennes, Presses universitaires de Rennes, 2007" , 2007 .

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

[23]  Richard A. Epstein,et al.  Simple Rules for a Complex World , 1995 .

[24]  D. Watts,et al.  Small Worlds: The Dynamics of Networks between Order and Randomness , 2001 .

[25]  Eric Kades.  The Laws of Complexity & the Complexity of Laws: The Implications of Computational Complexity Theory for the Law , 1997 .

[26]  M. Newman,et al.  Finding community structure in very large networks. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

[27]  Matthieu Latapy,et al.  Complex Network Measurements: Estimating the Relevance of Observed Properties , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

[28]  Matthieu Latapy,et al.  Computing Communities in Large Networks Using Random Walks , 2004, J. Graph Algorithms Appl..

[29]  J. Fowler,et al.  Network Analysis and the Law: Measuring the Legal Importance of Precedents at the U.S. Supreme Court , 2007, Political Analysis.

[30]  Jie Wu,et al.  Small Worlds: The Dynamics of Networks between Order and Randomness , 2003 .

[31]  Chris Arney.  Network Analysis: Methodological Foundations , 2012 .

[32]  M E J Newman,et al.  Fast algorithm for detecting community structure in networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[33]  Antonio del Sol,et al.  Topology of small-world networks of protein?Cprotein complex structures , 2005, Bioinform..

[34]  Matthieu Latapy,et al.  Computing Communities in Large Networks Using Random Walks , 2004, J. Graph Algorithms Appl..

[35]  Jerrold W. Grossman,et al.  The evolution of the mathematical research collaboration graph , 2002 .

[36]  L. Freeman.  Centrality in social networks conceptual clarification , 1978 .

[37]  Ugo Pagallo,et al.  Teoria giuridica della complessità , 2006 .

[38]  Romain Boulet,et al.  Comparaison de graphes, applications à l'étude d'un réseau de sociabilité paysan au Moyen Age , 2008 .

[39]  J. Fowler,et al.  Distance Measures for Dynamic Citation Networks , 2009, 0909.1819.

[40]  Daniel Martin Katz,et al.  Properties of the United States Code Citation Network , 2009 .

[41]  James H. Fowler,et al.  Abstract Available online at www.sciencedirect.com Social Networks 30 (2008) 16–30 The authority of Supreme Court precedent , 2022 .

[42]  Shi Zhou,et al.  The rich-club phenomenon in the Internet topology , 2003, IEEE Communications Letters.

[43]  Alessandro Vespignani,et al.  Detecting rich-club ordering in complex networks , 2006, physics/0602134.

[44]  Romain Boulet,et al.  Network Analysis of the French Environmental Code , 2009, AICOL Workshops.

[45]  Gordon Tullock.  On the desirable degree of detail in the law , 1995 .

[46]  Daniel Martin Katz,et al.  A Mathematical Approach to the Study of the United States Code , 2010, ArXiv.

[47]  François Ost,et al.  De la pyramide au réseau ? Pour une théorie dialectique du droit , 2010 .