pith. sign in

arxiv: 1309.6629 · v1 · pith:6Y6T3QK2new · submitted 2013-09-25 · 🌊 nlin.AO · cs.SI· math.CO

Stability of the Centrality of Unions of Networks on the Same Vertex Set

classification 🌊 nlin.AO cs.SImath.CO
keywords centralitynetworkssamestabilityvertexassumebetweennessconsider
0
0 comments X
read the original abstract

Let $G^1(V,E_1)$ and $G^2(V,E_2)$ be two networks on the same vertex set $V$ and consider the union of edges $G(V, E_1 \cup E_2)$. This paper studies the stability of the Degree, Betweenness and Eigenvector Centrality of the resultant network, $G(V, E_1 \cup E_2)$. Specifically assume $v^1_{max}$ and $v^c_{max}$ are the highest centrality vertices of $G^1(V,E_1)$ and $G(V, E_1 \cup E_2)$ respectively, we want to find $Pr(v^1_{max} = v^c_{max})$.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.