get_k_stages_adjacency_tensor: Computes a list of r-stage adjacency matrices.
Description
Computes a list of r-stage adjacency matrices, each matrix in the list inidicates whether or not nodes \(i\) and \(j\) are r-stage neighbours in the underlying network. Essentially \([\mathbf{S}_r]_{ij} = 1 \) if and only if \(d(i, j) = r\)
Usage
get_k_stages_adjacency_tensor(St_1, r)
Value
List containing the adjacency matrices in ascending order.
\( \{ \mathbf{S}_q \}_{q=1}^{q = r} \)
Each entry is the r-stage adjacency matrix at depth \(r\).
Arguments
St_1
One-stage adjacency matrix (i.e., the adjacency matrix of the underlying network).
r
Maximum r-stage for which one wishes to compute the r-stage adjacency matrix.
Author
Daniel Salnikov and Guy Nason
References
Nason, G.P., Salnikov, D. and Cortina-Borja, M. (2023)
New tools for network time series with an application to COVID-19
hospitalisations. https://arxiv.org/abs/2312.00530