The gravity of an edge
Abstract ■■■ We describe a methodology for characterizing the relative structural importance of an arbitrary network edge by exploiting the properties of a k-shortest path algorithm. We introduce the metric Edge Gravity, measuring how often an edge occurs in any possible network path, as well as k-G...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
SpringerOpen
2018-05-01
|
| Series: | Applied Network Science |
| Subjects: | |
| Online Access: | http://link.springer.com/article/10.1007/s41109-018-0063-6 |