Papers
Topics
Authors
Recent
Search
2000 character limit reached

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

Published 25 Sep 2013 in nlin.AO, cs.SI, and math.CO | (1309.6629v1)

Abstract: Let $G1(V,E_1)$ and $G2(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 $v1_{max}$ and $vc_{max}$ are the highest centrality vertices of $G1(V,E_1)$ and $G(V, E_1 \cup E_2)$ respectively, we want to find $Pr(v1_{max} = vc_{max})$.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.