317
Network Analysis and the Law Daniel Martin Katz Michigan State University College of Law Michael J. Bommarito II Center for Study of Complex Systems Jurix 2011 Tutorial @ Universität Wien

Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Embed Size (px)

DESCRIPTION

Daniel Martin Katz (Michigan State Law) & Michael Bommarito (Computational Legal Studies.com) Present Network Analysis and Law: Introductory Tutorial @ Jurix 2011 (Vienna)

Citation preview

Page 1: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Network Analysis and the Law

Daniel Martin KatzMichigan State University

College of Law

Michael J. Bommarito IICenter for Study of

Complex Systems

Jurix 2011 Tutorial @ Universität Wien

!

Page 2: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

My Background

Assistant Professor of LawMichigan State University

Former NSF IGERT Fellow,University of Michigan

Center for the Study of Complex Systems(2009-2010)

PhDPolitical Science & Public Policy

University of Michigan(2011)

JDUniversity of Michigan

Law School(2005)

Page 3: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

My Background

Former NSF IGERT Fellow,University of Michigan

Center for the Study of Complex Systems

PhD Pre-CandidateDept. of Political Science

University of Michigan

Masters DegreeFinancial EngineeringUniversity of Michigan

Page 4: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Blog:

Daniel Martin Katz(Michigan State

University - College of Law)

Michael Bommarito II

(Michigan Complex Systems)

JonZelner

(PrincetonEcology & Evolutionary

Biology)

Page 6: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Outline of Our Session

Network Analysis: An Extended Primer

Network Analysis & Law

The Frontier of Network Analysis & Law

Legal ElitesDiffusion and other Related ProcessesLegal Doctrine and Legal Rules

Advanced Network Science Topics Community Detection ERGM / P* ModelsSocial Epidemiology

Distance Measures for Dynamic Citation NetworksDynamic Community DetectionThe Judicial Collaborative Filter (Judge Aided Info Retrevial)

Page 7: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Network Analysis: An Extended Primer

Page 8: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Introduction to Network Analysis

What is a Network?

What is a Social Network?

Mathematical Representation of theRelationships Between Units such asActors, Institutions, Software, etc.

Special class of graph Involving Particular Units and Connections

Page 9: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Introduction to Network Analysis

Interdisciplinary Enterprise

Applied Math(Graph Theory, Matrix Algebra, etc.)

Statistical Methods

Social Science

Physical and Biological Sciences

Computer Science

Page 10: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Social Science

For Images and Links to Underlying projects:

http://jhfowler.ucsd.edu/

3D HiDef SCOTUS Movie

Co-Sponsorship in CongressSpread of Obesity

Hiring and Placement of Political Science PhD’s

Page 11: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Social Science

The 2004 Political Blogosphere (Adamic & Glance)

High School Friendship(Moody)

Roll Call Votes in United States Congress(Mucha, et al)

Page 12: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Physical and Biological Sciences

For Images and Links to Underlying projects:

http://www.visualcomplexity.com/vc/

Page 13: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Computer Science

Mapping

of the

Code

Networks are waysto represent dependanciesbetween software

Page 14: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Computer Science

Internet is one ofthe largest

known and most important networks

Page 15: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Computer Science

Mappingthe

Iranian Blogsphere

http://cyber.law.harvard.edu/publications/2008/Mapping_Irans_Online_Public

Page 16: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Primer on Network

Terminology

Page 17: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Terminology & Examples

Institutions

Firms

States/Countries

Actors

NODES

Other

Page 18: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Example: Nodes in an actor- based social Network

Alice

Bill

Carrie

David

Ellen

How Can We Represent The Relevant Social Relationships?

Terminology & Examples

Page 19: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Edges

Alice

Bill

Carrie

David

Ellen

Arcs

Terminology & Examples

Page 20: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Edges

Alice Bill

Carrie

David

Ellen

Arcs

Terminology & Examples

Page 21: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Edges Alice BillCarrie

David

Ellen

Arcs

Terminology & Examples

Page 22: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Alice Bill

David

Carrie

Ellen

A Full Representation of the Social Network

Terminology & Examples

Page 23: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Bill

David

Carrie

Ellen

Terminology & Examples

Alice

A Full Representation of the Social Network(With Node Weighting)

Page 24: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Bill

David

Carrie

Ellen

A Full Representation of the Social Network(With Node Weighting and Edge Weighting)

Terminology & Examples

Alice

Page 25: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

A Survey Based Example

“Which of the above individuals do you consider a close friend?”

Image We Surveyed 5 Actors:

(1) Daniel, (2) Jennifer, (3) Josh, (4) Bill, (5) Larry

Page 26: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

From an EdgeList to Matrix

1 2 3 4 5 --------------------------- Daniel (1) 0 1 1 1 1 Jennifer (2) 1 0 1 0 0 Josh (3) 0 1 0 1 1 Bill (4) 0 0 0 0 0 Larry (5) 1 1 1 1 0

*Directed Connections (Arcs) 13

1 21 31 41 52 12 33 43 53 25 15 45 35 2

ROWS è COLUMNS

*How to Read the Edge List: (Person in Column 1 is friends with Person in Column 2)

Page 27: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

1 2 3 4 5 --------------------------- Daniel (1) 0 1 1 1 1 Jennifer (2) 1 0 1 0 0 Josh (3) 0 1 0 1 1 Bill (4) 0 0 0 0 0 Larry (5) 1 1 1 1 0

From a Survey to a Network

Page 28: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

A Quick Law Based Example of a

Dynamic Network

Page 30: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Some Other Examples

of Networks

Page 31: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Consumer Data

Knowing Consumer Co-Purchases can help ensure that “Loss Leader” Discounts can be recouped with other purchases

Page 32: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Corporate Boards

http://www.theyrule.net/

Page 33: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Transportation Networks

We might be interested in developing transportation systems that are minimize

total travel time per passenger

Page 34: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Power Grids

We might be interested in developing Power Systems that are Globally Robust to Local Failure

Page 35: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Campaign Contributions Networks

http://computationallegalstudies.com/tag/110th-congress/

Page 36: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

The United States Code

http://computationallegalstudies.com/

+

Hierarchical Structure

Page 37: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Some Recent Network Related

Publications

Special Issue: Complex systems

and NetworksJuly 24, 2009

Special 90th anniversary Issue:

May 7, 2007

Page 38: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

History ofNetwork Science

Page 39: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

The Origin of Network Science is Graph Theory

The Königsberg Bridge Problem the first theorem in graph theory

Is It Possible to cross each bridge each and only once?

Page 40: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

The Königsberg Bridge Problem

Leonhard Euler (Pronounced Oil-er) proved that this was not possible

Is It Possible to cross each bridge each and only once?

Page 41: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Eulerian and Hamiltonian Paths

Eulerian path: traverse each edge exactly once

If starting point and end point are the same: only possible if no nodes have an odd degree

each path must visit and leave each shore

If don’t need to return to starting pointcan have 0 or 2 nodes with an odd degree

Hamiltonian path: visiteach vertex exactly once

Page 42: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

ModernNetwork Science

Page 43: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Moreno, Heider, et. al. and the Early Scholarship

Focused Upon Determining the Manner in Which Society was Organized

Developed early techniques to represent the social world Sociogram/ Sociograph

Obviously did not have access to modern computing power

Page 44: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Stanley Milgram’s Other Experiment

Milgram was interested in the structure of society

Including the social distance between individuals

While the term “six degrees” is often attributed to milgram it can be traced to ideas from hungarian author Frigyes Karinthy

What is the average distance between two individuals in society?

Page 45: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Stanley Milgram’s Other Experiment

NE

MA

Page 46: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Six Degrees of Separation?

NE

MA

Target person worked in Boston as a stockbroker

296 senders from Boston and Omaha.

20% of senders reached target.

Average chain length = 6.5.

And So the term ... “Six degrees of Separation”

Page 47: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Six Degrees

Six Degrees is a claim that “average path length” between two individuals in society is ~ 6

The idea of ‘Six Degrees’ Popularized through plays/movies and the kevin bacon game

http://oracleofbacon.org/

Page 48: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Six Degrees of Kevin Bacon

Page 49: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Visualization Source: Duncan J. Watts, Six Degrees

Six Degrees of Kevin Bacon

Page 50: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

But What is Wrong with Milgram’s Logic?

150(150) = 22,500

150 3 = 3,375,000

150 4 = 506,250,000

150 5= 75,937,500,000

Page 51: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

The Strength of ‘Weak’ Ties

Does Milgram get it right? (Mark Granovetter)

Visualization Source: Early Friendster – MIT Network

www.visualcomplexity.com

Strong and Weak Ties (Clustered

v. Spanning)

Clustering ---- My Friends’ Friends are also likely to be friends

Page 52: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

So Was Milgram Correct?

Small Worlds (i.e. Six Degrees) was a theoretical and an empirical Claim

The Theoretical Account Was Incorrect

The Empirical Claim was still intact

Query as to how could real social networks display both small worlds and clustering?

At the Same time, the Strength of Weak Ties was also an Theoretical and Empirical proposition

Page 53: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Watts and Strogatz (1998)

A few random links in an otherwise clustered graph yields the types of small world properties found by Milgram

“Randomness” is key bridge between the small world result and the clustering that is commonly observed in real social networks

Page 54: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Watts and Strogatz (1998)

A Small Amount of Random Rewiring or Something akin to Weak Ties—Allows for Clustering and Small Worlds

Random Graphlocally Clustered

Page 55: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Different Form of Network Representation

1 mode

2 mode

Page 56: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Back to the Milgram

Experiment

Page 57: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

The Milgram Experiment

How did the successful subjects actually succeed?

How did they manage to get the envelope from nebraska to boston?

this is a question regarding how individuals conduct searches in their networks

Given most individuals do not know the path to distantly linked individuals

Page 58: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Search in Networks

Most individuals do not know the path to an individual who is many hops away

Must rely on some sort of heuristic rules to determine the possible path

Page 59: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Search in Networks

What information about the problem might the individual attempt to leverage?

visual by duncan watts

dimensional data:

send it to a stockbrokersend it to closet possible city to boston

Page 60: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Follow up to the original Experiment

available at: http://research.yahoo.com/pub/2397

Published in Science in 2003

Page 61: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)
Page 62: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

2 mode

Actors and

Movies

Different Forms of Network Representation

Page 63: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

1 mode

Actor to Actor

Could be Binary (0,1)

Did they Co-Appear?

Different Forms of Network Representation

Page 64: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Different Forms of Network Representation

1 mode

Actor to Actor

Could also beWeighted

(I.E. Edge Weights by Number of

Co-Appearences)

Page 65: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Features of Networks

Mesoscopic Community Structures

Macroscopic Graph Level Properties

Microscopic Node Level Properties

Page 66: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Macroscopic Graph Level Properties

Degree Distributions (Outdegree & Indegree)

Clustering Coefficients

