Comparing the eigenvector and degree dispersion with the principal ratio of a graph
The principal ratio of a graph is the ratio of the greatest and least entry of its principal eigenvector. Since the principal ratio compares the extreme values of the principal eigenvector it is sensitive to outliers. This can be problematic for graphs (networks) drawn from empirical data. To accoun...
| Main Author: | |
|---|---|
| Format: | Journal article |
| Language: | English |
| Published: |
Taylor and Francis
2022
|