9 research outputs found

    Hustle and Flow: A Social Network Analysis of the American Federal Judiciary

    Get PDF

    Algorithms and Models for the Web Graph

    Get PDF

    Hustle and Flow: A Social Network Analysis of the American Federal Judiciary

    Get PDF
    Article published in the Ohio State Law Journal

    Perspectives on Law and Legal Institutions as Complex Adaptive Systems.

    Full text link
    This dissertation employs various theoretical and methodological perspectives to consider the “evolution” of the law and “law as a complex adaptive system.” Chapter 2 addresses the strategic institutional conditions that produced Chief Justice Rehnquist’s majority opinion in Dickerson v. United States. In the wake of the Chief Justice’s ruling, legal scholars grappled to interpret this apparently anomalous decision. This process produced a litany of deeply unsatisfactory explanations for the Chief’s behavior. Chapter 2 rejects all of these existing explanations and instead outlines a game theoretic account for the Chief’s decision in this very important Miranda related case. Applying network theory, Chapter 3 considers the social topology of the American federal judiciary. Scholars have long asserted that social structure is an important feature of a variety of societal institutions. However, to date, such social considerations have not been formally integrated in positive legal theory. Using the flow of law clerks as a proxy for social and professional linkages between jurists, Chapter 3 offers a variety of visualizations and analytics useful for considering the physical properties of the judicial social network. Chapter 4 considers the ‘evolution’ of the law in the early jurisprudence of the United States Supreme Court. Relevant dynamics include but are not limited to doctrinal importation, path dependence, cross-fertilization, mutation, fitness and selection. Chapter 4 explores a subset of these dynamics in the applied context of the early United States Supreme Court (1791-1835). Justices on the early United States Supreme Court relied upon a wide variety of sources as evidence in support of their arguments. Chapter 4 offers both descriptive data regarding the magnitude of references and identifies the extent to which those references imported ideas from foreign sources. Next, it applies the tools of network science to measure the structural importance of these foreign law infused decisions. While the empirical results are relevant to the ongoing debate regarding the Supreme Court's reliance upon foreign sources, there is something far more fundamental at stake. Specifically, Chapter 4 introduces the “legal genome project” a new conceptual framework useful for understanding the “evolution” of the law.Ph.D.Public Policy & Political ScienceUniversity of Michigan, Horace H. Rackham School of Graduate Studieshttp://deepblue.lib.umich.edu/bitstream/2027.42/89688/1/dmartink_1.pd

    Recherche de structure dans un graphe aléatoire : modÚles à espace latent

    Get PDF
    .This thesis addresses the clustering of the nodes of a graph, in the framework of randommodels with latent variables. To each node i is allocated an unobserved (latent) variable Zi and the probability of nodes i and j being connected depends conditionally on Zi and Zj . Unlike Erdos-Renyi's model, connections are not independent identically distributed; the latent variables rule the connection distribution of the nodes. These models are thus heterogeneous and their structure is fully described by the latent variables and their distribution. Hence we aim at infering them from the graph, which the only observed data.In both original works of this thesis, we propose consistent inference methods with a computational cost no more than linear with respect to the number of nodes or edges, so that large graphs can be processed in a reasonable time. They both are based on a study of the distribution of the degrees, which are normalized in a convenient way for the model.The first work deals with the Stochastic Blockmodel. We show the consistency of an unsupervised classiffcation algorithm using concentration inequalities. We deduce from it a parametric estimation method, a model selection method for the number of latent classes, and a clustering test (testing whether there is one cluster or more), which are all proved to be consistent. In the second work, the latent variables are positions in the ℝd space, having a density f. The connection probability depends on the distance between the node positions. The clusters are defined as connected components of some level set of f. The goal is to estimate the number of such clusters from the observed graph only. We estimate the density at the latent positions of the nodes with their degree, which allows to establish a link between clusters and connected components of some subgraphs of the observed graph, obtained by removing low degree nodes. In particular, we thus derive an estimator of the cluster number and we also show the consistency in some sense.Cette thĂšse aborde le problĂšme de la recherche d'une structure (ou clustering) dans lesnoeuds d'un graphe. Dans le cadre des modĂšles alĂ©atoires Ă  variables latentes, on attribue Ă  chaque noeud i une variable alĂ©atoire non observĂ©e (latente) Zi, et la probabilitĂ© de connexion des noeuds i et j dĂ©pend conditionnellement de Zi et Zj . Contrairement au modĂšle d'Erdos-RĂ©nyi, les connexions ne sont pas indĂ©pendantes identiquement distribuĂ©es; les variables latentes rĂ©gissent la loi des connexions des noeuds. Ces modĂšles sont donc hĂ©tĂ©rogĂšnes, et leur structure est dĂ©crite par les variables latentes et leur loi; ce pourquoi on s'attache Ă  en faire l'infĂ©rence Ă  partir du graphe, seule variable observĂ©e.La volontĂ© commune des deux travaux originaux de cette thĂšse est de proposer des mĂ©thodes d'infĂ©rence de ces modĂšles, consistentes et de complexitĂ© algorithmique au plus linĂ©aire en le nombre de noeuds ou d'arĂȘtes, de sorte Ă  pouvoir traiter de grands graphes en temps raisonnable. Ils sont aussi tous deux fondĂ©s sur une Ă©tude fine de la distribution des degrĂ©s, normalisĂ©s de façon convenable selon le modĂšle.Le premier travail concerne le Stochastic Blockmodel. Nous y montrons la consistence d'un algorithme de classiffcation non supervisĂ©e Ă  l'aide d'inĂ©galitĂ©s de concentration. Nous en dĂ©duisons une mĂ©thode d'estimation des paramĂštres, de sĂ©lection de modĂšles pour le nombre de classes latentes, et un test de la prĂ©sence d'une ou plusieurs classes latentes (absence ou prĂ©sence de clustering), et nous montrons leur consistence.Dans le deuxiĂšme travail, les variables latentes sont des positions dans l'espace ℝd, admettant une densitĂ© f, et la probabilitĂ© de connexion dĂ©pend de la distance entre les positions des noeuds. Les clusters sont dĂ©finis comme les composantes connexes de l'ensemble de niveau t > 0 fixĂ© de f, et l'objectif est d'en estimer le nombre Ă  partir du graphe. Nous estimons la densitĂ© en les positions latentes des noeuds grĂące Ă  leur degrĂ©, ce qui permet d'Ă©tablir une correspondance entre les clusters et les composantes connexes de certains sous-graphes du graphe observĂ©, obtenus en retirant les nƓuds de faible degrĂ©. En particulier, nous en dĂ©duisons un estimateur du nombre de clusters et montrons saconsistence en un certain sen

    Computational socioeconomics

    Get PDF
    Uncovering the structure of socioeconomic systems and timely estimation of socioeconomic status are significant for economic development. The understanding of socioeconomic processes provides foundations to quantify global economic development, to map regional industrial structure, and to infer individual socioeconomic status. In this review, we will make a brief manifesto about a new interdisciplinary research field named Computational Socioeconomics, followed by detailed introduction about data resources, computational tools, data-driven methods, theoretical models and novel applications at multiple resolutions, including the quantification of global economic inequality and complexity, the map of regional industrial structure and urban perception, the estimation of individual socioeconomic status and demographic, and the real-time monitoring of emergent events. This review, together with pioneering works we have highlighted, will draw increasing interdisciplinary attentions and induce a methodological shift in future socioeconomic studies
    corecore