2 citations · 2 across the 1 of their papers we have counts for
1 paper · 2 filters
A. Khorunzhy, V. Vengerovsky
We observe that the Laplacian of a random graph G on N vertices represents and explicitly solvable model in the limit of infinitely increasing N. Namely, we derive recurrent relati…