arXiv hepth
This is the network of publications in the arXiv's High Energy Physics –
Theory (hepth) section. The directed links that connect the publications are
citations.
Metadata
Statistics
Size  n =  27,770

Volume  m =  352,807

Loop count  l =  39

Wedge count  s =  37,101,609

Claw count  z =  8,172,939,577

Cross count  x =  3,139,197,249,029

Triangle count  t =  1,478,735

Square count  q =  63,698,507

4Tour count  T_{4} =  658,699,062

Maximum degree  d_{max} =  2,468

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

Maximum indegree  d^{−}_{max} =  2,414

Average degree  d =  25.409 2

Fill  p =  0.000 457 494

Size of LCC  N =  27,400

Size of LSCC  N_{s} =  7,464

Relative size of LSCC  N^{r}_{s} =  0.268 779

Diameter  δ =  15

50Percentile effective diameter  δ_{0.5} =  3.689 70

90Percentile effective diameter  δ_{0.9} =  5.355 75

Median distance  δ_{M} =  4

Mean distance  δ_{m} =  4.269 57

Gini coefficient  G =  0.570 239

Balanced inequality ratio  P =  0.285 445

Outdegree balanced inequality ratio  P_{+} =  0.306 250

Indegree balanced inequality ratio  P_{−} =  0.238 017

Relative edge distribution entropy  H_{er} =  0.937 827

Power law exponent  γ =  1.389 89

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

Degree assortativity  ρ =  −0.030 312 5

Degree assortativity pvalue  p_{ρ} =  0.000 00

In/outdegree correlation  ρ^{±} =  +0.277 949

Clustering coefficient  c =  0.119 569

Directed clustering coefficient  c^{±} =  0.199 169

Spectral norm  α =  111.322

Operator 2norm  ν =  85.160 7

Cyclic eigenvalue  π =  10.801 1

Algebraic connectivity  a =  0.064 997 8

Spectral separation  λ_{1}[A] / λ_{2}[A] =  1.223 53

Reciprocity  y =  0.002 848 58

Nonbipartivity  b_{A} =  0.391 840

Normalized nonbipartivity  b_{N} =  0.036 274 2

Spectral bipartite frustration  b_{K} =  0.000 633 054

Controllability  C =  6,718

Relative controllability  C_{r} =  1.090 00

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]

Jure Leskovec, Jon Kleinberg, and Christos Faloutsos.
Graph evolution: Densification and shrinking diameters.
ACM Trans. Knowl. Discov. from Data, 1(1):1–40, 2007.
