4 ms·
https://en.wikipedia.org/wiki/Adjacency_matrix https://en.wikipedia.org/wiki/Adjacency_matrix What would a graph look like when edges are represented with less
by ganzuul 3y ago
https://en.wikipedia.org/wiki/Adjacency_matrix https://en.wikipedia.org/wiki/Adjacency_matrix
What would a graph look like when edges are represented with less than 1-bit?
- robrenaud 3y agoIt would have predictible structure. There would be groupwise, regular sparsity. You could exploit these patterns to infer properties like, "there is no connection from this vertex to this entire span of verticies". Just think about representing a compressed version of a matrix. You want to have a short encoding for matrices are ones that are more ordered in some real, exploitable way. With some determnistic computation of the compressed representation, you could produce the full adjacency matrix.
- ganzuul 3y agohttps://proceedings.mlr.press/v206/meller23a/meller23a.pdf https://proceedings.mlr.press/v206/meller23a/meller23a.pdf It seems to have a lot of similarities to the technique in OPs article.
- selecsosi 3y agoI think the problem is that you are also trying to represent the biases of directionality in the connection e.g.: [-1,0,1]. In the adjacency matrix, if you store the sign (direction) of the edge, then I think that would map fairly isomorphically.
- ganzuul 3y agoBasically factorized into a giant state machine. Would be logical.