Node influence metric
≈ 2 min read
Names in other languages
No names in other languages are held for this entry yet.
Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.
In graph theory and network analysis, node influence metrics are measures that rank or quantify the influence of every node (also called vertex) within a graph. They are related to centrality indices. Applications include measuring the influence of each person in a social network, understanding the role of infrastructure nodes in transportation networks, the Internet, or urban networks, and the participation of a given node in disease dynamics.
In graph theory and network analysis, node influence metrics are measures that rank or quantify the influence of every node (also called vertex) within a graph. They are related to centrality indices. Applications include measuring the influence of each person in a social network, understanding the role of infrastructure nodes in transportation networks, the Internet, or urban networks, and the participation of a given node in disease dynamics. \kappa_i^{(h)} = \exp \left( - \sum_j p_j^{(h)} \log p_j^{(h)} \right) The probabilities can be based on uniform-probability random walks, or additionally modulated by edge weights and/or explicit (per edge) transmission probabilities. \kappa_i = - \sum_{j=1}^J d_j \log(d_j) where the sum is taken over the set J of all possible transmission clusters resulting from two transmissions starting from i . That is, node i and two of its neighbors or i , one of its neighbors (called infected) and a neighbor of the infected neighbor. J contains all possible orderings of the transmission events, so two clusters may contain the same nodes if they got infected in a different order. d_j is the normalized cluster degree of cluster j \in J , that is, the number of edges with exactly one endpoint in cluster j . The definition naturally extends to directed networks by limiting the enumeration J by edge direction. Likewise, extension to weighted networks, or networks with heterogeneous transmission probabilities, is a matter of adjusting the normalization of d_j to include the probability that that cluster forms. It is also possible to use more than two transmissions to define the set J .
References
Text derived from https://en.wikipedia.org/w/index.php?oldid=1369642116 under CC BY-SA 4.0; modifications have been made.