The seformed graph laplacian and its applications to network centrality analysis
We introduce and study a new network centrality measure based on the concept of nonbacktracking walks; that is, walks not containing subsequences of the form $uvu$ where $u$ and $v$ are any distinct connected vertices of the underlying graph. We argue that this feature can yield more meaningful rank...
| Main Authors: | , , |
|---|---|
| Format: | Journal article |
| Published: |
Society for Industrial and Applied Mathematics
2018
|