US patents
This is the citation network of patents registered with the United States
Patent and Trademark Office. Each node is a patent, and a directed edge
represents a patent and an edge represents a citation. The network does not
contain loops, i.e., selfcitations, and is acyclic.
Metadata
Statistics
Size  n =  3,774,768

Volume  m =  16,518,947

Wedge count  s =  335,781,273

Claw count  z =  6,803,403,509

Cross count  x =  387,506,408,979

Triangle count  t =  7,515,023

Square count  q =  341,906,226

4Tour count  T_{4} =  4,111,412,794

Maximum degree  d_{max} =  793

Maximum outdegree  d^{+}_{max} =  770

Maximum indegree  d^{−}_{max} =  779

Average degree  d =  8.752 30

Fill  p =  1.159 32 × 10^{−6}

Size of LCC  N =  3,764,117

Size of LSCC  N_{s} =  1

Relative size of LSCC  N^{r}_{s} =  2.649 17 × 10^{−7}

Diameter  δ =  26

50Percentile effective diameter  δ_{0.5} =  7.708 80

90Percentile effective diameter  δ_{0.9} =  9.482 76

Mean distance  δ_{m} =  8.244 90

Gini coefficient  G =  0.516 094

Relative edge distribution entropy  H_{er} =  0.968 856

Power law exponent  γ =  1.608 72

Tail power law exponent  γ_{t} =  4.001 00

Degree assortativity  ρ =  +0.167 679

Degree assortativity pvalue  p_{ρ} =  0.000 00

Clustering coefficient  c =  0.067 142 1

Spectral norm  α =  113.040

Operator 2norm  ν =  112.215

Reciprocity  y =  0.000 00

Nonbipartivity  b_{A} =  0.013 644 5

Normalized nonbipartivity  b_{N} =  0.008 306 86

Plots
Matrix decompositions plots
Downloads
References
[1]

Jérôme Kunegis.
KONECT – The Koblenz Network Collection.
In Proc. Int. Conf. on World Wide Web Companion, pages
1343–1350, 2013.
[ http ]

[2]

Bronwyn H. Hall, Adam B. Jaffe, and Manuel Trajtenberg.
The NBER patent citations data file: Lessons, insights and
methodological tools.
In NBER Working Papers 8498, Natl. Bureau of Economic
Research, Inc, 2001.