Connected Components

Shortest Paths

Density

Page 67: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Shortest Paths

Shortest Paths

The shortest set of links connecting two nodes

Also, known as the geodesic path

In many graphs, there are multiple shortest paths

Page 68: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Shortest Paths

Shortest Paths

A and C are connected by 2 shortest paths

A – E – B - C

A – E – D - C

Diameter: the largest geodesic distance in the graph

The distance between A and C is the maximum for the graph: 3

Page 69: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Shortest Paths

In the Watts -Strogatz Model Shortest Paths are reduced by increasing levels of random rewiring

Page 70: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Clustering Coefficients

Clustering Coefficients

Measure of the tendency of nodes in a graph to cluster

Both a graph level average for clustering

Also, a local version which is interested in cliqueness of a graph

Page 71: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Density

Density = Of the connections that could exist between n nodes

directed graph: emax = n*(n-1)!(each of the n nodes can connect to (n-1) other nodes)

undirected graph emax = n*(n-1)/2(since edges are undirected, count each one only once)

What Fraction are Present?

Page 72: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

DensityWhat fraction are present?density = e / emax

For example, out of 12possible connections.. this graph

this graph has 7, giving it a density of 7/12 = 0.58

A “fully connected graph has a density =1

Page 73: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Connected Components

We are often interested in whether the graph has a single or multiple connected components

Strong Components

Giant Component

Weak Components

Page 74: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

NetlogoBasic Simulation

Platform for Agent Based Modeling & Simple Network

Simulation

http://ccl.northwestern.edu/netlogo/

Wilensky (1999)

HIV / VOTING Hawk/Dove(A Classic from

Evolutionary Game Theory)

Page 75: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Netlogo

Please DownLoad Netlogo as we will be using it occasionally

throughout this tutorial

http://ccl.northwestern.edu/netlogo/

Wilensky (1999)

Page 76: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Connected Components

Open “Giant Component” from the netlogo models Library

Page 77: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Connected Components

Notice the fraction of nodes in the

giant component

Notice the Size of the “Giant

Component”

Model has been

advanced 25+ Ticks

Page 78: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Connected Components

Model has been

advanced 80+ Ticks

Notice the fraction of nodes in the

giant component

Notice the Size of the “Giant

Component”

Page 79: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Connected Components

Model has been

advanced 120+ Ticks

Notice the fraction of nodes in the

giant component

Notice the Size of the “Giant Component”now = “num-nodes”

in the slider

Page 80: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Degree Distributions

outdegreehow many directed edges (arcs) originate at a node

indegreehow many directed edges (arcs) are incident on a node

degree (in or out)number of edges incident on a node

Indegree=3

Outdegree=2

Degree=5

Page 81: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Node Degree from

Matrix Values

Outdegree:

outdegree for node 3 = 2, which we obtain by summing the number of non-zero entries in the 3rd row

Indegree:

indegree for node 3 = 1, which we obtain by summing the number of non-zero entries in the 3rd column

Page 82: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Degree Distributions

These are Degree Count for particular nodes but we are also interested in the distribution of arcs (or edges) across all nodes

These Distributions are called “degree distributions”

Degree distribution: A frequency count of the occurrence of each degree

Page 83: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Degree Distributions

Imagine we have this 8 node network:

In-degree sequence:[2, 2, 2, 1, 1, 1, 1, 0]

Out-degree sequence:[2, 2, 2, 2, 1, 1, 1, 0]

(undirected) degree sequence:[3, 3, 3, 2, 2, 1, 1, 1]

Page 84: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Degree Distributions

Imagine we have this 8 node network:

In-degree distribution:[(2,3) (1,4) (0,1)]

Out-degree distribution:[(2,4) (1,3) (0,1)]

(undirected) distribution:[(3,3) (2,2) (1,3)]

Page 85: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Why are Degree Distributions Useful?

They are the signature of a dynamic process

We will discuss in greater detail tomorrow

Consider several canonical network models

Page 86: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Canonical Network Models

Erdős-Renyi Random Network

Highly Clustered Network

Watts-Strogatz Small World Network

Highly Clustered Highly Clustered

Barabási-Albert Preferential

Attachment Network

Page 87: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Why are Degree Distributions Useful?

Barabási-Albert Preferential

Attachment Network

Page 88: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Barabási-Albert Preferential Attachment

Netlogo Models Library --> Networks --> Preferential Attachment

Watch the Changing Degree Distribution

Page 89: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Barabási-Albert Preferential Attachment

Netlogo Models Library --> Networks --> Preferential Attachment

Page 90: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Barabási-Albert Preferential Attachment

Netlogo Models Library --> Networks --> Preferential Attachment

Page 91: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Barabási-Albert Preferential Attachment

Netlogo Models Library --> Networks --> Preferential Attachment

Page 92: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Barabási-Albert Preferential Attachment

Netlogo Models Library --> Networks --> Preferential Attachment

Page 93: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Barabási-Albert Preferential Attachment

Netlogo Models Library --> Networks --> Preferential Attachment

Page 94: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Readings on Power law / Scale free Networks

Check out Lada Adamic’s Power Law Tutorial Describes distinctions between the Zipf, Power-law and Pareto distribution

http://www.hpl.hp.com/research/idl/papers/ranking/ranking.html

This is the original paper that gave rise to all of the other power law networks papers:

A.-L. Barabási & R. Albert, Emergence of scaling in random networks, Science 286, 509–512 (1999)

Page 95: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Power Laws Seem to be Everywhere

Page 96: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Power Laws Seem to be Everywhere

Page 97: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

How Do I Know Something is Actually a Power Law?

Page 98: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Clauset, Shalizi & Newman

http://arxiv.org/abs/0706.1062

argues for the use of MLE instead of linear regression

Demonstrates that a number of prior papers mistakenly called their distribution a power law

Here is why you should use Maximum Likelihood Estimation (MLE) instead of linear regression

You recover the power law when its present

Notice spread between the Yellow and red lines

Page 99: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Back to the Random Graph Models for a Moment

Poisson distribution

Erdos-Renyi is the default random graph model:

randomly draw E edges between N nodes

There are no hubs in the network

Rather, there exists a narrow distribution of connectivities

Page 100: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Back to the Random Graph Models for a Moment

let there be n people

p is the probability that any two of them are ‘friends’

Binomial Poisson Normal

limit p small Limit large n

Page 101: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Random Graphs

Power Law networks

Page 102: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Generating Power Law Distributed Networks

Pseudocode for the growing power law networks:

Start with small number of nodes

add new vertices one by one

each new edge connects to an existing vertex in proportion to the number of edges that vertex already displays (i.e. preferentially attach)

Page 103: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Growing Power Law Distributed Networks

The previous pseudocode is not a unique solution

A variety of other growth dynamics are possible

In the simple case this is a system that extremely “sensitive to initial conditions”

upstarts who garner early advantage are able to extend their relative advantage in later periods

for example, imagine you receive a higher interest rate the more money you have “rich get richer”

Page 104: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Just To Preview The Application to Positive

Legal Theory ....

Page 105: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Power Laws Appear to be a Common Feature of Legal Systems

Katz, et al (2011)American Legal Academy

Katz & Stafford (2010)American Federal Judges

Geist (2009)Austrian Supreme Court

Smith (2007)U.S. Supreme Court

Smith (2007)U.S. Law Reviews

Post & Eisen (2000) NY Ct of Appeals

Smith (2007)U.S. Law Reviews

Page 106: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Some Additional Thoughts on the Question...

Page 107: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Back to Network Measures

Page 108: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Node Level Measures

Sociologists have long been interested in roles / positions that various nodes occupy with in networks

For example various centrality measures have been developed

Degree

Closeness

Here is a non-exhaustive List:

Betweenness

Hubs/Authorities

Page 109: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

DegreeDegree is simply a count of the number of arcs (or edges) incident to a node

Here the nodes are sized by degree:

Page 110: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Degree as a measure of centrality

Please Calculate the “degree” of each of the nodes

Page 111: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Degree as a measure of centrality

ask yourself, in which case does “degree” appear to capture the most important actors?

Page 112: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Degree as a measure of centrality

what about here, does it capture the “center”?

Page 113: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Closeness Centrality

Closeness is based on the inverse of the distance of each actor to every other actor in the network

Closeness Formula:

Normalized Closeness Formula:

Page 114: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Closeness Centrality

Page 115: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Closeness Centrality

Page 116: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Betweenness Centrality

Idea is related to bridges, weak ties

This individual may serve an important function

Betweenness centrality counts the number of geodesic paths between i & k that actor j resides on

Page 117: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Betweenness Centrality

Betweenness centrality counts the number of geodesic paths between i & k that actor j resides on

Page 118: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Betweenness Centrality

Check these yourself:

gjk = the number of geodesics connecting j & k, and

gjk = the number that actor i is on

Note: there is also a normalized version of the formula

Page 119: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Betweenness Centrality

Betweenness is a very powerful concept

We will return when we discuss community detection in networks ... If you want to preview check out this paper:

Michelle Girvan & Mark Newman, Community structure in social and biological networks, Proc. Natl. Acad. Sci. USA 99, 7821–7826 (2002)

High Betweenness actors need not be actors that score high on other centrality measures (such as degree, etc.)

[see picture to the right]

Page 120: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Hubs and Authorities

The Hubs and Authorities Algorithm (HITS) was developed by Computer Scientist Jon Kleinberg

Similar to the Google “PageRank” Algorithm developed by Larry Page

Kleinberg is a MacArthur Fellow and has offered a number of major contributions

Page 121: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Hubs and Authorities

We are interested in BOTH:

to whom a webpage links

and

From whom it has received links

In Ranking a Webpage ...

Page 122: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Hubs and Authorities

Intuition --

If we are trying to rank a webpage having a link from the New York Times is more of than one from a random person’s blog

HITS offers a significant improvement over measuring degree as degree treats all connections as equally valuable

Page 123: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Hubs and Authorities

Relies upon ideas such as recursion

Measure who is important?

Measure who is important to who is important?

Measure who is important to who is important to who is important ?

Etc.

Page 124: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Hubs and Authorities

Hubs: Hubs are highly-valued lists for a given query

for example, a directory page from a major encyclopedia or paper that links to many different highly-linked pages would typically have a higher hub score than a page that links to relatively few other sources.

Authority: Authorities are highly endorsed answers to a query

A page that is particularly popular and linked by many different directories will typically have a higher authority score than a page that is unpopular.

Note: A Given WebPage could be both a hub and an authority

Page 125: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Hubs and Authorities

Hubs and Authorities has been used in a wide number of social science articles

There exists some variants of the Original HITS Algorithm

Here is the Original Article : Jon Kleinberg, Authoritative sources in a hyperlinked environment, Journal of the Association of Computing Machinery, 46 (5): 604–632 (1999).

Note: there is a 1998 edition as well

Page 126: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Calculating Centrality Measures

