I have a dataset of 150 individual cows (150 IDs) with 288 GPS locations per day and for 10 days, where each row is a relocation (432.000 rows) and columns store cow's ID, a time stamp (date and time)...

I have a matrix M with size (37, N) and an additionnal 1D reference vector of size (37,1) I am looking for a way to compute the spearman correlation between each sample of M and my reference to obtain ...

I am using graph-tool to plot an adjacency matrix from a dataframe. The adjacency matrix looks correct and symmetric, but when I plot it using graph-tool, the resulting visualization is incorrect. (I ...

I want to do exactly the same thing as this post, but in python; aka given a list of natural integers, generate a random adjacency matrix whose degrees would match the list. I had great hope as the ...

How to convert a graph to a sparse ‘dgTmatrix’ in one step? library(igraph) library(Matrix) g <- make_ring(5) adj <- as_adjacency_matrix(g, sparse = TRUE) class(adj) # [1] "dgCMatrix" #...

It's relatively easy to see that, for a network with Adjacency matrix A, the number of 3-loops is (1/6)Tr(A^3). For 4-loops, we need (1/8)[Tr(A^4) - 2(sigma(k^2)) + sigma(k)] where k are the node ...

The data x and y represent the geographic coordinates of the centroids of cities 1 to 8: > df <- data.frame( + ID = 1:8, + x = c(4.0, 7.0, 2.5, 8.0, 3.0, 5.0, 6.0, 7.0), + y = c(8, 9, 4, 5,...

I have a dataframe that consists of x rows and n columns. Each row represents a document and each column represents a category of tag associated with the document. The values in each cell are a 0 (...

In our problem, rows (index) and columns belong to the same category of objects. We want to enlarge a Pandas DataFrame, adding rows and columns filled with NaNs or predefined values, so that both the ...

I have a dataframe of this structure: A <- data.frame(A = c("B",NA,NA,NA), B = c("C","D",NA,NA), C = c(NA,NA,NA,NA), ...

I am working on a fraud detection project using GNN. My graph has banking codes (SWIFT BIC codes) as nodes and the edges represent transactions. Below are the shapes of my tensors: Node Features ...

The following is a seemingly simple recursion for finding a hybercube matrix. The recursion is defined as: (Formula) I tried to put it into code but I keep running into broadcasting issues with numpy. ...

For the follwoing data that represents the flow of the tourist by months for these five countries, I would like to draw a multiple bar plot such that one row of the mutliple bar plot represents the ...

What is a good way to define this graph data structure: typedef struct { unsigned short isExists : 1; WEIGHT_TYPE weight; } Weight; typedef struct { Weight adjacencyMatrix[VERTICES_NUM][...

I'm experiencing a strange exception when calling the fit_predict method on a PageRank object, with data coming from an edge list. I get the 'TypeError: The input matrix must be in Scipy sparse format ...