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

Network Analysis and the Law
Daniel Martin Katz
Illinois Tech
Chicago Kent College of Law
Michael J. Bommarito II
Center for Study of
Complex Systems
Jurix 2011 Tutorial @ Universität Wien
!

My Background
Associate Professor of Law
Illinois Tech - Chicago Kent Law
Former NSF IGERT Fellow,
University of Michigan
Center for the Study of Complex Systems
(2009-2010)
PhD
Political Science & Public Policy
(2011)
JD
Law School
(2005)

My Background
Former NSF IGERT Fellow,
Center for the Study of Complex
Systems
PhD Pre-Candidate
Dept. of Political Science
Masters Degree
Financial Engineering

Outline of Our Session
Network Analysis: An Extended Primer
Network Analysis & Law
The Frontier of Network Analysis & Law
Legal Elites
Diffusion and other Related Processes
Legal Doctrine and Legal Rules
Advanced Network Science Topics
Community Detection
ERGM / P* Models
Social Epidemiology
Distance Measures for Dynamic Citation Networks
Dynamic Community Detection
The Judicial Collaborative Filter (Judge Aided Info Retrevial)

Network Analysis:
An Extended Primer

Introduction to
Network Analysis
What is a Network?
What is a Social Network?
Mathematical Representation of the
Relationships Between Units such as
Actors, Institutions, Software, etc.
Special class of graph Involving
Particular Units and Connections

Introduction to
Network Analysis
Interdisciplinary Enterprise
Applied Math
(Graph Theory, Matrix Algebra, etc.)
Statistical Methods
Social Science
Physical and Biological Sciences
Computer Science

Social Science
For Images and Links to
Underlying projects:
http://jhfowler.ucsd.edu/
3D HiDef SCOTUS Movie
Co-Sponsorship in Congress
Spread of Obesity
Hiring and Placement of
Political Science PhD’s

Social Science
The 2004 Political Blogosphere
(Adamic & Glance)
High School Friendship
(Moody)
Roll Call Votes in United States Congress
(Mucha, et al)

Physical and
Biological
Sciences
For Images and Links to
Underlying projects:
http://www.visualcomplexity.com/vc/

Computer Science
Mapping
of the
Code
Networks are ways
to represent
dependancies
between software

Computer Science
Internet is one of
the largest
known and most
important networks

Computer Science
Mapping
the
Iranian
Blogsphere
http://cyber.law.harvard.edu/publications/2008/Mapping_Irans_Online_Public

Terminology & Examples
Institutions
Firms
States/Countries
Actors
NODES
Other

Example: Nodes in an actor-
based social Network
Alice
Bill
Carrie
David
Ellen
How Can We Represent The
Relevant Social Relationships?

Edges
Alice
Bill
Carrie
David
Ellen
Arcs

Edges
Alice Bill
Carrie
David
Ellen
Arcs

Edges Alice Bill
Carrie
David
Ellen
Arcs

Alice Bill
David
Carrie
Ellen
A Full Representation
of the Social Network

Bill
David
Carrie
Ellen
Alice
(With Node Weighting)

Bill
David
Carrie
Ellen
(With Node Weighting
and Edge Weighting)
Alice

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

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 2
1 3
1 4
1 5
2 1
2 3
3 4
3 5
3 2
5 1
5 4
5 3
5 2
ROWS è COLUMNS
*How to Read the Edge List: (Person in Column 1 is friends with Person in Column 2)

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

A Quick Law Based
Example of a
Dynamic Network

United States Supreme Court
To Play Movie of the Early SCOTUS Jurisprudence:
http://vimeo.com/9427420
Documentation is Available Here:
http://computationallegalstudies.com/2010/02/11/the-development-of-structure-in-the-citation-network-of-the-
united-states-supreme-court-now-in-hd/

Some Other
Examples
of Networks

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

Corporate Boards
http://www.theyrule.net/

Transportation Networks
We might be interested in developing
transportation systems that are minimize
total travel time per passenger

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

Campaign Contributions
Networks
http://computationallegalstudies.com/tag/110th-congress/

The United
States Code
http://computationallegalstudies.com/
+
Hierarchical
Structure

Some Recent
Network Related
Publications
Special Issue:
Complex systems
and Networks
July 24, 2009
Special 90th anniversary
Issue:
May 7, 2007

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?

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?

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 point
can have 0 or 2 nodes with an odd degree
Hamiltonian path: visit
each vertex exactly once

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

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?

Stanley Milgram’s
Other Experiment
NE
MA

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”

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/

Visualization Source: Duncan J. Watts, Six Degrees
Six Degrees of Kevin Bacon

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

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

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

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

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

Different Form of
Network Representation
1 mode
2 mode

Back to the
Milgram
Experiment

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

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

Search in Networks
What information about the problem might
the individual attempt to leverage?
visual by duncan watts
dimensional data:
send it to a stockbroker
send it to closet possible city to boston

Follow up to
the original
Experiment
available at:
http://research.yahoo.com/pub/2397
Published in
Science in 2003

2 mode
Actors
and
Movies
Different Forms of

1 mode
Actor to Actor
Could be Binary
(0,1)
Did they
Co-Appear?
Different Forms of

Different Forms of
1 mode
Actor to Actor
Could also be
Weighted
(I.E. Edge Weights by
Number of
Co-Appearences)

Features of Networks
Mesoscopic Community Structures
Macroscopic Graph Level Properties
Microscopic Node Level Properties

Macroscopic Graph
Level Properties
Degree Distributions (Outdegree & Indegree)
Clustering Coefficients
Connected Components
Shortest Paths
Density

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

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

Shortest Paths
I n t h e W a t t s - S t r o g a t z M o d e l
Shortest Paths are reduced by
increasing levels of random rewiring

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

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?

Density
What fraction are present?
density = e / emax
For example, out of 12 
possible connections..
this graph
this graph has 7,
giving it a density of  
7/12 = 0.58
A “fully connected graph has a density =1

We are often interested in whether
the graph has a single or multiple
connected components
Strong Components
Giant Component
Weak Components

Netlogo
Basic 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)

Netlogo
Please DownLoad Netlogo as we
will be using it occasionally
throughout this tutorial
Wilensky (1999)

Open “Giant Component” from
the netlogo models Library

Notice the
fraction of
nodes in the
giant component
Notice the Size of
the “Giant
Component”
Model has
been
advanced
25+ Ticks

Model has
been
advanced
80+ Ticks
Notice the
fraction of
nodes in the
giant component
Notice the Size of
the “Giant
Component”

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

Degree Distributions
outdegree 
how many directed edges (arcs)
originate at a node
indegree 
how 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

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

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

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]

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)]

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

Canonical Network Models
Erdős-Renyi
Random Network
Highly Clustered
Network
Watts-Strogatz
Small World Network
Barabási-Albert
Preferential
Attachment Network

Why are Degree
Distributions Useful?
Barabási-Albert
Preferential
Attachment Network

Barabási-Albert
Preferential Attachment
Netlogo Models Library --> Networks --> Preferential Attachment
Watch the Changing
Degree Distribution

Barabási-Albert
Preferential Attachment
Netlogo Models Library --> Networks --> Preferential Attachment

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)

Power Laws Seem
to be Everywhere

How Do I Know Something
is Actually a Power Law?

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

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

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

Random
Graphs
Power Law
networks

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)

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”

Just To Preview The
Application to Positive
Legal Theory ....

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

Some Additional Thoughts on the Question...

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

Degree
Degree is simply a count of the number of
arcs (or edges) incident to a node
Here the nodes are sized by degree:

Degree as a measure
of centrality
Please Calculate the “degree” of each of the nodes

Degree as a measure
of centrality
ask yourself, in which case does “degree” appear to
capture the most important actors?

Degree as a measure
of centrality
what about here, does it capture the “center”?

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:

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

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

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

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]

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

We are interested in BOTH:
to whom a webpage links
and
From whom it has received links
In Ranking a Webpage ...

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

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.

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

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

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: accepts
microsoft
excel files
Medium: requires
the .net / .paj
file setup
Hard: has lots of
features
(R or Python)

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

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

Advanced Network Science Topics
Community Detection
ERGM Models
Diffusion /
Social Epidemiology
http://computationallegalstudies.com/2009/10/11/
programming-dynamic-models-in-python/

!"#$%&'(#!%")#%)(%*+'#!",)(%*+-./)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#:)
)
6,778%2*0(9'*'&:,%(
(
!
E#'-/$>>2%@(6,778%2:'1(
C$//$D(9'-'%02D(U$-.$1(D?2&1'.F(
=*,.'#"4*;!/-#!.'#"$%004*;!,.223*4/(!+/"3,/3"#!.:!,.20$#>!*#/6."7+!4*!*%/3"#!%*)!+.,4#/(!
5%/3"#((^_ZD(GHHZF(
32&4$'/(LF(M,77$-2*,(NND(9$%2'/(3$-:%(O$*P(

9';%2:,%(<(=27>/'(?'-12,%(
!  8;<=>?@A( $(@-,8>(,A(%,"'1(*4$*($-'("#$%&'#$(!)#*+#$((
&,%%'&*'"(*,(#%,-!./-#"(B8*(+0%"+#$((&,%%'&*'"(*,(./-#"!
"'%1'(@-,8>1(2%(*4'(%'*+,-. (
!  C,-*'-D(E%%'/$D(38&4$F((1.223*4&#+!4*!5#/6."7+F(),:&'1(*,(*4'(!3=D(GHHI8(
!  .B=CD?EFA)
!  6/2J8'1(2%($(42@4(1&4,,/(1,&2$/(%'*+,-.(
!  ?,:%@(&,$/2:,%1(2%(6,%@-'11(
!  6,%187'-(*0>'1(2%($(%'*+,-.(,A(&,K>8-&4$1'1(
32&4$'/(LF(M,77$-2*,(NND(9$%2'/(3$-:%(O$*P(

QR$7>/'(<(=,&2$/()'*+,-.1(
!C=GHIE)JKHF),;=DK)LM(
32&4$'/(LF(M,77$-2*,(NND(9$%2'/(3$-:%(O$*P(

QR$7>/'(<(=,&2$/()'*+,-.1(
NK=J) O=PJ<;F) CHGKJ) =QEPJ) JKE) O<;C=R<I) <O)
O;HEI>FKHDF)HI)=)KHGK)FPK<<?)F<PH=?)IEJS<;TU)
)
!>E=FA))!@'D((S'%"'-D(6/$11D(T$&'D(N%*'-'1*1(
(
5<S) CHGKJ) SE) =FFHGI) P<CCVIHREF) J<) JKHF)
IEJS<;TU)
(
)
)
)
)
(
3E;RPEF5(C',>/'(
.>GEF5(U-2'%"142>(
32&4$'/(LF(M,77$-2*,(NND(9$%2'/(3$-:%(O$*P(

QR$7>/'(<(=,&2$/()'*+,-.1(
NK=J) O=PJ<;F) CHGKJ) =QEPJ) JKE) O<;C=R<I) <O)
O;HEI>FKHDF)HI)=)KHGK)FPK<<?)F<PH=?)IEJS<;TU)
)
!>E=FA))!@'D((S'%"'-D(6/$11D(T$&'D(N%*'-'1*1(
(
5<S) CHGKJ) SE) =FFHGI) P<CCVIHREF) J<) JKHF)
IEJS<;TU)
(
)
)
)
)
(
,H;?F)
8<@F)
3E;RPEF5(C',>/'(
.>GEF5(U-2'%"142>(
32&4$'/(LF(M,77$-2*,(NND(9$%2'/(3$-:%(O$*P(

QR$7>/'(<(?,:%@(6,$/2:,%1(
32&4$'/(LF(M,77$-2*,(NND(9$%2'/(3$-:%(O$*P(
3E;RPEF5(C',>/'(
.>GEF5(6,K#,*'"((
(((((($*(/'$1*(,%&'(
"<S)?EJ F)?<<T)=J)JKE)F=CE)IEJS<;T)=F)HO)HJ)
;ED;EFEIJE>)P<WX<RIG)HI)JKE)0EI=JEM)
)
!>E=FA)N118'(>,12:,%D(@',@-$>40D('*4%2&2*0D(@'%"'-(
)
5<S)CHGKJ)SE)=FFHGI)P<CCVIHREF)J<)JKHF)
IEJS<;TU)
)
)
)
(
(

QR$7>/'(<(?,:%@(6,$/2:,%1(
$EDVY?HP=IF)
&EC<P;=JF)
N%"'>'%"'%*1(
32&4$'/(LF(M,77$-2*,(NND(9$%2'/(3$-:%(O$*P(
3E;RPEF5(C',>/'(
.>GEF5(6,K#,*'"((
(((((($*(/'$1*(,%&'(
"<S)?EJ F)?<<T)=J)JKE)F=CE)IEJS<;T)=F)HO)HJ)
;ED;EFEIJE>)P<WX<RIG)HI)JKE)0EI=JEM)
)
!>E=FA)N118'(>,12:,%D(@',@-$>40D('*4%2&2*0D(@'%"'-(
)
5<S)CHGKJ)SE)=FFHGI)P<CCVIHREF)J<)JKHF)
IEJS<;TU)
)
)
)
(
(

6,%*'R*V(
"<JE)JK=J)SE)K=XE)=FFHGIE>)P<CCVIHJ@)CECYE;FKHD)>HQE;EIJ?@))
))>EFDHJE)<YFE;XHIG)JKE)!"#$%&'"()*%
%
(<CCVIHJ@)>EJEPR<I)HF)I<J)=)P<IPEDJ)JK=J)P=I)YE)>HX<;PE>)O;<C)P<IJEBJM)
(
(
32&4$'/(LF(M,77$-2*,(NND(9$%2'/(3$-:%(O$*P(

92-'&*'"%'11(
'I>H;EPJE>) &H;EPJE>)
32&4$'/(LF(M,77$-2*,(NND(9$%2'/(3$-:%(O$*P(

92-'&*'"%'11(
*=I@)CEJK<>F)><)I<J)HIP<;D<;=JE)>H;EPR<IZ)
(
)
*=I@)CEJK<>F)JK=J)><)HIP<;D<;=JE)>H;EPR<I)><)I<J)=??<S)
O<;)YH>H;EPJE>)E>GEFM)
(
)
&HQE;EIJ)F<[S=;E)D=PT=GEF)C=@)HCD?ECEIJ)JKE)F=CE)
CEJK<> )SHJK)<;)SHJK<VJ)FVDD<;J)O<;)>H;EPJE>)E>GEFM)
32&4$'/(LF(M,77$-2*,(NND(9$%2'/(3$-:%(O$*P(

W'2@4*1(
'ISEHGKJE>) NEHGKJE>)
• (M2%$-0(-'/$:,%142>1(
• (9$*$(/272*$:,%1(
• (T'/$:,%142>(1*-'%@*4(
• (U-'J8'%&0(,A(-'/$:,%142>(
• (U/,+(
32&4$'/(LF(M,77$-2*,(NND(9$%2'/(3$-:%(O$*P(

W'2@4*1(
'ISEHGKJE>) NEHGKJE>)
• (M2%$-0(-'/$:,%142>1(
• (9$*$(/272*$:,%1(
• (T'/$:,%142>(1*-'%@*4(
• (U-'J8'%&0(,A(-'/$:,%142>(
• (U/,+(
"<JE)E>GE)
JKHPTIEFFM)
32&4$'/(LF(M,77$-2*,(NND(9$%2'/(3$-:%(O$*P(

W'2@4*1(
*=I@)CEJK<>F)><)I<J)HIP<;D<;=JE)E>GE)SEHGKJFZ)
(
*EJK<>F)JK=J)><)HIP<;D<;=JE)E>GE)SEHGKJF)C=@)>HQE;)HI)
=PPEDJ=Y?E)X=?VEFZ)
• (N%*'@'-1(,-(-'$/(+'2@4*1(
• (=*-2&*/0(>,12:#'(+'2@4*1(
(
&HQE;EIJ)F<[S=;E)D=PT=GEF)C=@)HCD?ECEIJ)JKE)F=CE)
CEJK<> )SHJK)<;)SHJK<VJ)FVDD<;J)O<;)SEHGKJE>)E>GEFM)
32&4$'/(LF(M,77$-2*,(NND(9$%2'/(3$-:%(O$*P(

T'1,/8:,%(
T'1,/8:,%(21($(&,%&'>*(2%4'-2*'"(A-,7(,>:&1F((!&&,-"2%@(*,(W2.2D(
!!+(,-".%'$!/.0,/1%)#+,"49#+!/-#!%94$4/(!.:!%*!42%;4*;!+(+/#2!
!!!/.!"#+.$'#!)#/%4$!4*!/-#!.9<#,/!/-%/!4+!9#4*;!42%;#)8!!!
5HGK);EF<?VR<I4) -<S);EF<?VR<I)
• (6$%(7$.'(,8*(7$%0("'*$2/1V(XYZFY3C[(
• (M8*(
• (9'*$2/1(7$0(B'(%,21'(
• (=,7':7'1(*4'0(",% *(7$]'-V((
• (6$% *(-'$"($(+,-"V(
• (M8*(
• (6$%(A,&81(,%(B-,$"(-'@2,%1(
• (),21'(21(,8*(,A(A,&81(
32&4$'/(LF(M,77$-2*,(NND(9$%2'/(3$-:%(O$*P(

T'1,/8:,%(
5HGK);EF<?VR<I)2CHP;<FP<DHP4) -<S);EF<?VR<I)2C=P;<FP<DHP4)
=$7'(@-$>41V(
32&4$'/(LF(M,77$-2*,(NND(9$%2'/(3$-:%(O$*P(

T'1,/8:,%(
&HQE;EIJ)K@D<JKEFEF)<;)VEFR<IF)P<;;EFD<I>)J<)>HQE;EIJ)
));EF<?VR<IFM)
)
&HQE;EIJ)CEJK<>F)=;E)C<;E)<;)?EFF)EQEPRXE)=J)>EJEPRIG))
))P<CCVIHJ@)FJ;VPJV;E)=J)>HQE;EIJ);EF<?VR<IFM)
(
*<>V?=;HJ@WY=FE>)CEJK<>F)-"11/2%>EJEPJ)FJ;VPJV;E)YE?<S)
))=)TI<SI);EF<?VR<I)?HCHJM)
32&4$'/(LF(M,77$-2*,(NND(9$%2'/(3$-:%(O$*P(

E#'-/$>>2%@(6,778%2:'1(
C$//$D(9'-'%02D(U$-.$1(D?2&1'.F(
=*,.'#"4*;!/-#!.'#"$%004*;!,.223*4/(!+/"3,/3"#!.:!,.20$#>!*#/6."7+!4*!*%/3"#!%*)!+.,4#/(!
5%/3"#((^_ZD(GHHZF(
32&4$'/(LF(M,77$-2*,(NND(9$%2'/(3$-:%(O$*P(

6,7>8*$:,%$/(6,7>/'R2*0(T'A-'14'-(
(<CDVJ=R<I=?)P<CD?EBHJ@)HF)=)FE;H<VF)HFFVEZ)
((((
9$*$( 21( B'&,72%@( 7,-'( $B8%"$%*( $%"( 7,-'(
"'*$2/'"F(
(
3$%0(J8$%:*$:#'(-'1'$-&4(>-,`'&*1(42%@'(,%(
*4'(A'$12B2/2*0(,A(&$/&8/$:,%1F(
(
a%"'-1*$%"2%@( &,7>8*$:,%$/( &,7>/'R2*0( &$%(
$//,+(0,8(*,(&,778%2&$*'(+2*4("'>$-*7'%*(Nb(
>'-1,%%'/(,-(&,7>8*'-(1&2'%:1*1(*,(1,/#'(0,8-(
>-,B/'7F(
(
*=TE) FV;E) @<V;) D;<]EPJ) HF) OE=FHY?E) YEO<;E)
P<CCH^IG)JKE)RCEZ))
(
32&4$'/(LF(M,77$-2*,(NND(9$%2'/(3$-:%(O$*P(

6,7>8*$:,%$/(6,7>/'R2*0(T'A-'14'-(
6,7>8*$:,%$/(&,7>/'R2*0(2%(*4'(&,%*'R*(,A(7,"'-%(&,7>8:%@(21((
((>-27$-2/0(A,&81'"(,%(*+,(-'1,8-&'15(
(
_M )#HCEA)c,+(/,%@(",'1(2*(*$.'(*,(>'-A,-7($(1'J8'%&'(,A(,>'-$:,%1d(
•  6CaeSCa(
•  QR$&*(#1F($>>-,R27$*'(1,/8:,%1(
)
`M )0J<;=GEA)c,+(78&4(1>$&'(",'1(2*(*$.'(*,(1*,-'(,8-(>-,B/'7d)
•  3'7,-0($%"( >'-121*'%* (1*,-$@'(X*,($(/'11'-("'@-''[(
•  9$*$(-'>-'1'%*$:,%1(
W'(*'%"(*,(&,778%2&$*'(:7'($%"(1*,-$@'(&,7>/'R2*0(*4-,8@4( M2@KE(%,*$:,%F (
32&4$'/(LF(M,77$-2*,(NND(9$%2'/(3$-:%(O$*P(

6,7>8*$:,%$/(6,7>/'R2*0(T'A-'14'-(
N%(&,7>8*$:,%$/(&,7>/'R2*0D( M2@KE(%,*$:,% (&,%#'01(2%A,-7$:,%((
(($B,8*(4,+(:7'($%"(1*,-$@'(&,1*1(1&$/'(+2*4(2%>8*1F(
(
• (?@AB5(&,%1*$%*(K(2%"'>'%"'%*(,A(2%>8*(
• (?@*B5(1&$/'1(/2%'$-/0(+2*4(*4'(12P'(,A(2%>8*(
• (?@*CDB5(1&$/'1(J8$"-$:&$//0(+2*4(*4'(12P'(,A(2%>8*(
• (?@*CEB5(1&$/'1(&8B2&$//0(+2*4(*4'(12P'(,A(2%>8*(
b4'1'(*'-71(,f'%(,&&8-(+2*4($.;!*!*'-71(
(($%"($-'(*4'%(@2#'%(*4'(>-';R( J8$12KF (
U,-(@-$>4($/@,-2*471D(*4'(2%>8*(*(21(*0>2&$//0((
• FGFD(*4'(%87B'-(,A(#'-:&'1(
• FHFD(*4'(%87B'-(,A('"@'1(
((((
32&4$'/(LF(M,77$-2*,(NND(9$%2'/(3$-:%(O$*P(

b$R,%,70(,A(3'*4,"1(
b421(*$R,%,70(,A(7'*4,"1(A,//,+1(*4'(421*,-0(,A(*4'2-("'#'/,>7'%*F(
)
• &HXHFHXE)*EJK<>F)
•  Q"@'KB'*+''%%'11(XGHHG[(
(
• *<>V?=;HJ@)*EJK<>F(
•  U$1*K@-''"0(XGHH^[(
•  g'$"2%@(Q2@'%#'&*,-(XGHHh[(
• &@I=CHP)*EJK<>F)
•  6/2J8'(>'-&,/$:,%(XGHHZ[(
•  W$/.*-$>(XGHHZ[(
32&4$'/(LF(M,77$-2*,(NND(9$%2'/(3$-:%(O$*P(

Q"@'(M'*+''%%'11(
+VY?HP=R<I2F4A))S2-#$%D()'+7$%8!!1.223*4/(!+/"3,/3"#!4*!+.,4%$!%*)!94.$.;4,%$!*#/6."7+F((C)!=D(GHHGF(
)
8=FHP)!>E=A))92#2"'(*4'(%'*+,-.(2%*,(18B1'J8'%*/0(17$//'-(>2'&'1(B0(;%"2%@('"@'1(*4$*( B-2"@' (&,778%2:'1F)
(
(<IFJ;=HIJFA)))
• )6$%(B'($"$>*'"(*,("2-'&*'"(%'*+,-.1(X2@-$>4[F(
• )6$%(B'($"$>*'"(*,(+'2@4*1(X%,(>8B/2&(1,f+$-'[F(
(
#HCE)(<CD?EBHJ@A)?@FGFCEB!2%(@'%'-$/D(?@FGFCD!$.;!FGFB(A,-(1>'&2$/(&$1'1%
32&4$'/(LF(M,77$-2*,(NND(9$%2'/(3$-:%(O$*P(

Q"@'(M'*+''%%'11(
a;<C)JKE)D=DE;A)
32&4$'/(LF(M,77$-2*,(NND(9$%2'/(3$-:%(O$*P(

i82&.(!12"'(<(j$&4 1(O$-$*'(6/8B(
:=PK=;@bF)9=;=JE)(?VY5(=,&2$/(%'*+,-.(,A(A-2'%"142>1(B'*+''%(_^(7'7B'-1(,A($(.$-$*'(
&/8B($*($(a=(8%2#'-12*0(2%(*4'(YIkH1(
.XEIJA)98-2%@(*4'(,B1'-#$:,%(>'-2,"D(*4'(&/8B(B-,.'(2%*,(G(17$//'-(&/8B1F((b421(1>/2*(
,&&8--'"($/,%@($(>-'K'R21:%@(1,&2$/("2#212,%(B'*+''%(*4'(*+,( &,778%2:'1 (2%(*4'(
%'*+,-.F(
(
&;=SI)O;<C)JKE)+=DE;A)j$&4$-0F(I*!4*:."2%&.*!J.6!2.)#$!:."!,.*J4,/!%*)!K++4.*!4*!
+2%$$!;".30+8(L,8-%$/(,A(!%*4-,>,/,@2&$/(T'1'$-&4(__D(YIkkF(
&<SI?<=>)JKE)&=J=A)4]>5ee+++K>'-1,%$/F872&4F'"8el7'`%e%'*"$*$e(
(((
( 32&4$'/(LF(M,77$-2*,(NND(9$%2'/(3$-:%(O$*P(

Q"@'(M'*+''%%'11(
E%/0(721&/$112;&$:,%(
32&4$'/(LF(M,77$-2*,(NND(9$%2'/(3$-:%(O$*P(

Q"@'(M'*+''%%'11(
M'*+''%%'11(*'%"1(*,(@'*(*4'(B2@(>2&*8-'(
-2@4*F(((
(
c,+'#'-D(-'1,/8:,%(&$%(B'($(>-,B/'7V(((
(
9,(%,*("-$+(&,%&/812,%1($B,8*(17$//(
&,778%2:'1(A-,7(*421($/@,-2*47($/,%'F(
32&4$'/(LF(M,77$-2*,(NND(9$%2'/(3$-:%(O$*P(

3,"8/$-2*0(
)
• (#(21(*4'(%87B'-(,A('"@'1(2%(7,"8/'(4!!
• ()(21(*,*$/("'@-''(,A(#'-:&'1(2%(7,"8/'(4((
• (2(21(*4'(*,*$/(%87B'-(,A('"@'1(2%(%'*+,-.(
)
c)HF)>HQE;EIPE)YEJSEEI)<YFE;XE>)P<IIEPRXHJ@)SHJKHI)C<>V?EF)=I>).3)O<;)
JKE)P<IdGV;=R<I)C<>E?)2>EG;EEW>HFJ;HYVR<I)dBE>4)
)
32&4$'/(LF(M,77$-2*,(NND(9$%2'/(3$-:%(O$*P(

3,"8/$-2*0(
T'7'7B'-(,8-(>-'#2,81("21&8112,%(,%(&,7>8*$:,%$/(&,7>/'R2*0d(
(
3,"8/$-2*0(7$R272P$:,%(21($%(5LM-%")!0".9$#2F(
(
b421(7'$%1(*4$*(*4'-'(21(%,(>,/0%,72$/(-'>-'1'%*$:,%(,A(:7'(&,7>/'R2*0V(
(
I$$!2#/-.)+!/-#"#:."#!/"(!/.!+.$'#!:."!%00".>42%/#!+.$3&.*+8!
(
(
32&4$'/(LF(M,77$-2*,(NND(9$%2'/(3$-:%(O$*P(

3,"8/$-2*0(
32&4$'/(LF(M,77$-2*,(NND(9$%2'/(3$-:%(O$*P(
M'%`$72%(cF(S,,"D(m#'1K!/'R$%"-'("'(3,%*`,0'(n(!$-,%(6/$81'*D((b4'(C'-A,-7$%&'(,A((
3,"8/$-2*0(3$R272P$:,%(2%(C-$&:&$/(6,%*'R*1D(C401F(T'#F(Q(oYD(H^hYHh(XGHYH[(
(

U$1*(S-''"0(
+VY?HP=R<I2F4A))
• ()'+7$%F((N%+/!%$;."4/-2!:."!)#/#,&*;!,.223*4/(!+/"3,/3"#!4*!*#/6."7+8(C401F(T'#F(QD(GHH^F(
• (6/$81'*D()'+7$%D(3,,-'F((N4*)4*;!,.223*4/(!+/"3,/3"#!4*!'#"(!$%";#!*#/6."7+8(C401F(T'#F((QD(GHH^F(
• (W$.2*$D(b18-872F(N4*)4*;!1.223*4/(!O/"3,/3"#!4*!P#;%M+,%$#!O.,4%$!5#/6."7+8(GHHkF((
(
8=FHP)!>E=A))
))b-0(*,(-$%",7/0($11'7B/'($(/$-@'-($%"(/$-@'-(&,778%2:'1(A-,7(*4'(@-,8%"(8>F((=*$-*(B0(>/$&2%@('$&4(#'-*'R(2%(2*1(
,+%(&,778%2*0($%"(*4'%(&,7B2%'(&,778%2:'1(*4$*(>-,"8&'(*4'(B'1*(7,"8/$-2*0($*(*4$*(1*'>F)
(
(<IFJ;=HIJFA)
• )6$%(B'($"$>*'"(*,("2-'&*'"('"@'1(X%,(>8B/2&[F(
• )6$%(B'($"$>*'"(*,(+'2@4*1(X2@-$>4[F(
(
#HCE)(<CD?EBHJ@A)?@FHFFGF!$.;!FGFB(+,-1*(&$1'(
32&4$'/(LF(M,77$-2*,(NND(9$%2'/(3$-:%(O$*P(

U$1*(S-''"0(
U$1*KS-''"0($/1,(*'%"1(*,($@@-'112#'/0(&-'$*'(
/$-@'-(&,778%2:'1(*,(*4'("'*-27'%*(,A(
17$//'-(&,778%2:'1F(
W40(21(*421(%,"'(-'"(2%1*'$"(,A(B/8'd(
32&4$'/(LF(M,77$-2*,(NND(9$%2'/(3$-:%(O$*P(

g'$"2%@(Q2@'%#'&*,-(
+VY?HP=R<I2F4A))
• ()'+7$%F(N4*)4*;!,.223*4/(!+/"3,/3"#!4*!*#/6."7+!3+4*;!/-#!#4;#*'#,/."+!.:!2%/"4,#+8!C401F(T'#F(QD(GHHhF(
• (g'2&4*D()'+7$%F(1.223*4/(!+/"3,/3"#!4*!)4"#,/#)!*#/6."7+8!C401F(T'#F(g']FD(GHHoF!
(
8=FHP)!>E=A)a1'(*4'(12@%(,%(*4'(&,7>,%'%*1(,A(*4'(/'$"2%@('2@'%#'&*,-(,A(*4'(g$>/$&2$%(*,(1'J8'%:$//0("2#2"'(*4'(
%'*+,-.F(
(
(<IFJ;=HIJFA)
• )6$%(B'($"$>*'"(*,("2-'&*'"('"@'1(X%,(>8B/2&[F(
• )6$%(B'($"$>*'"(*,(+'2@4*1(X2@-$>4[F(
(
#HCE)(<CD?EBHJ@A)?@FGFCDB(
32&4$'/(LF(M,77$-2*,(NND(9$%2'/(3$-:%(O$*P(

g'$"2%@(Q2@'%#'&*,-(
),*'( *4$*( '2@'%#'&*,- 1( -'18/*1(
1''7( *,( 1>/2*( *4'( "2p'-'%&'(
B'*+''%( '"@'( B'*+''%%'11( $%"(
A$1*K@-''"0(2%(*421(&$1'F(
W40($-'(*4'1'(%,"'1(%,*($(
>$-*(,A(*4'(/$-@'-(7,"8/'1d(
32&4$'/(LF(M,77$-2*,(NND(9$%2'/(3$-:%(O$*P(

W$/.*-$>(
+VY?HP=R<I2F4A)C,%1D(g$*$>0F(1.203&*;!,.223*4&#+!4*!$%";#!*#/6."7+!3+4*;!"%*).2!6%$7+8!LS!!D(GHHhF(
(
8=FHP)!>E=A))=278/$*'(7$%0(14,-*(-$%",7(+$/.1(,%(*4'(%'*+,-.($%"(&,7>8*'(>$2-+21'(1272/$-2*0(7'$18-'1(B$1'"(
,%(*4'1'(+$/.1F((a1'(*4'1'(1272/$-2*0(#$/8'1(*,($@@-'@$*'(#'-:&'1(2%*,(&,778%2:'1F(
(
(<IFJ;=HIJFA)
• (6$%(B'($"$>*'"(*,("2-'&*'"('"@'1(X2@-$>4[F(
• (6$%(B'($"$>*'"(*,(+'2@4*1(X2@-$>4[F(
• (6$%($/*'-(-'1,/8:,%(B0(+$/.(/'%@*4(X2@-$>4[F(
(
#HCE)(<CD?EBHJ@A)"'>'%"1(,%(+$/.(/'%@*4D(?@FGFCD!$.;!FGFB!/(04,%$$(!
32&4$'/(LF(M,77$-2*,(NND(9$%2'/(3$-:%(O$*P(

W$/.*-$>(
32&4$'/(LF(M,77$-2*,(NND(9$%2'/(3$-:%(O$*P(

W$/.*-$>(
W$/.*-$>($112@%1(#'-:&'1(*,("2p'-'%*(
&,778%2:'1(*4$%(>-'#2,81($/@,-2*471F(
(
),*'(*4$*(*4'(1278/$*'"(+$/.(/'%@*4(&$%(B'(
&4$%@'"(*,($/*'-(-'1,/8:,%F(
(
aV;JKE;C<;Ee)FHCV?=R<I)HF)FJ<PK=FRP)=I>)
JKVF);EFV?JF)C=@)PK=IGE)EXEI)=[E;)dBHIG)
JKE)S=?T)?EIGJK)=I>)HIDVJ)G;=DKZ)
(
(
32&4$'/(LF(M,77$-2*,(NND(9$%2'/(3$-:%(O$*P(

3'*4,"(6,7>$-21,%(
.>GEW8EJSEEIIEFF) a=FJW,;EE>@)
-E=>HIG).HGEIXEPJ<;)
N=?TJ;=D)
32&4$'/(LF(M,77$-2*,(NND(9$%2'/(3$-:%(O$*P(

T'&,77'%"'"(=,f+$-'(K(2@-$>4(
• (6,-'(g2B-$-05(6(
• (N%*'-A$&'15(C0*4,%D(TD(T8B0((
• (U'$*8-'15(S-$>4(,>'-$:,%1(n($/@,-2*471D(-$%",7(@-$>4(@'%'-$:,%D(@-$>4(1*$:1:&1D(
&,778%2*0("'*'&:,%D(#218$/2P$:,%(/$0,8*D(>/,q%@(
• (aTg5(4]>5ee2@-$>4F1,8-&'A,-@'F%'*e(
• (9,&87'%*$:,%5(4]>5ee2@-$>4F1,8-&'A,-@'F%'*e",&87'%*$:,%F4*7/(
(
32&4$'/(LF(M,77$-2*,(NND(9$%2'/(3$-:%(O$*P(

QR$7>/'(C0*4,%(=,8-&'(6,"'(
32&4$'/(LF(M,77$-2*,(NND(9$%2'/(3$-:%(O$*P(

U-,%:'-1(,A(6,778%2*0(9'*'&:,%5(
b'7>,-$/()'*+,-.(90%$72&1(
32&4$'/(LF(M,77$-2*,(NND(9$%2'/(3$-:%(O$*P(
Gergely Palla, Albert-Laszlo Barabasi & Tamas Vicsek, Quantifying
Social Group Evolution, Nature 446:7136, 664-667 (2007)

(
U-,%:'-1(,A(6,778%2*0(9'*'&:,%5(
6,778%2*0(=*-8&*8-'(E#'-(=&$/'1D(b27'(C'-2,"D('*&F((
32&4$'/(LF(M,77$-2*,(NND(9$%2'/(3$-:%(O$*P(
Science 14 May 2010, Vol. 328. no. 5980,
pp. 876 - 878

6,778%2*0(9'*'&:,%(T'#2'+(!-:&/'1(
0<CE)'FEOV?)$EXHES)6;RP?EFA))
)
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.(
32&4$'/(LF(M,77$-2*,(NND(9$%2'/(3$-:%(O$*P(

E8-(=2%.(C$>'-(<C4012&$(!(((
32&4$'/(LF(M,77$-2*,(NND(9$%2'/(3$-:%(O$*P(
We Will Discuss This Later ...

In Both Citation and Social Networks --
Algorithm Choice Matters

!
MICHAEL!J!BOMMARITO!II!!!!!!!!!DANIEL!MARTIN!KATZ!
!
Advanced(Network(Analysis(Methods:(
Exponen9al(Random(Graph(Models((p*)(
(
#

!%"(%,+($(#'-0(?@2&.(A0BC0D(
678,%'%9$/(:$%",;(<-$84(3,"'/1(=!">(
!  E@%*'-F(E$%"&,&.F(G@H1F(<,,"-'$@F(3,--21I(($%&'(#)#*+,-+&$#./#01.2#31'45+.$#+67#
81+&6/9$#:;!/6$6<+5=0+'15>#?/7$59#@/%#A$.B/%-9F(JKKLI(
!  M6:<3(;$0(*4'%(C'(@1'"(*,(@%"'-1*$%"($(8$-9&@/$-(
84'%,;'%,%(,-(*,(12;@/$*'(%'+(-$%",;(-'$/2N$9,%1(,O(
%'*+,-.1(*4$*(-'*$2%(*4'('11'%9$/(8-,8'-9'1(,O(*4'(,-2P2%$/IQ(
!  MR4'(8@-8,1'(,O(6:<3F(2%($(%@*14'//F(21(*,("'1&-2C'(
8$-12;,%2,@1/0(*4'(/,&$/(1'/'&9,%(O,-&'1(*4$*(14$8'(*4'(
P/,C$/(1*-@&*@-'(,O($(%'*+,-.IQ(
(
(
32&4$'/(SI(G,;;$-2*,(TT(F(U$%2'/(3$-9%(V$*N((

W*$919&$/()'*+,-.(3,"'/1(
!  23456(678/$2%(1,;'("'8'%"'%*(#'&*,-(C#2%(*'-;1(,O($(1'*(
,O(2%"'8'%"'%*(#$-2$C/'1(2%(DE#
!  FG19#9/4679#@+'151+%#H#1.I9#J49.#%$&%$991/6#+6+5>919K#
!  .7879:79;!<4=>4?576(:F(*4'(1'*(,O('"P'1(
!  :(&$%(C'(*4,@P4*(,O($1($(;$*-27(G'-%,@//2(#$-2$C/'1($12J
((2%"2&$9%P($%(
'"P'('7219%P(C'*+''%(#'-9&'1(1#$%"(J#
!  X%"2-'&*'"(P-$841(4$#'(10;;'*-2&(:F("2-'&*'"(P-$841(",(%,*(
%'&'11$-2/0I(
32&4$'/(SI(G,;;$-2*,(TT(F(U$%2'/(3$-9%(V$*N((

W*$919&$/()'*+,-.(3,"'/1(
!  .@4:A>9:7879:79;!
!  $12J((21(2%"'8'%"'%*(,O($-25#
!  '4B@!B(*421(;,"'/(21(Y@1*(1*$%"$-"(/,P219&(-'P-'112,%Z(
!  .@4:A:7879:79;!
!  $12J((21(6/.#6$,$99+%15>#2%"'8'%"'%*(,O($-25#
!  %4=:![(*421(;,"'/(-'?@2-'1(1,;'*42%P(;,-'(A'72C/'(*4$%(
-'P-'112,%Z(
32&4$'/(SI(G,;;$-2*,(TT(F(U$%2'/(3$-9%(V$*N((

W*$919&$/()'*+,-.(3,"'/1(
!  E,+(",(+'("'$/(+2*4(
"0$"B"'8'%"'%&'(
!  ]'(4$#'(:(,%(C,*4(12"'1F(+42&4(
/'$"1(*,(&,;8/'7(O''"C$&.1I(
!  3,"'/("'P'%'-$&0($%"(;21B
18'&2^&$9,%($C,@%"Z(
32&4$'/(SI(G,;;$-2*,(TT(F(U$%2'/(3$-9%(V$*N((

3_3_(
!  3_3_5(
!  "$C(`(3$-.,#(_4$2%((
!  "$D(`(3,%*'(_$-/,(
!  *4B>E!#:746!!
!  R$.'($(-$%",;(+$/.(*4-,@P4("21*-2C@9,%B18$&'(+4'-'(*4'(+$/.a1('?@2/2C-2@;(21(,@-(
*$-P'*(/2.'/24,,"("21*-2C@9,%(
!  DC@*(4,+(",(+'("'&2"'(4,+(*,(*$.'(,@-(-$%",;(+$/.(
!  D$%"(4,+(;$%0(-$%",;(1*'81(",(+'(%''"(*,(*$.'(
32&4$'/(SI(G,;;$-2*,(TT(F(U$%2'/(3$-9%(V$*N((

3_3_(
!  E,+(*,(+$/.(
!  3'*-,8,/21BE$19%P15(
"  3,#'($%('812/,%(2%(1*$*'B18$&'((
"  !&&'8*(,-(-'Y'&*(*4'(;,#'("'8'%"2%P(,%(*4'(M-'Y'&9,%(;'*4,"Q(
!  <2CC1(W$;8/2%P(
"  ]4$*(2O(+'(.%'+(*4'(&,%"29,%$/("21*-2C@9,%1(
"  DC@*(+4$*(2O(*4'-'(21(%,(8$*4(C'*+''%(-'P2,%1(,O(*4'(1*$*'B18$&'($/,%P(
&,%"29,%$//0(1$;8/'"(8$*41(
"  D,-(+4$*(2O(*4'(-2P4*(8$*4(,&&@-1(+2*4(1@&4($(/,+(8-,C$C2/2*0($1(*,(C'(@%B
1$;8/'$C/'(
32&4$'/(SI(G,;;$-2*,(TT(F(U$%2'/(3$-9%(V$*N((

6:<3(b(3_3_(
!  ]4$*(",'1(3_3_(;'$%(O,-(6:<3(
!  T;$P2%'(2O('$&4(1*$*'(+'-'($(8,112C/'(P-$84D(
!  ]'(&,@/"(P'%'-$*'($(/2.'/24,,"("21*-2C@9,%(,#'-(8,112C/'(P-$84Z(
!  ]'($/1,(,C*$2%(3_3_(1*$%"$-"('--,-1F(/'c%P(@1(*42%.($C,@*(,@-(
&,'d&2'%*('19;$*'1($1(;,-'(*4$%(Y@1*(8,2%*1I(
!  R421($//,+1(@1(*,(@1'(/2.'/24,,"(2%($//(*4'(-'P@/$-(+$01(=+2*4(
$(8-,8'-/0(18'&2^'"(;,"'/>I(
32&4$'/(SI(G,;;$-2*,(TT(F(U$%2'/(3$-9%(V$*N((

]4$*($C,@*(*4'(:EW(
!  W,(+4$*(2%*'-'19%P(*42%P1(&$%(+'(*4-,+(,%(*4'(:EW(
!  !11,-*$9#'(;272%P(+2*4(14$-'"(#'-*'7($H-2C@*'1(
!  U'%12*0((
!  _/@1*'-2%P(&,'d&2'%*(e(%@;C'-(,O(*-2$%P/'1(
!  f$*4(/'%P*4("21*-2C@9,%(
!  6"P'+21'(14$-'"(8$-*%'-1(
!  <',;'*-2&$//0B+'2P4*'"('"P'+21'(14$-'"(8$-*%'-1(=1$O'-Z>(
!  D(
!  !%0(#$-2$C/'(0,@(&$%(&,"'(0,@-1'/OZ(
32&4$'/(SI(G,;;$-2*,(TT(F(U$%2'/(3$-9%(V$*N((

678,%'%9$/(:$%",;(<-$84(3,"'/1(=!">(
!  .3EFG79;4H39I!
!  J;4;97;!K7?84L76!MN86OOEB:7PK4BM>9L;39P7:FOB;4;97;O=7B3F=E7BPBM;G5!
!  QB7=L=3F86!MN86OOEB:7PK4BM>9L;39P7:FOB;4;97;OB;4;97;RFB7=BRL=3F8PBM;G5!
!  S487=B!T3F!JM3F5:!$39BF5;6(
!  g-$%.F(hIF(b(W*-$@11F(UI(=ijLk>I(3$-.,#(P-$841I(L/4%6+5#/@#.G$#)'$%1,+6#3.+<9<,+5#)99/,1+</62#MN2#
MOP=MQPE##
#(
!  ]$11'-;$%F(WIF(b(f$c1,%F(fI(6I(=ijjk>I(l,P2*(;,"'/1($%"(/,P219&(-'P-'112,%1(O,-(1,&2$/(%'*+,-.15(TI(
!%(2%*-,"@&9,%(*,(3$-.,#(P-$841($%"(!"E#*9>,G/'$.%1-+2#RN2#QSN=QPTE##
!  !%"'-1,%F(_ISIF(]$11'-;$%F(WIF(b(_-,@&4F(GI(=ijjj>I(!(!m(8-2;'-5(l,P2*(;,"'/1(O,-(1,&2$/(%'*+,-.1E#
3/,1+5#A$.B/%-92#PN2#OU=RRE#(
!  W%2Y"'-1F(RI!IGI(=JKKJ>I(3$-.,#(&4$2%(3,%*'(_$-/,('19;$9,%(,O('78,%'%9$/(-$%",;(P-$84(;,"'/1I(
L/4%6+5#/@#3/,1+5#3.%4,.4%$2#O2#PE##
!  <$--0(:,C2%1F(R,;(W%2Y"'-1F(f'%P(]$%PF(3$-.(E$%"&,&.(b((f42/288$(f$c1,%(=JKKn>I(V$,$6.#
7$W$5/!'$6.9#16#$;!/6$6<+5#%+67/'#&%+!G#X!"Y#'/7$59#@/%#9/,1+5#6$.B/%-92#3/,1+5#A$.B/%-9F(Jj(
ijJ[JioI((
(
32&4$'/(SI(G,;;$-2*,(TT(F(U$%2'/(3$-9%(V$*N((

678,%'%9$/(:$%",;(<-$84(3,"'/1(=!">(
!  J3UK4=7!T3F!">LM;!$39B>:7=6(
(
(
"  :(W2'%$(=),+(!#$2/$C/'(O,-(:>(((
"  :@%1(6:<3(;,"'/1(
"  E$1(1,;'(&,;8@*$9,%$/(/2;2*$9,%1(=p(iKKK(%,"'1>(
(
"  !/1,F($//,+1(O,-(l,%P2*@"2%$/()'*+,-.(!%$/0121((
q  T%&/@"2%P($%$/0121(,O(/,%P2*@"2%$/("$*$(,O(%'*+,-.1($%"(C'4$#2,-(
(
4H85ee+++I1*$*1I,7I$&I@.ep1%2Y"'-1e12'%$e(((
32&4$'/(SI(G,;;$-2*,(TT(F(U$%2'/(3$-9%(V$*N((

678,%'%9$/(:$%",;(<-$84(3,"'/1(=!">(
!  J3UK4=7!T3F!">LM;!$39B>:7=6(
(
(
"  :(8$&.$P'("'#'/,8'"(C0(1,;'(,O(*4'(/'$"2%P(1&4,/$-1(=4H85ee
1*$*%'*I,-Pe>(
"  W*$*%'*(21($(1@2*'(,O(1,r+$-'(8$&.$P'1(O,-(1*$919&$/(%'*+,-.($%$/0121(
"  g@%&9,%$/2*0(21(8,+'-'"(C0($(3$-.,#(&4$2%(3,%*'(_$-/,(=3_3_>(
"  4H85ee&-$%I-B8-,Y'&*I,-Pe+'Ce8$&.$P'1e1*$*%'*e2%"'7I4*;/((
(
32&4$'/(SI(G,;;$-2*,(TT(F(U$%2'/(3$-9%(V$*N((

678,%'%9$/(:$%",;(<-$84(3,"'/1(=!">(
!  J5>:7B!T3F!">LM;!$39B>:7=!V3=!"3=7!#9V3=G4H39(
(
(
(
(
32&4$'/(SI(G,;;$-2*,(TT(F(U$%2'/(3$-9%(V$*N((

W*$*%'*(R@*,-2$/(
!  J;4;97;!-F;3=>45(
(
"  &!J;4;97;!-F;3=>45!
!J;7W79!"P!233:=74FX!!
!"4=Y!JP!%49:E3EYX!!
!.4W>:!,P!%F9;7=X!!
!$4=;7=!-P!*FNBX!49:!!
!"4=H94!"3==>BX!!
!
!!!!DZ!)3F=945!3V!J;4HBHE45! !!!!!!!!!
J3UK4=7!C![D]^P !!
(
4H85ee+++I%&C2I%/;I%24IP,#e8;&e$-9&/'1ef3_Jsstjsne(
32&4$'/(SI(G,;;$-2*,(TT(F(U$%2'/(3$-9%(V$*N((

u2"',(G$1'"(R@*,-2$/(
!  <>:73!T3F!">LM;!$39B>:7=6(
(
"  _$-*'-(G@H1(R@*,-2$/(v(f,/29&$/()'*+,-.1(_,%O'-'%&'(=UXV6(JKiK>((
"  U'1&-289,%5((4H85ee+++I8,/2I"@.'I'"@e8,/29&$/%'*+,-.1e"$0KiI4*;/((
(
"  3,-%2%P(W'112,%5((4H85ee9%0@-/I&,;eJt-t#j*(
q  !#$2/$C/'(2%(C,*4(g/$14(b(w@2&.9;'((
q  =4H85ee/'&*,82$I,2*I"@.'I'"@e2/'&*@-'1e2/'&*@-'1I/$11,@*`iKkob2"`Jnksk>(
"  !r'-%,,%(W'112,%5((4H85ee9%0@-/I&,;eJC87%@"(
q  !#$2/$C/'(2%(C,*4(g/$14(b(w@2&.9;'((
q  =4H85ee/'&*,82$I,2*I"@.'I'"@e2/'&*@-'1e2/'&*@-'1I/$11,@*`iKkob2"`Jnksn>(
(((
32&4$'/(SI(G,;;$-2*,(TT(F(U$%2'/(3$-9%(V$*N((

http://computationallegalstudies.com/2009/10/11/
programming-dynamic-models-in-python/
Diffusion / Social Epidemiology
We Will Discuss An
Applied Case Later
LaterButIfYouWant
to Learn to How To
Program the SIR
ModelinPython

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.)

Example Project #1:
Network Analysis of the
Social Structure of the
the Federal Judiciary

Hustle & Flow: A Social Network
Analysis of the American
Federal Judiciary
Daniel Martin Katz Derek K. Stafford

the Federal Judicial Heirarchy
United States
Supreme Court
Federal Court
of Appeals
Federal District Court

What is the Social Topology of
the American Federal Judiciary?

... And How Can We Measure it?

Collected Nearly 19,000 Law Clerk ‘Events’
1995 - 2005 For All Article III Judges
Relying Upon Data From Staff Directories
Network Analysis of

The Core Claim
In the Aggregate ...
Law Clerk Movements Reveal
Between Judicial Actors
Social or Professional Relationships

Network Analysis of
Judge E
Justice ZJustice Y
Judge C
Judge D
Judge B
Judge A

Network Analysis of

Highly Skewed
Distribution of Social
Authority
!

Thirty Most
Central
Non-SCOTUS
Federal Judges
(1995-2005)
(Eigenvector
Centrality)
(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

More Information Here
Daniel Katz &
Derek Stafford
(2010)

Example Project #2:
Reproduction of Hierarchy?  
A Social Network Analysis of the
American Law Professoriate

Reproduction of Hierarchy?  
A Social Network Analysis of the
Daniel Martin Katz
Josh Gubler
Jon Zelner
Michael Bommarito
Eric Provins
Eitan Ingall

Motivation for Project
Why Do Certain Paradigms, Histories, Ideas Succeed?
Function of the ‘Quality’ of the Idea
Social Factors also Inﬂuence the Spread of Ideas
Most Ideas Do Not Persist ....

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

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

Social Network Analysis of the
Data Collection

Building A Graph Theoretic
Representation
Cornell
Harvard Penn

Building the Full Dataset
....

7,054 Law Professors
p = {p1, p2, ... p7240}
184 ABA Accredited Institutions
n = {n1 , n2, … n184}
Full Data Set
....

Visualizing a Full Network
Using a Layout Algorithm

Zoomable Visualization Available @

A Graph-Based Measure
of Centrality

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...

Hub
Score
Rank
US News
Peer
Assessment
Hub
Score
Institution
1 1 1 Harvard
2 1 0.9048631 Yale
3 5 0.8511497 Michigan
4 4 0.7952253 Columbia
5 5 0.7737389 Chicago
6 8 0.7026757 NYU
7 1 0.6668868 Stanford
8 8 0.6607399 Berkeley
9 10 0.6457157 Penn
10 10 0.6255498 Georgetown
11 5 0.5854464 Virginia
12 14 0.5014904 Northwestern
13 10 0.4138745 Duke
14 10 0.4075353 Cornell
15 15 0.3977734 Texas
16 28 0.3787268 Wisconsin
17 19 0.3273598 UCLA
18 24 0.2959581 Illinois
19 28 0.2919847 Boston University
20 28 0.2513371 Minnesota
21 24 0.2403289 Iowa
22 28 0.2275534 Indiana
23 19 0.2235015 George
Washington24 16 0.2174677 Vanderbilt
25 41 0.2012442 Florida
Hub
Score
Rank
US News
Peer
Assessment
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.115086 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.103149 Washington & Lee
49 72 0.1027442 Miami
50 103 0.1006172 SUNY Buffalo
Hub Scores

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.115086 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.103149 Washington & Lee
49 72 0.1027442 Miami
50 103 0.1006172 SUNY Buffalo

Distribution of
Social Authority

Top 20 Institutions
(By Raw Placements)

Highly Skewed Nature of
Legal Systems
Smith 2007
Post & Eisen 2000Katz & Stafford 2010
!

Implications for Rankings
Rankings only Imply Ordering ( >, =, < )
End Users tend to Conﬂate Ranks with
Linearized Distances Between Units
(Tversky 1977)
Non-Stationary Distances Between Entities
Both Trivial and Large Distances
Linearity Heuristic Often Works
Assuming Linearity Can Prove Misleading

Computational Model of
Information Diffusion

Why Computational
Simulation?
History only Provides a Single Model Run
Computational Simulation allows ...
Consideration of Alternative “States of the world”
Evaluation of Counterfactuals

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”

A Basic Description
of the Model
Consider a Hypothetical Idea Released
at a Given Institution
Infectiousness Probability = p
Two Forms Diffusion...
Direct Socialization
Signal Giving to Former Students
Infect neighbors, neighbors-neighbors, etc.

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

Run a Simulation
on Your Desktop
http://computationallegalstudies.com/2009/04/22/the-revolution-will-not-be-televised-but-will-it-
come-from-harvard-or-yale-a-network-analysis-of-the-american-law-professoriate-part-iii/
(Requires Java 5.0 or Higher)

From a Single Run to
Consensus Diffusion Plot
Netlogo is Good for Model Demonstration
Regular Programming Language Typically
Required for Full Scale Implementation
We Used Python
http://www.python.org/
Object Oriented Programming Language

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 Schools
Exponential, linear and sub-linear

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

Differential Host Susceptibility
Some Potential
Model Improvements?
Countervailing Information / Paradigms
S I R Model Susceptible-Infected-Recovered

Directions for
Future Research
Longitudinal Data
Hiring/Placement/Laterals
Current Collecting Data
Database Linkage to Articles/Citations
Working with Content Providers
Empirical Evaluation of Simulation
Computational Lingusitics
Text Mining, Sentiment Coding

Example Project #3:
On the Road to the
Legal Genome Project ...
Dynamic Community Detection
&
Distance Measures for
Dynamic Citation Networks

Distance Measures for
Dynamic Citation Networks
Michael J. Bommarito II
Daniel Martin Katz
Jon Zelner
James H. Fowler

How Can We
Track the Novel
Combination,
Mutation and
Spread of Ideas?

Information Genome Project
The Development, Mutation
and and Spread of Ideas
Precedent in Common Law Systems
Patent Citations
Bibliometric Analysis

Citations
Represent the
Fossil Record

They are the
Byproduct of
Dynamic Processes

Leverging the
Ideas in Network
Community
Detection

Want to Develop a
Method that can
Identify the Time
Dependant ...

Changing
Relationships
between Various
Intellectual
Concepts

(1)Patent Citations
(2) Judicial Decisions
(3) Academic Articles

Applied Traditional Methods to
SCOTUS Citation Network

Applied Traditional Methods to
SCOTUS Citation Network
#EPICFAIL

Here is Proof of the #EPICFAIL

Reported the Results
at ASNA 2009

Key Points from the
ASNA 2009 Paper

We Decided to Go
Back to First
Principles

Growth Rules
For Citation Networks

Dynamic Directed
Acyclic Graphs

Dynamic Directed
Acyclic Graphs
Examples:
Academic Articles

Dynamic Directed
Acyclic Graphs
Examples:
Academic Articles
Judicial Citations

Dynamic Directed
Acyclic Graphs
Examples:
Academic Articles
Judicial Citations
Patent Citations

Network Dynamics:
The Early Jurisprudence of the
United States Supreme Court

Cases Decided by
the Supreme Court
Citations in the
Current Year
Citations from
prior years
PLAY MOVIE!
2010/02/11/the-development-of-structure-in-
the-citation-network-of-the-united-states-
supreme-court-now-in-hd/

Six Degrees of Marbury v. Madison

Basic Idea of Sink Based
Distance Measure

The Simplest Non-Trivial
Distance Measure

Flexible Framework For More
Detailed Specifications

Distance Measure
<- ->
Dendrogram

http://ssrn.com/author=627779
http://arxiv.org/abs/0909.1819available at:

Expect More in
Judicial Citation
Dynamics ....

Here is Another
Application ...

Potential Application to
Patent Citations?

Sternitzke, Bartkowski & Schramm (2008)
Potential Application to
Patent Citations?

Network Analysis of
Patent Citations

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

Some
Papers
For
Your
Consideration

@computational
Thank You For Your Attention!

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

Recommended

Recommended

More Related Content

What's hot

What's hot (20)

Viewers also liked

Viewers also liked (20)

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

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

More from Daniel Katz

More from Daniel Katz (19)

Recently uploaded

Recently uploaded (20)

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