Stability of the Centrality of Unions of Networks on the Same Vertex Set
Abstract
Let G1(V,E1) and G2(V,E2) be two networks on the same vertex set V and consider the union of edges G(V, E1 E2). This paper studies the stability of the Degree, Betweenness and Eigenvector Centrality of the resultant network, G(V, E1 E2). Specifically assume v1max and vcmax are the highest centrality vertices of G1(V,E1) and G(V, E1 E2) respectively, we want to find Pr(v1max = vcmax).
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.