-
The current implementation reads position data from a file and positions the vertices accordingly. By default these would directly correspond to spatial positions in the recording or the simulation. I…
-
### Description
### Expected behavior with the suggested feature
- [ ] [ContraRec: "Sequential Recommendation with Multiple Contrast Signals" Wang et al., TOIS'2022.](https://github.com/TH…
-
```
Modular decomposition refers to the process of building a modular
decomposition tree. These can yield very interesting properties about
graphs (directed, undirected, and hypergraphs alike). Mo…
-
Hello authors of ViHGNN,
When I tried to run the fuzzy c-means to form hypergraphs, I found the hyperedge matrix is suspiciously dense, so I went back to check the actual implementation and found t…
-
### The problem
We need to understand how to use machine learning to classify, find anomalies, etc. for Wolfram model rules and evolutions. Ultimately, we want to be able to feed Wolfram model states…
-
```
Modular decomposition refers to the process of building a modular
decomposition tree. These can yield very interesting properties about
graphs (directed, undirected, and hypergraphs alike). Mo…
-
```
Hello!
Thanks, firstly for your work on python-graph. We're using hypergraphs to help
study discourse structure.
I was wondering if you would feel ready to upload your python-graph and
pytho…
-
Hi :)
I am trying to create hypergraphs with pretty huge hyperedge weights. As a consequence, when these get too large I get this error log:
```
ERROR: InexactError: trunc(Int32, 1099511627776)…
-
```
Hello!
Thanks, firstly for your work on python-graph. We're using hypergraphs to help
study discourse structure.
I was wondering if you would feel ready to upload your python-graph and
pytho…
-
### The problem
Have a `Hypergraph` symbol analogous to [`Graph`](http://reference.wolfram.com/language/ref/Graph.html), which will convert `Hypergraph[{hyperedges... }]` to a (hopefully) optimized s…