-
HyperNetX released version 2.0.0.post1 on May 16. It contains some performance improvements, but also introduced breaking changes.
From their [GitHub repository](https://github.com/pnnl/HyperNetX):…
-
We need a way to deal with non-DAG structure. Currently, our code makes some heavy assumptions that we deal with DAGs only.
-
Good day sir,
how to create weighted directed hypergraph from hypernetx (code example).
Cordially,
Ghislain
-
Hello, thank you for sharing this excellent library.
I want to compare the performance of clustering on weighted and unweighted hypergraphs as described in K. Hayashi, S. Aksoy, C. Park, H. Park, "…
-
It would be cool to have a method for drawing hypergraphs/simplicial complexes in the style of Fig. 1 in [this paper](https://arxiv.org/abs/2104.05457).
-
`H_hypergraph` is a weighted hypergraph, with 9 nodes and only triangles. With this code I got a plot with all the nodes very close to each other in the center of the figure. Is there a way in which i…
-
Hello, thank you for your work and this repo. I have a curiosity about hypergraph construction procedure:
In the paper you have mentioned that you utilise approached proposed in `[HyperGCN: A New M…
-
As per #152, certain functions do not handle empty hypergraphs well. In fact, most of the library has been written without empty hypergraphs in mind. There are a few ways to address this.
1. Don't …
-
Given a model for random walkers on hypergraphs, one can define the **Kayz-centrality** of a node as the average fraction of walkers sitting on this node at equilibirum.
The simplest random walker …
-
Instead of using non-overlapping cells and hypergraphs as it is done currently, another approach is to use scaling cells and graphs to have a bisimulation.