get_k_stages_adjacency_tensor | R Documentation |
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
get_k_stages_adjacency_tensor(St_1, r)
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. |
List containing the adjacency matrices in ascending order.
\eqn{ \{ \mathbf{S}_q \}_{q=1}^{q = r} } |
Each entry is the r-stage adjacency matrix at depth |
Daniel Salnikov and Guy Nason
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
#
# Produce the r-stage adjacency tensors for the fiveNet network.
#
get_k_stages_adjacency_tensor(as.matrix(GNARtoigraph(fiveNet)), 3)
#
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.