
Local Information Dimensionality
Source:R/centrality-batch7.R
centrality_local_information_dimension.RdLocal information dimensionality (Wen and Deng 2020) weights the local dimension by information. With \(p_i(l) = B_i(l) / N\) the share of the network within \(l\) hops of \(i\), the node included, and box information \(I_i(l) = -p_i(l) \ln p_i(l)\), the measure is minus the least-squares slope of \(I_i(l)\) on \(\ln l\) for \(l = 1, \ldots, \lceil d_{\max}(i) / 2 \rceil\): $$D^I_i = -\frac{d I_i(l)}{d \ln l}.$$
Arguments
- x
Network input accepted by
centrality.- mode
For directed networks:
"all"(default),"out"or"in".- ...
Further arguments to
centrality, such asnormalized.
Details
Distances are hop counts, so edge weights are ignored. On a directed
network mode sets the direction of the paths. Higher values mark
more influential nodes. A node with a single box size returns the
discretized derivative of the source,
\(l (1 + \ln p_i(l))\, n_i(l) / N\). A
node that reaches no other node returns NaN.