Recipes
- 1. Simplicial complex from pairwise data
- 2. Laplacian spectrum
- 3. Adjacency tensor
- 4. Create random hypergraph
- 5. Clean-up
- 6. Add two hypergraphs
- 7. Filterby
- 8. Plot a hypergraph showing one order only
- 9. Plot with stats
- 10. Merging multiedges
- 11. Degree distribution
- 12. Multilayer visualization of a hypergraph
- 13. Specifying the colours of hyperedges
- 14. Flag a triangular lattice
- 14. Compute the average path length in a hypergraph
- 16. Get all of the node IDs that have maximum degree
- 17. Get all the node IDs corresponding to the 100th largest degree
- 18. Define a custom filtering function