centrality_access_information: Access and Hide Information

View source: R/centrality-batch8.R

centrality_access_informationR Documentation

Access and Hide Information

Description

Access and hide information (Rosvall et al. 2005; Sneppen, Trusina and Rosvall 2005) measure the number of bits a walker needs to follow a shortest path without a map. The search information from i to j sums over all shortest paths p(i, j), with k_i the degree of the source and k_l - 1 the choices left at each intermediate node:

S(i \to j) = -\log_2 \sum_{p(i, j)} \frac{1}{k_i} \prod_{l \in p,\, l \ne i, j} \frac{1}{k_l - 1}.

Access information A_i averages S(i \to j) over targets j, and hide information H_i averages S(j \to i) over sources.

Usage

centrality_access_information(x, ...)

centrality_hide_information(x, ...)

Arguments

x

Network input accepted by centrality.

...

Further arguments to centrality, such as normalized.

Details

Distances are hop counts, so edge weights are ignored. On a directed network every step uses the out-degree. The average runs over the nodes a walker can reach, or be reached from, so values stay finite on a disconnected network and equal the source's 1/N average on a connected one. Hubs score high on access information and low on hide information. On a star with five leaves the hub has access information 1.93 bits and hide information 0, and each leaf has access information 1.33 bits. The Centrality Zoo states the star case in reverse, and the values above follow the formulas and the source papers.

Value

A named numeric vector with one score per node, in input node order, in bits.

References

Rosvall, M., Trusina, A., Minnhagen, P., & Sneppen, K. (2005). Networks and cities: An information perspective. Physical Review Letters, 94, 028701.

Sneppen, K., Trusina, A., & Rosvall, M. (2005). Hide-and-seek on complex networks. Europhysics Letters, 69(5), 853-859.

See Also

centrality_closeness, centrality.

Examples

centrality_access_information(regulation_net)
centrality_hide_information(regulation_net)

cograph documentation built on Nov. 19, 2026, 5:07 p.m.