Timeline for Another betweenness centrality measure: neighbourhood centrality
Current License: CC BY-SA 4.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 7, 2021 at 21:18 | comment | added | Matthieu Latapy | I see, thank you for explaining further. Indeed, the distribution of neighbourhood properties, like their size (vertex degree), density (clustering coefficient), and others (like the neighbourhood centrality that you define) sheds light on important network features. Correlations between these metrics are also important. | |
| May 7, 2021 at 11:51 | comment | added | Hans-Peter Stricker | @MatthieuLatapy: I didn't suggest to compare ego-networks (which may differ a lot) but large graphs (of a given class, e.g. $G(n,m)$). For each such graph the distribution of neighbourhood centrality can be determined (which will reveal the diversity and heterogeneity of nodes and their ego-nets) and will be roughly the same in large classes (of large graphs). | |
| May 7, 2021 at 8:57 | comment | added | Matthieu Latapy | I think Leo has a point, and I would go further: ego-networks in a given network are very different from each other. Think of their size, which is nothing but vertex degrees: they are very heterogeneous in many (most?) practical cases; in addition, many degrees are extremely small. Although interesting, comparing the properties of graphs with such differences and such small sizes seems difficult. | |
| May 7, 2021 at 1:13 | comment | added | Leo | I would contest the statement that the ego-nets tend to be disconnected in general. In a graph with high local clustering coefficient, I would expect then to be connected more frequently than not. | |
| May 7, 2021 at 0:14 | history | edited | Hans-Peter Stricker | CC BY-SA 4.0 |
deleted 664 characters in body
|
| May 6, 2021 at 21:11 | history | edited | Hans-Peter Stricker | CC BY-SA 4.0 |
added 682 characters in body
|
| May 6, 2021 at 19:45 | comment | added | Hans-Peter Stricker | @SteveHuntsman: Thanks for the hint. The article also considers ego-deleted ego-networks $N(\nu)$, only under the name $G_i$. | |
| May 6, 2021 at 19:16 | comment | added | Steve Huntsman | This seems to convey essentially the same information (but not saying it is the same thing) as a flavor of efficiency (en.wikipedia.org/wiki/Efficiency_(network_science)) with respect to a modified version of the discrete metric that takes the value $\infty$ when a target is unreachable from a source. | |
| May 6, 2021 at 18:22 | history | edited | Hans-Peter Stricker | CC BY-SA 4.0 |
added 19 characters in body
|
| May 6, 2021 at 18:02 | history | asked | Hans-Peter Stricker | CC BY-SA 4.0 |