-
# 🐛 Bug
I have a self defined kernel: basically a exponential kernel but operated in the eigenspace.
## To reproduce
** Code snippet to reproduce **
```python
class EdgeDiffusionKernelOc…
-
### Steps To Reproduce
```
sage -t --random-seed=324850534885798131910668214652534087473 src/sage/graphs/generic_graph.py
**********************************************************************
Fil…
-
**Submitting author:** @jcorbino (Johnny Corbino)
**Repository:** https://github.com/jcorbino/mole
**Branch with paper.md** (empty if default branch):
**Version:** v3.0
**Editor:** @jedbrown
**Review…
-
## Example that fails
```python
from gudhi import SimplexTree as STree
import numpy as np
st.insert_batch(np.array([[6, 1, 5]]), np.array([4.0, 4.0, 4.0]))
list(st.get_simplices())
# [([1], 4.…
-
Running
```python
S = xgi.random_simplicial_complex(10, [0.05, 0.01], seed=1) # non-empty SC
H = xgi.Hypergraph(S) # convert SC to HG
```
yields an empty Hypergraph: no nodes and no edges.
…
-
In Julia 1.9.1 I ran the code below with the library LinearSolve.jl v2.3.0:
```
using SparseArrays, LinearSolve
n, s = 5*10^4, 20; A, b = sprand(n,n,s/n), sprand(n,s/n);
@time (x = Array(A) \ …
-
https://github.com/arnaudon/simplicial-kuramoto
-
I tried to call the `SimplicialComplex.incidence_matrix` (rank 2) on the shrec dataset using the code below
``` python
import toponetx.datasets as datasets
shrec, _ = datasets.mesh.shrec_16(s…
-
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).
-
The function would input a hypergraph, extract the maximal faces, and initialize a SimplicialComplex with these maximal faces.