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.
Usage
spectral_gap(g, method = "frac")
Arguments
g
igraph object
method
A string, either "frac" or "abs"
Value
Numeric value
Details
The spectral gap is bounded between 0 and 1 if method="frac". The closer
the value to one, the bigger the gap.