Thankfully, centrality measures, etc. need not be calculated by hand

Lots of software packages ... in increasing levels of difficulty ... left to right

Difference in functions, etc. across the packages

easy: acceptsmicrosoft excel files

Medium: requires the .net / .paj

file setup

Hard: has lots of features

(R or Python)

Page 127: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Daniel Martin Katz Eric Provins!

Introduction to Computing for Complex Systems (Session XVII)!

Access A Full Step By Step

Tutorial for Pajek

The Slides From My Intro to Computing

for Complex Systems

Access Using this Tab

Page 128: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Network Analysis Software

Just Download Pajek and Use the Tutorial

You should download it to your personal machine

MAC Users Note: It is a PC only Program so you will need something like crossover or you will have to multiboot

http://pajek.imfm.si/doku.php?id=download

Page 129: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)
Page 131: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

!"#$%&'(#!%")#%)(%*+'#!",)(%*+-./)010#.*0)20.00!%")/3!!!4)

)))

*!(56.-)7)8%**6$!#%)!!))))))))))))))))))))))))))))))))&6"!.-)*6$#!")96#:))

!"#$%&'"()'*+,-.(!%$/0121(3'*4,"15(6,778%2*0(9'*'&:,%(

(!!"#$%&'(#!%")#%)(%*+'#!",)(%*+-./)010#.*0)

20.00!%")/3!!!4))))

*!(56.-)7)8%**6$!#%)!!))))))))))))))))))))))))))))))))&6"!.-)*6$#!")96#:))

!"#$%&'"()'*+,-.(!%$/0121(3'*4,"15(6,778%2*0(9'*'&:,%(

