Table 1 Some information on the graphs used in the experiments. A denotes the \(n \times n\) adjacency matrix of the LCC of each graph
From: Rational Krylov methods for fractional diffusion problems on graphs
Graph | n | nnz(A) | nnz(A-A’) | \(\lambda _2\) | \(\lambda _n\) |
|---|---|---|---|---|---|
minnesota | 2640 | 6604 | 0 | 8.45e−04 | 6.88e+00 |
Oregon-1 | 11174 | 46818 | 0 | 8.44e−02 | 2.39e+03 |
ca-HepPh | 11204 | 235238 | 0 | 3.55e−02 | 4.92e+02 |
as-22july06 | 22963 | 96872 | 0 | 5.07e−02 | 2.39e+03 |
Roget | 904 | 4830 | 4128 | 8.22e−02 | 2.27e+01 |
wiki-Vote | 1300 | 39456 | 67204 | 3.73e−01 | 5.96e+02 |
enron | 8271 | 146260 | 212124 | 7.01e−02 | 8.79e+02 |
p2p-Gnutella30 | 8490 | 31706 | 63412 | 2.47e−01 | 2.00e+01 |
hvdc1 | 24836 | 133620 | 4856 | 2.03e−04 | 1.80e+02 |