-
I have a pairwise dataset with 634 nodes and 18624 edges.
I want to fill its empty triangles with probability p.
We have a function `flag_complex` that does exactly this, but it's slow: after runni…
-
implement the classical unitary (reps. symplectic) ordinary and dual polar graphs `U(n,q)` (resp. `Sp(2d,q)`), see
http://www.win.tue.nl/~aeb/graphs/srghub.html for the ordinary ones, and [BCN89] fo…
-
微博内容精选
-
I noticed some hypergraphs from the benchmark set provided on http://algo2.iti.kit.edu/schlag/sea2017/ contain nodes that have no hyperedges/nets associated with them. For example, the hypergraph “Mar…
JMian updated
2 years ago
-
You have developed an awesome package, but is this package able to handle directed weighted hypernetworks.Thanks a lot!
-
Add arc method in BalancedIncompleteBlockDesign.
CC: @videlec @nathanncohen
Component: **combinatorial designs**
Author: **Quentin Honoré, Vincent Delecroix**
Branch/Commit: **[`cbc952e`](http…
-
We frequently have need for what can be viewed as ternary or n-ary relationsips between >2 entities. Examples:
* gene correlated with gene (in a specific tissue) see #324
* chemical derived fro…
-
Implement way of collapsing identical elements. Right now, `IDView.duplicates()` simply chooses the lowest ID as the non-duplicate edge, but there are several ways of
- weighting the collapsed nodes/…
-
**Submitting author:** @nwlandry (Nicholas Landry)
**Repository:** https://github.com/ComplexGroupInteractions/xgi
**Branch with paper.md** (empty if default branch): paper
**Version:** v0.6
**Editor:…
-
I made the following diagram using Hypernetworkx's `draw` command.
The node `fst_s…