(!

!"#$%&''()*+,-../)(0#1+

2&%%&3+4#$#)5(3+6&$7&1+38(91#7:+!"#$%&'(")*+,&*$%&'-.//(")*#$001"(+2*3+'1#+1'&*$4*#$0/-&5*"&+6$'73*("*".+1'&*."8*3$#(&+2*

9.+1'&++;<=3+>??=:+

@(9A&#%+B:+C-..&$(D-+EE3+4&)(#%+@&$0)+F&DG+

Page 132: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

!"#$%&'$()(*%+,-"(."/0%'$(

!  !"#$%&'((“1(2/'3,('4($'5"0(6716(1/"(!"#$%&"#'()"*+"#'(8'$$"86"5(6'("$,-(./-"!(936(+0$!+"#'(8'$$"86"5(6'(./-"!(5"$0"(2/'3,0(%$(67"($"6:'/;”(!  <'/6"/=(>$$"-1=(?3871@((1.223*4%"+(4*(5"/6.!7+@(A'&8"0(6'(67"(B?*=(CDDE8(

!  )*$+,&-.(/!  F-%G3"0(%$(1(7%27(087''-(0'8%1-($"6:'/;(!  .'&$2(8'1-%&'$0(%$(F'$2/"00(!  F'$03+"/(6H,"0(%$(1($"6:'/;('4(8'I,3/8710"0(

?%871"-(J@(K'++1/%6'(LL=(!1$%"-(?1/&$(M16N(

Page 133: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

!"#$%&'()(*+,-#&(.'/0+123(

!"#$%&'()*%+(,-#.*(/0(

4-,5#'&(67(8+$$#1-/+(99:(;#<-'&(4#1=<(>#/?(

Page 134: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

!"#$%&'()(*+,-#&(.'/0+123(

!"#$% &#'$()*% +,-"$% #./'$% $"/% &()+#0(1% (&%&),/12*",3*%,1%#%",-"%*'"((4%*(',#4%1/$5()67%%82/#*9%%45'6((7'89'16(:&#336(;#,'6(<8/'1'3/3(

(:(5% +,-"$% 5/% #**,-1% '(++;1,0/*% $(% $",*%1/$5()67%(

%%%%((

</)0'/*=(>'+%&'(=2-/*=(?1-'893@-%(

A-,@#'&(BC(D+$$#1-/+(<<6(E#8-'&(A#1F8(G#/H(

Page 135: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

!"#$%&'()(*+,-#&(.'/0+123(

!"#$% &#'$()*% +,-"$% #./'$% $"/% &()+#0(1% (&%&),/12*",3*%,1%#%",-"%*'"((4%*(',#4%1/$5()67%%82/#*9%%45'6((7'89'16(:&#336(;#,'6(<8/'1'3/3(

(:(5% +,-"$% 5/% #**,-1% '(++;1,0/*% $(% $",*%1/$5()67%(

%%%%((

<,)4*%

=(>*%

?/)0'/*=(>'+%&'(@2-/*=(?1-'893@-%(

A-,@#'&(BC(D+$$#1-/+(<<6(E#8-'&(A#1F8(G#/H(

Page 136: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

!"#$%&'()(*+,-.(/+#&0,+-1(

2034#'&(56(7+$$#809+(::;(<#-0'&(2#8,-(=#9>(

!"#$%"&?(@'+%&'('()"&?(/+AB+9'C((((((((#9(&'#19(+-3'(

*+,-."/’&-.++0-1/-/2"-&13"-4"/,+#0-1&-56-5/-#"7#"&"4/"(-%+89+$4)-54-/2"-:"41/";--<("1&=-:11D'(%+10,+-;(.'+.8#%4E;('94-0309E;(.'-C'8(->+,-35)2/-,"-1&&5)4-%+33?45$"&-/+-/25&-4"/,+#0@----((

Page 137: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

!"#$%&'()(*+,-.(/+#&0,+-1(

!"#$%&'()*+,

-"./(0)1+,

2-3'%'-3'-41(

5067#'&(89(:+$$#;04+(22<(=#-0'&(5#;,-(>#4?(

2"03("+@(A'+%&'(456"+@(/+BC+4'3((((((((#4(&'#14(+-6'(

7/8,&"1’+,&//9,)1,1:",+).",*"18/09,)+,';,'1,0"#0"+"*1"5,(/<=/3*6,'*,1:",>"*)1"?,,@5")+A,211D'(%+10,+-<(.'+.;#%7E<('47-0604E<(.'-3';(,B/8,.'6:1,8",)++'6*,(/..$*'3"+,1/,1:'+,*"18/09C,,,,((

Page 138: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

!"#$%&$'(

!"#$%#&'#%($%&')$%'**+,-$.%/"001-+#2%0$03$4*&+5%.+6$4$-#72%%%%.$*5+#$%"3*$4)+-,%#&$%!"#$%&'"()*%%8"001-+#2%.$#$/9"-%+*%-"#%'%/"-/$5#%#&'#%/'-%3$%.+)"4/$.%:4"0%/"-#$;#<%((

)*+,-%.(/0(1"22-3*$"(445(6-#*%.()-37#(8-$9(

Page 139: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

!"#$%&$'($))*

!"#$%&'(&#) *$%&'(&#)

+"%,-$.*/0*1233-#"&2*445*!-("$.*+-#6(*7-&8*

Page 140: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

!"#$%&$'($))*

!"#$%&'()*+,%+*%#*(%-#.*/0*/"('%+-/'.1*#2%*%!"#$%&'()*+,%()"(%+*%-#.*/0*/"('%+-/'.1*#%+*%#*(%"33*4%5*/%6-+-/'.('+%'+7',8%*%9-:'/'#(%,*;4"/'%0".<"7',%&"$%-&03'&'#(%()'%,"&'%“&'()*+”%4-()%*/%4-()*=(%,=00*/(%5*/%+-/'.('+%'+7',8%

+"%,-$.*/0*1233-#"&2*445*!-("$.*+-#6(*7-&8*

Page 141: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

!"#$%&'(

!"#$%&'($)* +$%&'($)*

• ()#*+,-(,".+/0*'%#1'(• (2+&+(.#3#&+/0*'(

• (4".+/0*'%#1('&,"*$&%(• (5,"67"*8-(09(,".+/0*'%#1(• (5.0:(

;#8%+".(<=()033+,#&0(>>?(2+*#".(;+,/*(@+&A(

Page 142: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

!"#$%&'(

!"#$%&'($)* +$%&'($)*

• ()#*+,-(,".+/0*'%#1'(• (2+&+(.#3#&+/0*'(

• (4".+/0*'%#1('&,"*$&%(• (5,"67"*8-(09(,".+/0*'%#1(• (5.0:(

,-($*$)&$*('%./"$001*

;#8%+".(<=()033+,#&0(>>?(2+*#".(;+,/*(@+&A(

Page 143: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

!"#$%&'(

!"#$%&'()*+,%+*%#*(%-#.*/0*/"('%'+1'%2'-1)(,3%(!'()*+,%()"(%+*%-#.*/0*/"('%'+1'%2'-1)(,%&"$%+-4'/%-#%"..'0("56'%7"68',3%• ()*&"$"+'(,+(+"-.(/"#$%&'(• (0&+#1&.2(3,'#45"(/"#$%&'((9-4'/'#(%,*:2"/'%0".;"1',%&"$%-&06'&'#(%()'%,"&'%“&'()*+”%2-()%*/%2-()*8(%,800*/(%<*/%2'-1)('+%'+1',=%

6#1%-".(78(9,::-+#&,());(<-*#".(6-+4*(=-&>(

Page 144: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

!"#$%&'$()

!"#$%&'$()*#)+),$(,"-.)*(/"0*."1)20$3)$-',#4))5,,$01*(6).$)7*8*9)!!!"#$%&'()*+&,#+-'"#$%&'(#$!)*#!+(',')-!./!+0!'1+2'02!$-$)#1!!!!).!&#$.,3#!"#)+',!'0!)*#!.(4#%)!)*+)!'$!(#'02!'1+2#"5!!!

!"#$%&'()*+,)-.% /)0%&'()*+,)-%

• ):+()3+8")$&.)3+(;)1".+*%#<)=>?4>@AB)• )C&.D)

• )E".+*%#)3+;)F")($*#")• )G$3"'3"#)./";)1$(’.)3+H"0<))

• ):+(’.)0"+1)+)I$01<)• )C&.D)

• ):+()2$,&#)$()F0$+1)0"6*$(#)• )J$*#")*#)$&.)$2)2$,&#)

@*,/+"%)K4)C$33+0*.$)LL9)E+(*"%)@+0'()M+.N)

Page 145: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

!"#$%&'$()

!"#$%&'()*+,)-%./"0&)(0)1"02% 3)4%&'()*+,)-%./50&)(0)1"02%

*+,")-.+/0#1)

2340+"%)56)7$,,+.38$)99:);+(3"%)2+.'()<+8=)

Page 146: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

!"#$%&'$()

!"#$%$&'()*+,')$-$-(,%(./$-0,&-(1,%%$-+,&2(',(2"#$%$&'(((%$-,3/0,&-4((!"#$%$&'(5$'),2-(6%$(5,%$(,%(3$--($#$107$(6'(2$'$10&8((((1,55/&"'*(-'%/1'/%$(6'(2"#$%$&'(%$-,3/0,&-4()9,2/36%"'*:;6-$2(5$'),2-(!"##$%&2$'$1'(-'%/1'/%$(;$3,<(((6(=&,<&(%$-,3/0,&(3"5"'4(

*+,-."%)/0)1$22.3+4$)556)7.(+"%)*.3'()8.49)

Page 147: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

!"#$%&''()*+,-../)(0#1+

2&%%&3+4#$#)5(3+6&$7&1+38(91#7:+!"#$%&'(")*+,&*$%&'-.//(")*#$001"(+2*3+'1#+1'&*$4*#$0/-&5*"&+6$'73*("*".+1'&*."8*3$#(&+2*

9.+1'&++;<=3+>??=:+

@(9A&#%+B:+C-..&$(D-+EE3+4&)(#%+@&$0)+F&DG+

Page 148: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

!"#$%&'(")'*+!"#$*,-.&/+0,12,34,2+

!"#$%&'(")'*+,"#$*-./&0+/1+'+1-2/"%1+/11%-3+

++++

5'&'+ .3+ 6,7"#.)8+ #"2,+ '6%)9')&+ ')9+ #"2,+9,&'.*,9:++;')/+ <%')(&'(=,+ 2,3,'274+ $2">,7&3+ 4.)8,+ ")+&4,+1,'3.6.*.&/+"1+7'*7%*'(")3:++?)9,23&')9.)8+ 7"#$%&'(")'*+ 7"#$*,-.&/+ 7')+'**"@+/"%+&"+7"##%).7'&,+@.&4+9,$'2&#,)&+AB+$,23")),*+"2+7"#$%&,2+37.,)(3&3+&"+3"*=,+/"%2+$2"6*,#:++4'5-+ 1%2-+ 0"%2+ $2"6-,&+ /1+ 7-'1/8*-+ 8-7"2-+,"##/9):+&;-+(#-3+++

;.74',*+C:+D"##'2.&"+AAE+5').,*+;'2()+F'&G+

Page 149: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

!"#$%&'(")'*+!"#$*,-.&/+0,12,34,2+

!"#$%&'(")'*+5"#$*,-.&/+.)+&4,+5")&,-&+"1+#"6,2)+5"#$%()7+.3++++$2.#'2.*/+1"5%3,6+")+&8"+2,3"%25,39++!"  #$%&'(#:"8+*")7+6",3+.&+&';,+&"+$,21"2#+'+3,<%,)5,+"1+"$,2'(")3=+

•  !>?@A>?+•  B-'5&+C3D+'$$2"-.#'&,+3"*%(")3+#

)"  #*+,-./'(#:"8+#%54+3$'5,+6",3+.&+&';,+&"+3&"2,+"%2+$2"E*,#=#•  F,#"2/+')6+“$,23.3&,)&”+3&"2'7,+G&"+'+*,33,2+6,72,,H+•  I'&'+2,$2,3,)&'(")3+

J,+&,)6+&"+5"##%).5'&,+(#,+')6+3&"2'7,+5"#$*,-.&/+&42"%74+“K.7LM+)"&'(")D”+

F.54',*+ND+K"##'2.&"+OOP+I').,*+F'2()+Q'&R+

Page 150: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

!"#$%&'(")'*+!"#$*,-.&/+0,12,34,2+

5)+6"#$%&'(")'*+6"#$*,-.&/7+“8.9:;+)"&'(")”+6")<,/3+.)1"2#'(")++++'="%&+4">+(#,+')?+3&"2'9,+6"3&3+36'*,+>.&4+.)$%&3@++• +!"#$A+6")3&')&+:+.)?,$,)?,)&+"1+.)$%&+• +!"%$A+36'*,3+*.),'2*/+>.&4+&4,+3.B,+"1+.)$%&+• +!"%&'$A+36'*,3+C%'?2'(6'**/+>.&4+&4,+3.B,+"1+.)$%&+• +!"%&($A+36'*,3+6%=.6'**/+>.&4+&4,+3.B,+"1+.)$%&+

D4,3,+&,2#3+"E,)+"66%2+>.&4+)*+,%,&,2#3+++')?+'2,+&4,)+9.<,)+&4,+$2,F-+“C%'3.:@”+

G"2+92'$4+'*9"2.&4#37+&4,+.)$%&+%+.3+&/$.6'**/++• -.-7+&4,+)%#=,2+"1+<,2(6,3+• -/-7+&4,+)%#=,2+"1+,?9,3+

++++

H.64',*+I@+8"##'2.&"+557+J').,*+H'2()+K'&B+

Page 151: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

!"#$%$&'($)(*+,-$./(

!-0/(,"#$%$&'($)(&+,-$./()$11$2/(,-+(-0/,$3'($)(,-+03(.+4+1$5&+%,6(!• "#$#%#$&!'&()*+%!

•  7.8+9:+,2++%%+//(;<==<>((

• '*+,-./#(0!'&()*+%(•  ?"/,983++.'(;<==@>(•  A+".0%8(708+%4+B,$3(;<==C>(

• "01.2#3!'&()*+%!•  D10EF+(5+3B$1"G$%(;<==H>(•  I"1J,3"5(;<==H>(

*0B-"+1(K6(L$&&"30,$(MMN(O"%0+1(*"3G%(P",Q(

Page 152: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

!"#$%&$'($$))$**%

!"#$%&'()*+,-.//+,-./)0%1$(2/)!""#$%%&'()*"+),&-)&,."('"+$-(/0"/'1"2($0$3(-/0"'.)4$,5+3%%41560%78873%/0',%&/123'.//9,.,"$%':$%)$'(;-<%,)';%*=>*$?=$)'@A%*2/@@$-%B,$C$*%>A%D)",)#%$"#$*%':/'%“>-,"#$”%C;22=),E$*3/%4)*,56'%*5,.///• /F/)%>$%/"/B'$"%';%",-$C'$"%)$'(;-<*%G,#-/B:H3%• /F/)%>$%/"/B'$"%';%($,#:'*%G);%B=>@,C%*;I(/-$H3%%7%83/4)89$3:%5;./67898:;<",)%#$)$-/@0%67898:="0$3"898<%J;-%*B$C,/@%C/*$*!

K,C:/$@%L3%&;22/-,';%MM0%9/),$@%K/-E)%N/'O%

Page 153: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

!"#$%&$'($$))$**%

!"#$%&'(%)*)("+%

+,-./$0%12%&344/5,'3%667%8/),$0%+/59)%:/';%

Page 154: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

!"#$%&'(#)*&+&,-$.’(&/-0-1*&23"4&

!"#$"%&'()*"%"+,)-./05&67$#-3&8*1970%&7:&:0#*8)(.#;(&4*19**8&<=&>*>4*0(&7:&-&%-0-1*&$3"4&-1&-&?6&"8#@*0(#1A&#8&1.*&BCDE(&

12,3+4)F"0#8G&1.*&74(*0@-H78&;*0#7)I&1.*&$3"4&407%*&#817&J&(>-33*0&$3"4(K&&L.#(&(;3#1&7$$"00*)&-378G&-&;0*M*N#(H8G&(7$#-3&)#@#(#78&4*19**8&1.*&197&“$7>>"8#H*(”&#8&1.*&8*1970%K&

&5%"63)7%89)+$,):";,%4),-$.-0AK&!"#$"%&'()*&"#+&,#(&-./#%&'#0&"+$01#)"-#233$&"#$"#

3()//#4'&5637&O7"08-3&7:&'81.07;737G#$-3&P*(*-0$.&<<I&BCDDK&

5863.8"<)+$,)5"+"4).Q;5RR999M;*0(78-3K">#$.K*)"RS>*T8R8*1)-1-R&

&&&

&

&&

U#$.-*3&OK&V7>>-0#17&WWI&F-8#*3&U-0H8&/-1X&

Page 155: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

!"#$%&$'($$))$**%

+),-%./*0,1**/20134)%

5/061$,%78%&4..19/'4%::;%<1)/$,%5193)%=1'>%

Page 156: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

!"#$%&$'($$))$**%

&$'($$))$**%'$)"*%'+%#$'%',$%-.#%/.0'12$%2.#,'3%%%%4+($5$26%2$*+718+)%09)%-$%9%/2+-7$:;%%%%<+%)+'%"29(%0+)071*.+)*%9-+1'%*:977%0+::1).8$*%=2+:%',.*%97#+2.',:%97+)$3%

>.0,9$7%?3%&+::92.'+%@@6%<9).$7%>928)%A9'B%

Page 157: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

!"#$%&'()*+

!• +!+(,+)-.+/$01.'+"2+.#3.,+(/+0"#$%.+"##• +$+(,+)")&%+#.3'..+"2+4.'56.,+(/+0"#$%.+"++• +%+(,+)-.+)")&%+/$01.'+"2+.#3.,+(/+/.)7"'8+!"!#$!%#&'(')*'!+',-'')!.+$'(/'%!*.))'*0/#,1!-#,2#)!3.%45'$!6)%!78!9.(!,2'!*.):;4(60.)!3.%'5!<%';(''=%#$,(#+40.)!:>'%?!!

!(6-&.%+9:+;"00&'()"+<<=+>&/(.%+!&'5/+?&)@+

Page 158: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

!"#$%&'()*+

,-.-./-'+"$'+0'-1("$2+#(23$22("4+"4+3".0$)&5"4&%+3".0%-6()*7++

!"#$%&'()*+.&6(.(8&5"4+(2+&4+!"#$%&'()&*+,-.9++

:;(2+.-&42+);&)+);-'-+(2+4"+0"%*4".(&%+'-0'-2-4)&5"4+"<+5.-+3".0%-6()*=++

/,,(.-0$*'1(0$-&-2*&-(0&3(0*(1*,4-(2*&(%))&*56.%0-(1*,78*91:(++

!(3;&-%+>9+?"..&'()"+@@A+B&4(-%+!&'54+C&)8+

Page 159: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

!"#$%&'()*+

!(,-&.%+/0+1"22&'()"+334+5&6(.%+!&'76+8&)9+

1.6:&2(6+;0+<""#4+=>.?@A%.B&6#'.+#.+!"6):"*.+C+A&'"6+D%&$?.)4++E-.+F.'G"'2&6,.+"G++!"#$%&'()*+!&B(2(9&7"6+(6+F'&,7,&%+D"6).B)?4+F-*?0+H.>0+I+JK4+LMNKLN+OPLKLQ+

+

Page 160: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

!"#$%&'(()*%

!"#$%&'()*+,-.//• %+(,-"./%%!"#$%"&'()*$+,%-()%./$/012'%0(,,32*$4%#$)30$3)/%*2%2/$5()6#7%01*#/%2(3/%45%6778/%• %9:";#($5%+(,-".5%<=='(/%%!*2.*2'%0(,,32*$4%#$)30$3)/%*2%8/)4%&")'/%2/$5()6#7%01*#/%2(3/%%45%6778/%• %>"?@$"5%A#;';-@/%!*2.*2'%9(,,32*$4%:$)30$3)/%*2%;/'"<#0"&/%:(0*"&%=/$5()6#7%677B/%%%0',%&/123'.////A'*%$=%'".)=-:*%"##(-C:(%"%:"'D('%".)%:"'D('%E=--;.@F(#%G'=-%$1(%D'=;.)%;H/%%I$"'$%C*%H:"[email protected]%("E1%3('$(J%@.%@$#%=,.%E=--;.@$*%".)%$1(.%E=-C@.(%E=--;.@F(#%$1"$%H'=);E(%$1(%C(#$%-=);:"'@$*%"$%$1"$%#$(H//%4)*,56'%*5,./• /9".%C(%")"H$()%$=%)@'(E$()%()D(#%K.=%H;C:@EL/%• /9".%C(%")"H$()%$=%,(@D1$#%K@D'"H1L/%%7%83/4)89$3:%5;./>?@A@@B@%&('%@B@C%,='#$%E"#(%

<@E1"(:%M/%N=--"'@$=%OO5%P".@(:%<"'F.%Q"$R%

Page 161: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

!"#$%&'(()*%

!"#$+&'(()*%",#-%$(.)#%$-%"//'(##01(,*%2'("$(%,"'/('%2-334.05(#%$-%$6(%)($'03(.$%-7%#3",,('%2-334.05(#8%

96*%0#%$60#%.-)(%'()%0.#$(")%-7%:,4(;%

<026"(,%=8%>-33"'0$-%??@%A".0(,%<"'5.%B"$C%

Page 162: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

!"#$%&'()%'"&*"+,-.(

!"#$%&'()*+,-.//• (/"01#&2(!"#$"#%&'())*#"+,&-+.*'+*./&"#&#/+0(.1-&*-"#%&+2/&/"%/#3/'+(.-&(4&)5+."'/-6&34562(7"*2()8(9::;2(• (!"%+4,8(/"01#&2(7())*#"+,&-+.*'+*./&"#&$"./'+/$&#/+0(.1-6&34562(7"*2(!"<28(9::=2&(0',%&/123'./>6"(,4"(6%'&(-&(,4"(+-1?-&"&,6(-@(,4"(A"#$%&'("%'"&*"+,-.(-@(,4"(!#?A#+%#&(,-(6"BC"&D#AA5($%*%$"(,4"(&",0-.E2((4)*,56'%*5,./• /F#&(G"(#$#?,"$(,-($%."+,"$("$'"6(H&-(?CGA%+I2(• /F#&(G"(#$#?,"$(,-(0"%'4,6(H%'.#?4I2((7%83/4)89$3:%5;./89:;:<=>(

J%+4#"A(K2(L-11#.%,-(MM8(N#&%"A(J#.D&(O#,P(

Page 163: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

!"#$%&'()%'"&*"+,-.(

/-,"( ,0#,( "%'"&*"+,-.’1( ."123,1(1""4( ,-( 153%,( ,0"( $%6"."&+"(7",8""&( "$'"( 7",8""&&"11( #&$(9#1,:'.""$;(%&(,0%1(+#1"<(

=0;(#."(,0"1"(&-$"1(&-,(#(5#.,(-9(,0"(3#.'".(4-$23"1>(

?%+0#"3(@<(A-44#.%,-(BBC(D#&%"3(?#.E&(F#,G(

Page 164: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

!"#$%&"'(

!"#$%&'()*+,-./)*+,-(."%"'/0(!"#$%&'()*"##%'+&,-)+')./0(,)',12"03-)%-+'()0/'4"#)2/.3-5)1233-(45560((0',%&/123'.//789:#"%;(9"+/(,<*&%(&"+=*9(>"#$,(*+(%<;(+;%>*&$("+=(?*9':%;('"8&>8,;(,898#"&8%/(9;",:&;,(@",;=(*+(%<;,;(>"#$,0((A,;(%<;,;(,898#"&8%/(B"#:;,(%*("CC&;C"%;(B;&D?;,(8+%*(?*99:+8D;,0((4)*,56'%*5,./• (E"+(@;("="'%;=(%*(=8&;?%;=(;=C;,(F8C&"'<G0(• (E"+(@;("="'%;=(%*(>;8C<%,(F8C&"'<G0(• (E"+("#%;&(&;,*#:D*+(@/(>"#$(#;+C%<(F8C&"'<G0((7%83/4)89$3:%5;./=;';+=,(*+(>"#$(#;+C%<-(67898:;)."()898<)1=$+*/..=)

H8?<";#(10(I*99"&8%*(JJ-(K"+8;#(H"&D+(L"%M(

Page 165: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

!"#$%&"'(

)*+,"-#(./(0122"&*%1(334(5"6*-#()"&76(8"%9(

Page 166: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

!"#$%&"'(

!"#$%&"'("))*+,)(-.&/0.)(%1(2*3.&.,%(01445,*/.)(%6",('&.-*15)("#+1&*%64)7((81%.(%6"%(%6.()*45#"%.2(9"#$(#.,+%6(0",(:.(06",+.2(%1("#%.&(&.)1#5/1,7((!"#$%&#'(#&)*+,'"-./(0*,+*+$(1%.+/1*.02*$%"+*#&+"-$+*'.3*1%.04&*&5&0*.6&#*78,04*$%&*9.-:*-&04$%*.02*,0;"$*4#.;%<*((

;*06".#(<7(=144"&*%1(>>?(@",*.#(;"&/,(A"%B(

Page 167: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

!"#$%&'(%)*+,-.%/'

!"#$%&$'($$))$**+ ,-*'%./$$"0+

1$-"2)#+!2#$)3$4'5/+6-78'/-9+

!-0$+"1'23'4%))+,-#%'556'7+/-"1'!+,8/'9+#:'

Page 168: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

!"#$%%"&'"'()$*+,-"(.(/0-,12(

• (3$-"(4/5-,-67(3(• (8&9"-:,#";7(<692$&=(!=(!>56((• (?",9>-";7(@-,12($1"-,A$&;(B(,C0$-/92%;=(-,&'$%(0-,12(0"&"-,A$&=(0-,12(;9,A;A#;=(#$%%>&/96('"9"#A$&=(D/;>,C/E,A$&(C,6$>9=(1C$F&0(• (G!47(2H17II/0-,12J;$>-#":$-0"J&"9I(• (K$#>%"&9,A$&7(2H17II/0-,12J;$>-#":$-0"J&"9I'$#>%"&9,A$&J29%C(

(

L/#2,"C(MJ(N$%%,-/9$(88=(K,&/"C(L,-A&(O,9E(

Page 169: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

!"#$%&'()*+,-.(/-012'(3-4'(

562,#'&(78(9-$$#16+-(::;(<#.6'&(5#1=.(>#+?(

Page 170: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

!"#$%&"'(#)(*#++,$-./(0&.&1%#$2(3&+4#"56(7&.8#"9(0/$5+-1'(

:-1;5&6(<=(>#++5"-.#(??@(05$-&6(:5"%$(A5.B(

Gergely Palla, Albert-Laszlo Barabasi & Tamas Vicsek, Quantifying Social Group Evolution, Nature 446:7136, 664-667 (2007)

Page 171: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

!"#$%&'#(!$)!*$++,%-./!0'.'1&$%2!

*$++,%-./!3.#,1.,#'!45'#!3167'(8!9-+'!:'#-$;8!'.1<!!

=-1>6'7!?<!@$++6#-.$!AA8!06%-'7!=6#&%!B6.C!

Science 14 May 2010, Vol. 328. no. 5980, pp. 876 - 878

Page 172: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

!"##$%&'()*+'+,-"%).+/&+0)12-,3+4)

!"#$%&'$()*%+$,-$.%/012*$'3%%% Mason A. Porter, Jukka-Pekka Onnela and Peter J. Mucha. 2009. “Communities in Networks.” Notices of the American Mathematical Society 56: 1082-1166. ))Santo Forunato. 2010. “Community detection in graphs.” Physics Reports. 486: 75-174.)

5&,67+3)89):"##72&'");;<)*7%&+3)572-%)=7'>)

Page 173: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

!"#$%&'($)*+,#$-)./0&1*$2$$$

3&1.*,4$56$7899*#&:8$;;<$=*'&,4$3*#>'$?*:@$

We Will Discuss This Later ...

Page 174: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

In Both Citation and Social Networks -- Algorithm Choice Matters

Page 175: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)
Page 176: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

!" #$%&'( ! ) ! *+""&,#-+ ! # # ! ! ! ! ! ! ! ! ! .&/ #'( !"&,- #/ !0&-1 !

!

!"#$%&'"()'*+,-.(!%$/0121(3'*4,"15(678,%'%9$/(:$%",;(<-$84(3,"'/1(=!">(

(#

Page 177: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

!"#$"%&$'$()*+$,-./0$1+23+4$

567%")"8'9$:'"#%;$<*'7=$>%#)9?$@!"A$

!  B-"C)*D$B'"#/%/0D$E-F?D$<%%#*)'-D$>%**.?G$$#$%&'()(*+,-+%#(./(01.2(31&45+.#(+67(81+%6/9#(:;!/6#6<+5=0+&15>(?/7#59(@/$(A#.B/$-9D$HIIJG$

!  K5:<>$;'+$C=)"$3)$-?)#$C%$-"#)*?C'"#$'$7'*8/-9'*$

7=)"%;)"%"$%*$C%$?.;-9'C)$")&$*'"#%;$*)'9.L'8%"?$%M$

")C&%*0?$C='C$*)C'."$C=)$)??)"8'9$7*%7)*8)?$%M$C=)$%*.N."'9GO$

!  KP=)$7-*7%?)$%M$5:<>D$."$'$"-C?=)99D$.?$C%$#)?/*.3)$

7'*?.;%".%-?9+$C=)$9%/'9$?)9)/8%"$M%*/)?$C='C$?='7)$C=)$

N9%3'9$?C*-/C-*)$%M$'$")C&%*0GO$

$

$

>./=')9$QG$E%;;'*.C%$RR$D$S'".)9$>'*8"$T'CL$$

Page 178: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

!"#$%$&#'()*"+,-.(/,0*'%(

!  !"#$%(123'#45(%,6*(0*3*50*5"(7*&",-(!"45("*-6%(,8(#(%*"(,8(450*3*50*5"(7#-4#9'*%(45(#$"!  %&'("()*+,("-./'0'.1"2"'34("5*(3"16716((')+".+.08('(9"

!  &'(')*')+,-#./#0$'%(::(";*(%*"(,8(*0<*%(!  :(&#5(9*(";,=<;"(,8(#%(#(6#"-42(>*-5,=''4(7#-4#9'*%(6';5((4504&#$5<(#5(*0<*(*24%$5<(9*"+**5(7*-$&*%('"#50(5"

!  ?504-*&"*0(<-#3;%(;#7*(%@66*"-4&(::(04-*&"*0(<-#3;%(0,(5,"(5*&*%%#-4'@A(

/4&;#*'(BA(>,66#-4",(CC(:(D#54*'(/#-$5(E#"F((

Page 179: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

!"#$%$&#'()*"+,-.(/,0*'%(

!  !"#$%&'$()('$('*+!  !"#$((1%(120*3*20*2"(,4(!%#&'!  ,#-"+5("61%(7,0*'(1%(89%"(%"#20#-0(',:1%$&(-*:-*%%1,2;(

!  !"#$%$()('$('*+!  !"#$((1%(()*'(!+!,,-."&/'120*3*20*2"(,4(!%#&'!  .#/$+<("61%(7,0*'(-*=91-*%(%,7*"612:(7,-*(>*?1@'*("6#2(-*:-*%%1,2;(

/1&6#*'(AB(C,77#-1",(DD(E(F#21*'(/#-$2(G#"H((

Page 180: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

!"#$%$&#'()*"+,-.(/,0*'%(

!  1,+(0,(+*(0*#'(+2"3(04#050*6*70*7&*8(

!  9*(3#:*(!(,7(;,"3(%20*%<(+32&3('*#0%(",(&,=6'*>(?**0;#&.%@(

!  /,0*'(0*A*7*-#&4(#70(=2%5%6*&2B&#$,7(#;,C70D(

/2&3#*'(E@(F,==#-2",(GG(<(H#72*'(/#-$7(I#"J((

Page 181: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

!"!"#

! !"!"$#!  !"##%#!&'()*#"+&,-##!  !"$#%#!)-./#"&'0)#

!  %&'()*+,-&.**!  1&(/#&#'&-2)3#4&0(#.+')56+#2,7.',859)-:7;&</#4+/'/#.+/#4&0(=7#/>5,0,8',53#,7#)5'#

.&'6/.#0,(/0,+))2#2,7.',859)-#!  ?85.#+)4#2)#4/#2/<,2/#+)4#.)#.&(/#)5'#'&-2)3#4&0(@#!  ?&-2#+)4#3&-A#'&-2)3#7./;7#2)#4/#-//2#.)#.&(/@#

!,<+&/0#BC#D)33&',.)#EE#F#G&-,/0#!&'9-#H&.I##

Page 182: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

!"!"#

!  $%&#'%#&()*+#!  !,'-%.%)/01$(023405#

" !%6,#(3#,.0/)%3#/3#0'(',10.(7,##

"  877,.'#%-#-,9,7'#':,#;%6,#<,.,3</34#%3#':,#=-,9,72%3#;,':%<>#

!  ?/@@0#A(;.)/34#

" B:('#/C#&,#*3,&#':,#7%3</2%3()#</0'-/@D2%30+#

"  E@D'#&:('#/C#':,-,#/0#3%#.(':#@,'&,,3#-,4/%30#%C#':,#0'(',10.(7,#()%34#

7%3</2%3())F#0(;.),<#.(':0+#

"  E%-#&:('#/C#':,#-/4:'#.(':#%77D-0#&/':#0D7:#(#)%&#.-%@(@/)/'F#(0#'%#@,#D31

0(;.),(@),+#

!/7:(,)#GH#I%;;(-/'%#JJ#K#L(3/,)#!(-23#M('N##

Page 183: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

!"#$%&%$'$'%

! ()*+%,-./%$'$'%0.*1%2-3%!"#$4%!  50*671.%72%.*8)%/+*+.%9.3.%*%:-//7;<.%63*:)=%!  (.%8-><,%6.1.3*+.%*%<7?.<7)--,%,7/+37;>@-1%-A.3%:-//7;<.%63*:)B%!  (.%*</-%-;+*71%$'$'%/+*1,*3,%.33-3/C%<.D16%>/%+)71?%*;->+%->3%8-.E87.1+%./@0*+./%*/%0-3.%+)*1%F>/+%:-71+/G%

!  H)7/%*<<-9/%>/%+-%>/.%<7?.<7)--,%71%*<<%+).%3.6><*3%9*I/%J97+)%*%:3-:.3<I%/:.87K.,%0-,.<LG%

$78)*.<%MG%N-00*37+-%55%C%O*17.<%$*3@1%P*+Q%%

Page 184: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

!"#$%#&'($%$")%*+,-%

!  ,'%."#$%/0$)1)2304%$"/042%5#0%.)%$"1'.%'0%$")%*+,-%!  622'1$#37)%8/9/04%./$"%2"#1):%7)1$)9%#;1/&($)2%!  <)02/$=%%!  >?(2$)1/04%5')@5/)0$%A%0(8&)1%'B%$1/#04?)2%!  C#$"%?)04$"%:/2$1/&(3'0%!  D:4)./2)%2"#1):%E#1$0)12%!  F)'8)$1/5#??=G.)/4"$):%):4)./2)%2"#1):%E#1$0)12%H2#B)1IJ%!  K%!  60=%7#1/#&?)%='(%5#0%5':)%='(12)?BI%

L/5"#)?%MN%O'88#1/$'%PP%Q%<#0/)?%L#130%R#$S%%

Page 185: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

!"#$%&%'()*+(%,$-*./(#0*1$,&)2*3!"4*

!  !"#$%&'()*"'+,!  -()('&(,.&/0)1&2,340255#67&8.)639'1("'8&7$56()('&(5:&6"$:#&6863(%;,!  <6&:1:"$02,340255#67&8.)639'1("'8&7$56()('&(56()('&(=$6&:6=1:"$0863(%;,

!  >)0&:6,?"$,-3"$;7,@"'6$;(2*!  5/(%67*897*:*;</(=227*>9*3?@AB49*1(/6$C*D/(#029*#$%&'()*$+*,-.*/0.&12('*3,(4542()*/55$21(4$'6*786*

79:;7<:=****!  E(22&/-(%7*;97*:*F(G2$%7*F9*!9*3?@@B49*H$DI<*-$,&)2*(%,*)$DI2'J*/&D/&22I$%2*K$/*2$JI()*%&<L$/62M*N9*

O%*I%</$,=J'$%*<$*1(/6$C*D/(#02*(%,*!"=*>5?2-$0.,&1@(6*A86*<B8;<:C=**

!  O%,&/2$%7*P9Q97*E(22&/-(%7*;97*:*P/$=J07*R9*3?@@@49*O*!S*#/I-&/M*H$DI<*-$,&)2*K$/*2$JI()*%&<L$/62=*3$21()*D.,E$&@56*:86*9F;AA=**

!  ;%IT,&/27*U9O9R9*3VWWV49*1(/6$C*J0(I%*1$%<&*P(/)$*&2'-('$%*$K*&"#$%&%'()*/(%,$-*D/(#0*-$,&)29*#$%&'()*$+*3$21()*3,&%2,%&.6*96*:=**

!  .(//X*+$YI%27*U$-*;%IT,&/27*F&%D*E(%D7*1(/6*Z(%,J$J6*:**F0I)I##(*F(G2$%*3VWW[49*G.2.',*H.I.)$!0.',5*1'*.J!$'.'4()*&('H$0*K&(!-*L!"M*0$H.)5*+$&*5$21()*'.,E$&@56*3$21()*D.,E$&@57*V@*?@V\V?]9**

*1IJ0(&)*Q9*R$--(/I<$*NN*7*>(%I&)*1(/'%*^(<_**

Page 186: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

!"#$%&%'()*+(%,$-*./(#0*1$,&)2*3!"4*

!  !"#$%&'()"*(+,-./(0"12,3'&4**

*" +*56&%(*37$8*9:(6)(;)&*<$/*+4***

!  +=%2*!+.1*-$,&)2*

" >(2*2$-&*?$-#=@('$%()*)6-6@('$%2*3A*BCCC*%$,&24**" 9)2$D*())$82*<$/*E$%F6@=,6%()*7&@8$/G*9%()H262**

I  J%?)=,6%F*(%()H262*$<*)$%F6@=,6%()*,(@(*$<*%&@8$/G2*(%,*;&0(:6$/**

0K#LMM888N2@(@2N$"N(?N=GMA2%6O,&/2M26&%(M***

16?0(&)*PN*Q$--(/6@$*JJ*D*R(%6&)*1(/'%*S(@T**

Page 187: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

!"#$%&%'()*+(%,$-*./(#0*1$,&)2*3!"4*

!  !"#$%&'()"*(+,-./(0"12,3'&4**

*

" +*#(56(7&*,&8&)$#&,*9:*2$-&*$;*<0&*)&(,=%7*250$)(/2*30>#?@@

2<(<%&<A$/7@4*

" B<(<%&<*=2*(*2C=<&*$;*2$DE(/&*#(56(7&2*;$/*2<('2'5()*%&<E$/6*(%():2=2*

" FC%5'$%()=<:*=2*#$E&/&,*9:*(*1(/6$8*50(=%*1$%<&*G(/)$*31G1G4*

" 0>#?@@5/(%A/H#/$I&5<A$/7@E&9@#(56(7&2@2<(<%&<@=%,&"A0<-)**

*

*

*

1=50(&)*JA*K$--(/=<$*LL*M*N(%=&)*1(/'%*O(<P**

Page 188: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

!"#$%&%'()*+(%,$-*./(#0*1$,&)2*3!"4*

!  !"#$%&'()*'+#,-.'/)0&#$%1'2)1'+)1%'302)1456)0**

*

**

1560(&)*78*9$--(/5:$*;;*<*=(%5&)*1(/'%*>(:?**

Page 189: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

!"#"$%"&'(")*+#,&

!  !"#"$%"&'(")*+#,&&

" -&!"#"$%"&'(")*+#,&&!"%.%$&/0&1))2*%#(3&&&/#*4&!0&5#$26)643&&&7#.+2&80&5($"%*3&&&9#*"%*&'0&:(;<3&#$2&&&/#*=$#&/)**+<3&&

&&&&&>?&@)(*$#,&)A&!"#=<=6#,& &&&&&&&&&!)BC#*%&D&E>FFGH0 &&

&

&&

-./0112223$45+3$,63$+-37)81/641#*94,%:1;<=>??@A?B1&

<+4-#%,&C3&D)66#*+")&EE&F&G#$+%,&<#*9$&H#"I&&

Page 190: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

!"#$%&'()$#&*+,%-"(.&

!  !"#$%&'%(&)"*+,&-%./"#$01&&

" /(-,$-&'+0)&*+,%-"(.&1&2%."34(.&5$,6%-7)&/%89$-$84$&:;<=>&?@A@B&&

" ;$)4-"C3%8D&&E0CDFF666GC%."G#+7$G$#+FC%."34(.8$,6%-7)F#(H@AGE,I.&&&" J%-8"8K&L$))"%8D&&E0CDFF38H+-.G4%IF?M-MNO,&

P  QN(".(R.$&"8&R%,E&S.()E&T&U+"473I$&&P  :E0CDFF.$4,%C"(G%",G#+7$G$#+F".$4,+-$)F".$4,+-$)G.())%V+,WA@XYT"#W?ZX[XB&

" Q\$-8%%8&L$))"%8D&&E0CDFF38H+-.G4%IF?RC]8+#&P  QN(".(R.$&"8&R%,E&S.()E&T&U+"473I$&&P  :E0CDFF.$4,%C"(G%",G#+7$G$#+F".$4,+-$)F".$4,+-$)G.())%V+,WA@XYT"#W?ZX[ZB&

&&&

&

&&

J"4E($.&^G&'%II(-",%&__&`&;(8"$.&J(-38&=(,a&&

Page 191: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)
Page 192: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

http://computationallegalstudies.com/2009/10/11/programming-dynamic-models-in-python/

Diffusion / Social Epidemiology

We Will Discuss An Applied Case Later Later But If You Want to Learn to How To Program the SIR Model in Python

Page 193: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

BREAK FOR 15 Minutes

We Will Next Move Into Applied Network Analysis

Page 194: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)
Page 195: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Network Analysis & Law

Mapping Social Structure of Legal Elites(hustle & Flow Article)

Diffusion, Norm Adoption and other Related Processes

(JLE Article)

Legal Doctrine and Legal Rules (Sinks Paper with Application to Patents, etc.)

Page 196: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)
Page 197: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Example Project #1:

Network Analysis of the Social Structure of the

the Federal Judiciary

Page 198: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Hustle & Flow: A Social Network Analysis of the American

Federal Judiciary

Daniel Martin Katz Derek K. Stafford

Page 199: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

the Federal Judicial Heirarchy

United States Supreme Court

Federal Court of Appeals

Federal District Court

Page 200: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

What is the Social Topology of the American Federal Judiciary?

Page 201: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

... And How Can We Measure it?

Page 202: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Collected Nearly 19,000 Law Clerk ‘Events’

1995 - 2005 For All Article III Judges

Relying Upon Data From Staff Directories

Network Analysis of the Federal Judiciary

Page 203: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

The Core Claim

In the Aggregate ...

Law Clerk Movements Reveal

Between Judicial Actors

Social or Professional Relationships

Page 204: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Network Analysis of the Federal Judiciary

Judge E

Justice ZJustice Y

Judge C

Judge D

Judge BJudge A

Page 205: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

An Sample Line of Dataset

Page 206: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Network Analysis of the Federal Judiciary

Page 207: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)
Page 208: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Highly Skewed Distribution of Social

Authority

!

Page 209: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Thirty Most Central

Non-SCOTUSFederal Judges

(1995-2005)

(Eigenvector Centrality)

Thirty Most Central Federal Judges (1995-2004)

(Eigenvector Centrality)

Jurist Centrality

Alito_Samuel_A 0.023137111 Boudin_Michael 0.094981577 Brunetti_Melvin_T 0.031860909 Cabranes_Jose_A 0.040859744 Calabresi_Guido 0.132071003 Easterbrook_Frank_H 0.029115868 Edwards_Harry_T 0.101003638 Flaum_Joel_M 0.023137202 Fletcher_William_A 0.034383907 Garland_Merrick 0.045101794 Ginsburg_Douglas_H 0.106655149 Higginbotham_Patrick_E 0.038283304 Jones_Edith_H 0.051847613 Kozinski_Alex 0.199448153 Leval_Pierre_N 0.061667539 Luttig_J_Michael 0.460086375 Niemeyer_Paul_V 0.057598972 O_Scannlain_Diarmuid 0.12676303 Posner_Richard 0.119017709 Randolph_Raymond 0.04502409 Reinhardt_Stephen_R 0.039234543 Rymer_Pamela_Ann 0.035610044 Sentelle_David_B 0.102452911 Silberman_Laurence_H 0.224592733 Tatel_David_S 0.1153377 Wald_Patricia_M 0.033537262 Wallace_Clifford 0.034474947 Wilkinson_J_Harvie 0.211140835 Williams_Stephen_F 0.090441285 Winter_Ralph_K 0.049458759

Page 210: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

More Information Here

Daniel Katz & Derek Stafford

(2010)

Page 211: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)
Page 212: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Example Project #2:

Reproduction of Hierarchy? A Social Network Analysis of

the American Law Professoriate

Page 213: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Reproduction of Hierarchy? A Social Network Analysis of the

American Law Professoriate

Daniel Martin KatzJosh Gubler Jon Zelner

Michael BommaritoEric Provins Eitan Ingall

Page 214: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Motivation for Project

Why Do Certain Paradigms, Histories, Ideas Succeed?

Function of the ‘Quality’ of the Idea

Social Factors also Influence the Spread of Ideas

Most Ideas Do Not Persist ....

Page 215: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Law Professors are Important Actors

Agents of Socialization

Repositories / Distributors of information

Socialize Future lawyers, Judges & law Professors

Responsible for Developing Particular Legal Ideas(Brandwein (2007) ; Graber (1991), etc.)

Law Professor Behavior is a Important Component of Positive Legal Theory

Positive Legal Theory

Page 216: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Social Network Analysis

Method for Characterizing Diffusion / Info Flow

Method for Tracking Social Connections, etc.

Method for Ranking Components based upon Various Graph Based Measures

Page 217: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Social Network Analysis of the American Law Professoriate

Data Collection

Page 218: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Cornell University Law School

Page 219: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Cornell University Law School

Page 220: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Cornell University Law School

Page 221: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Cornell University Law School

Page 222: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Building A Graph Theoretic Representation

Cornell

Harvard Penn

Page 223: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Building A Graph Theoretic Representation

Cornell

Harvard Penn

Page 224: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Building A Graph Theoretic Representation

Cornell

Harvard Penn

Page 225: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Building A Graph Theoretic Representation

Cornell

Harvard Penn

Page 226: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Building the Full Dataset

Page 227: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Building the Full Dataset

Page 228: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Building the Full Dataset

Page 229: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Building the Full Dataset

Page 230: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Building the Full Dataset

....

Page 231: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

7,054 Law Professors! p = {p1, p2, ... p7240}

184 ABA Accredited Institutions n = {n1 , n2, … n184}

Full Data Set

....

Page 232: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Visualizing a Full Network

Page 233: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Visualizing a Full NetworkUsing a Layout Algorithm

Page 234: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Zoomable Visualization Available @ http://computationallegalstudies.com/

Page 235: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)
Page 236: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Zoomable Visualization Available @ http://computationallegalstudies.com/

Page 237: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

A Graph-Based Measure of Centrality

Page 238: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Hub Score

Score Each Institution’s Placements by Number and Quality of Links

Normalized Score (0, 1]

Similar to the Google PageRank™ Algorithm

Measure who is important?

Measure who is important to who is important?

Run Analysis Recursively...

Page 239: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Hub Score Rank

US News Peer

Assessment Hub

Score Institution

1 1 1.0000000 Harvard2 1 0.9048631 Yale3 5 0.8511497 Michigan4 4 0.7952253 Columbia5 5 0.7737389 Chicago6 8 0.7026757 NYU7 1 0.6668868 Stanford8 8 0.6607399 Berkeley9 10 0.6457157 Penn

10 10 0.6255498 Georgetown11 5 0.5854464 Virginia12 14 0.5014904 Northwestern13 10 0.4138745 Duke14 10 0.4075353 Cornell15 15 0.3977734 Texas16 28 0.3787268 Wisconsin17 19 0.3273598 UCLA18 24 0.2959581 Illinois19 28 0.2919847 Boston University20 28 0.2513371 Minnesota21 24 0.2403289 Iowa22 28 0.2275534 Indiana23 19 0.2235015 George

Washington24 16 0.2174677 Vanderbilt25 41 0.2012442 Florida

Hub Score Rank

US News Peer

Assessment Hub

Score Institution

26 24 0.1999686 UC Hastings27 34 0.1974877 Tulane28 28 0.1749897 USC29 35 0.1702638 Ohio State30 24 0.1586516 Boston College31 72 0.1543831 Syracuse32 19 0.1537236 UNC33 56 0.1525355 Case Western34 82 0.1511569 Northeastern35 19 0.1428239 Notre Dame36 56 0.1286375 Temple37 82 0.1232289 Rutgers Camden38 56 0.1227421 Kansas39 64 0.1213358 Connecticut40 47 0.1198901 American41 34 0.1162101 Fordham42 64 0.1150860 Kentucky43 106 0.1148082 Howard44 47 0.1125957 Maryland45 28 0.1101975 William & Mary46 56 0.1058079 Colorado47 19 0.1041129 Emory48 17 0.1031490 Washington & Lee49 72 0.1027442 Miami50 103 0.1006172 SUNY Buffalo

Hub Scores

Page 240: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Hub Score Rank US News Peer

Assessment Score Hub

Score Institution

26 24 0.1999686 UC Hastings

27 34 0.1974877 Tulane

28 28 0.1749897 USC

29 35 0.1702638 Ohio State

30 24 0.1586516 Boston College

31 72 0.1543831 Syracuse

32 19 0.1537236 UNC

33 56 0.1525355 Case Western

34 82 0.1511569 Northeastern

35 19 0.1428239 Notre Dame

36 56 0.1286375 Temple

37 82 0.1232289 Rutgers Camden

38 56 0.1227421 Kansas

39 64 0.1213358 Connecticut

40 47 0.1198901 American

41 34 0.1162101 Fordham

42 64 0.1150860 Kentucky

43 106 0.1148082 Howard

44 47 0.1125957 Maryland

45 28 0.1101975 William & Mary

46 56 0.1058079 Colorado

47 19 0.1041129 Emory

48 17 0.1031490 Washington & Lee

49 72 0.1027442 Miami

50 103 0.1006172 SUNY Buffalo

Page 241: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Hub Score Rank US News Peer

Assessment Score Hub

Score Institution

26 24 0.1999686 UC Hastings

27 34 0.1974877 Tulane

28 28 0.1749897 USC

29 35 0.1702638 Ohio State

30 24 0.1586516 Boston College

31 72 0.1543831 Syracuse32 19 0.1537236 UNC

33 56 0.1525355 Case Western

34 82 0.1511569 Northeastern

35 19 0.1428239 Notre Dame

36 56 0.1286375 Temple

37 82 0.1232289 Rutgers Camden

38 56 0.1227421 Kansas

39 64 0.1213358 Connecticut

40 47 0.1198901 American

41 34 0.1162101 Fordham

42 64 0.1150860 Kentucky

43 106 0.1148082 Howard

44 47 0.1125957 Maryland

45 28 0.1101975 William & Mary

46 56 0.1058079 Colorado

47 19 0.1041129 Emory

48 17 0.1031490 Washington & Lee

49 72 0.1027442 Miami

50 103 0.1006172 SUNY Buffalo

Page 242: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Hub Score Rank US News Peer

Assessment Score Hub

Score Institution

26 24 0.1999686 UC Hastings

27 34 0.1974877 Tulane

28 28 0.1749897 USC

29 35 0.1702638 Ohio State

30 24 0.1586516 Boston College

31 72 0.1543831 Syracuse32 19 0.1537236 UNC

33 56 0.1525355 Case Western

34 82 0.1511569 Northeastern35 19 0.1428239 Notre Dame

36 56 0.1286375 Temple

37 82 0.1232289 Rutgers Camden

38 56 0.1227421 Kansas

39 64 0.1213358 Connecticut

40 47 0.1198901 American

41 34 0.1162101 Fordham

42 64 0.1150860 Kentucky

43 106 0.1148082 Howard

44 47 0.1125957 Maryland

45 28 0.1101975 William & Mary

46 56 0.1058079 Colorado

47 19 0.1041129 Emory

48 17 0.1031490 Washington & Lee

49 72 0.1027442 Miami

50 103 0.1006172 SUNY Buffalo

Page 243: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Hub Score Rank US News Peer

Assessment Score Hub

Score Institution

26 24 0.1999686 UC Hastings

27 34 0.1974877 Tulane

28 28 0.1749897 USC

29 35 0.1702638 Ohio State

30 24 0.1586516 Boston College

31 72 0.1543831 Syracuse32 19 0.1537236 UNC

33 56 0.1525355 Case Western

34 82 0.1511569 Northeastern35 19 0.1428239 Notre Dame

36 56 0.1286375 Temple

37 82 0.1232289 Rutgers Camden38 56 0.1227421 Kansas

39 64 0.1213358 Connecticut

40 47 0.1198901 American

41 34 0.1162101 Fordham

42 64 0.1150860 Kentucky

43 106 0.1148082 Howard

44 47 0.1125957 Maryland

45 28 0.1101975 William & Mary

46 56 0.1058079 Colorado

47 19 0.1041129 Emory

48 17 0.1031490 Washington & Lee

49 72 0.1027442 Miami

50 103 0.1006172 SUNY Buffalo

Page 244: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Hub Score Rank US News Peer

Assessment Score Hub

Score Institution

26 24 0.1999686 UC Hastings

27 34 0.1974877 Tulane

28 28 0.1749897 USC

29 35 0.1702638 Ohio State

30 24 0.1586516 Boston College

31 72 0.1543831 Syracuse32 19 0.1537236 UNC

33 56 0.1525355 Case Western

34 82 0.1511569 Northeastern35 19 0.1428239 Notre Dame

36 56 0.1286375 Temple

37 82 0.1232289 Rutgers Camden38 56 0.1227421 Kansas

39 64 0.1213358 Connecticut

40 47 0.1198901 American

41 34 0.1162101 Fordham

42 64 0.1150860 Kentucky

43 106 0.1148082 Howard44 47 0.1125957 Maryland

45 28 0.1101975 William & Mary

46 56 0.1058079 Colorado

47 19 0.1041129 Emory

48 17 0.1031490 Washington & Lee

49 72 0.1027442 Miami

50 103 0.1006172 SUNY Buffalo

Page 245: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Hub Score Rank US News Peer

Assessment Score Hub

Score Institution

26 24 0.1999686 UC Hastings

27 34 0.1974877 Tulane

28 28 0.1749897 USC

29 35 0.1702638 Ohio State

30 24 0.1586516 Boston College

31 72 0.1543831 Syracuse32 19 0.1537236 UNC

33 56 0.1525355 Case Western

34 82 0.1511569 Northeastern35 19 0.1428239 Notre Dame

36 56 0.1286375 Temple

37 82 0.1232289 Rutgers Camden38 56 0.1227421 Kansas

39 64 0.1213358 Connecticut

40 47 0.1198901 American

41 34 0.1162101 Fordham

42 64 0.1150860 Kentucky

43 106 0.1148082 Howard44 47 0.1125957 Maryland

45 28 0.1101975 William & Mary

46 56 0.1058079 Colorado

47 19 0.1041129 Emory

48 17 0.1031490 Washington & Lee

49 72 0.1027442 Miami

50 103 0.1006172 SUNY Buffalo

Page 246: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Distribution of Social Authority

Page 247: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

0

200

400

600

800

1,000

Harvard Yale Michigan Columbia Chicago NYU Stanford Berkeley UVAGeorgetownPennNorthwesternTexas Duke UCLA Cornell

Wisconsin BU IllinoisMinnesota

Top 20 Institutions (By Raw Placements)

Page 248: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

!

!

Page 249: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Highly Skewed Nature ofLegal Systems

Smith 2007

Post & Eisen 2000Katz & Stafford 2010

!

Page 250: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Implications for Rankings

Rankings only Imply Ordering ( >, =, < )

End Users tend to Conflate Ranks with Linearized Distances Between Units

(Tversky 1977)

Non-Stationary Distances Between Entities

Both Trivial and Large DistancesLinearity Heuristic Often WorksAssuming Linearity Can Prove Misleading

Page 251: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Computational Model of Information Diffusion

Page 252: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Why Computational Simulation?

History only Provides a Single Model Run

Computational Simulation allows ... Consideration of Alternative “States of the world”

Evaluation of Counterfactuals

Page 253: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Computational Model of Information Diffusion

We Apply a simple Disease Model to Consider the Spread of Ideas, etc.

Clear Tradeoff Between Structural Position in the Network and “Idea Infectiousness”

Page 254: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

A Basic Description of the Model

Consider a Hypothetical Idea Released at a Given Institution

Infectiousness Probability = p

Two Forms Diffusion...Direct SocializationSignal Giving to Former Students

Infect neighbors, neighbors-neighbors, etc.

Page 255: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Lots of Channels of Information Diffusion Among Legal Academics

Judicial Decisions, Law Reviews, Other Materials

Academic Conferences, Other Professional Orgs

SSRN, Legal Blogosphere, etc.

Channels of Diffusion

Other Channels of Information Dissemination

Legal Socialization / Training

Page 256: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

A Sample Run of the Model

Page 257: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

A Sample Run of the Model

Page 258: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

A Sample Run of the Model

Page 259: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

A Sample Run of the Model

Page 261: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

From a Single Run to Consensus Diffusion Plot

Netlogo is Good for Model Demonstration

Regular Programming Language TypicallyRequired for Full Scale Implementation

We Used Python

http://ccl.northwestern.edu/netlogo/

http://www.python.org/

Object Oriented Programming Language

Page 262: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

From a Single Run to Consensus Diffusion Plot

Repeated the Diffusion Simulation

Hundreds of Model Runs Per School

Yielded a Consensus Plot for Each School

Results for Five Emblematic SchoolsExponential, linear and sub-linear

Page 263: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

!

Computational Simulation of Diffusion upon the Structure of the American Legal Academy

Page 264: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Differential Host Susceptibility

Some Potential Model Improvements?

Countervailing Information / Paradigms

S I R Model Susceptible-Infected-Recovered

Page 265: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Directions for Future Research

Longitudinal Data Hiring/Placement/LateralsCurrent Collecting Data

Database Linkage to Articles/CitationsWorking with Content Providers

Empirical Evaluation of SimulationComputational LingusiticsText Mining, Sentiment Coding

Page 266: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)
Page 267: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Example Project #3:

On the Road to the Legal Genome Project ...

Dynamic Community Detection

&

Distance Measures for Dynamic Citation Networks

Page 268: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Distance Measures for Dynamic Citation Networks

Michael J. Bommarito IIDaniel Martin Katz

Jon Zelner James H. Fowler

Page 269: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Imagine

Page 270: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Ideas

Page 271: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Represented as Colors

Page 272: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)
Page 273: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)
Page 274: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

How Can We Track the Novel

Combination, Mutation and

Spread of Ideas?

Page 275: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Information Genome Project

The Development, Mutation and and Spread of Ideas

Precedent in Common Law Systems

Patent Citations

Bibliometric Analysis

Page 276: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Citations Represent the Fossil Record

Page 277: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

They are the Byproduct of

Dynamic Processes

Page 278: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Information Genomics

Page 279: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Leverging the Ideas in Network

Community Detection

Page 280: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Want to Develop a Method that can Identify the Time

Dependant ...

Page 281: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Changing Relationships

between Various Intellectual

Concepts

Page 282: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

(1)Patent Citations

(2) Judicial Decisions

(3) Academic Articles

Page 283: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)
Page 284: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)
Page 285: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Applied Traditional Methods to SCOTUS Citation Network

Page 286: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Applied Traditional Methods to SCOTUS Citation Network

#EPICFAIL

Page 287: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Here is Proof of the #EPICFAIL

Page 288: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Reported the Results at ASNA 2009

Page 289: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Key Points from the ASNA 2009 Paper

Page 290: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Key Points from the ASNA 2009 Paper

Page 291: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Key Points from the ASNA 2009 Paper

Page 292: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

We Decided to Go Back to First

Principles

Page 293: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Growth Rules For Citation Networks

Page 294: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Dynamic Directed Acyclic Graphs

Page 295: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Dynamic Directed Acyclic Graphs

Examples: Academic Articles

Page 296: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Dynamic Directed Acyclic Graphs

Examples: Academic Articles

Judicial Citations

Page 297: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Dynamic Directed Acyclic Graphs

Examples:

Academic Articles

Judicial Citations

Patent Citations

Page 299: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Cases Decided by the Supreme Court

Citations in the Current Year

Citations from prior years

PLAY MOVIE!

http://computationallegalstudies.com/2010/02/11/the-development-of-structure-in-

the-citation-network-of-the-united-states-supreme-court-now-in-hd/

Page 300: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

A Formalization of D-DAG’s

Page 301: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Six Degrees of Marbury v. Madison

Page 302: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

A Formalization of D-DAG’s

Page 303: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Basic Idea of Sink Based Distance Measure

Page 304: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

The Simplest Non-Trivial Distance Measure

Page 305: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Flexible Framework For More Detailed Specifications

Page 306: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Distance Measure <- ->

Dendrogram

Page 308: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Expect More in Judicial Citation

Dynamics ....

Page 309: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Here is Another Application ...

Page 310: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Potential Application to Patent Citations?

Page 311: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Sternitzke, Bartkowski & Schramm (2008)

Potential Application to Patent Citations?

Page 312: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Network Analysis of Patent Citations

Page 313: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Network Analysis of Patent Citations

Page 314: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

http://www.eecs.umich.edu/cse/dm_11_video/erdi.mp4

http://people.kzoo.edu/~perdi/Talk By Péter Érdi

Network Analysis of Patent Citations

Page 315: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Some Papers

For Your

Consideration

Page 316: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

Click Here to

Access

Page 317: Network Analysis and Law: Introductory Tutorial @ Jurix 2011 Meeting (Vienna)

@computational

Thank You For Your Attention!