Spectral gap of a graph
The spectral (or eigen) gap of a graph is the absolute difference between the biggest and second biggest eigenvalue of the adjacency matrix. To compare spectral gaps across networks, the fraction can be used.
spectral_gap(g, method = "frac")
g |
igraph object |
method |
A string, either "frac" or "abs" |
The spectral gap is bounded between 0 and 1 if method="frac". The closer
the value to one, the bigger the gap.
Numeric value
David Schoch
#The fractional spectral gap of a threshold graph is usually close to 1 g <- threshold_graph(50,0.3) spectral_gap(g,method = "frac")
Please choose more modern alternatives, such as Google Chrome or Mozilla Firefox.