AntonioLonga / Egocentric-Temporal-Motifs-Miner-ETMMLinks
Egocentric Temporal Motifs Miner
☆12Updated 4 years ago
Alternatives and similar repositories for Egocentric-Temporal-Motifs-Miner-ETMM
Users that are interested in Egocentric-Temporal-Motifs-Miner-ETMM are comparing it to the libraries listed below
Sorting:
- ETNgen: A temporal graph generator based on Egocentric Temporal Motifs☆14Updated 2 years ago
- Probabilistic generative model for mixed-membership community detection in hypergraphs, that also allows to infer missing hyperedges of a…☆30Updated 2 years ago
- Code and data for the CIKM2021 paper "Learning Ideological Embeddings From Information Cascades"☆10Updated 4 years ago
- Code for the paper "Higher-order motif analysis in hypergraphs"☆33Updated 3 years ago
- GraphFramEx: a systematic evaluation framework for explainability methods on GNNs☆49Updated last year
- Probabilistic generative model and efficient algorithm to model reciprocity in directed networks.☆16Updated 2 years ago
- Official repository for On Over-Squashing in Message Passing Neural Networks (ICML 2023)☆16Updated 2 years ago
- DYnamic MOtif-NoDes (DYMOND) is a dynamic network generative model based on temporal motifs and node behavior.☆15Updated 2 years ago
- Collection of papers relating data-driven higher-order graph/networks researches.☆73Updated 3 years ago
- This repository holds code and other relevant files for the Learning on Graphs 2022 tutorial "Graph Rewiring: From Theory to Applications…☆54Updated 3 years ago
- Code for the KDD 2021 paper 'Filtration Curves for Graph Representation'☆18Updated 2 years ago
- Official repository of "On Positional and Structural Node Features for Graph Neural Networks on Non-attributed Graphs", CIKM 2022☆18Updated 3 years ago
- ☆86Updated 3 years ago
- MetA-Train to Explain☆18Updated 3 years ago
- Synthetic graph generator☆12Updated 2 years ago
- Code and dataset to test empirically the expressive power of graph pooling operators presented as presented at NeurIPS 2023☆36Updated 2 years ago
- The implementation code for our paper Wasserstein Embedding for Graph Learning (ICLR 2021).☆35Updated 4 years ago
- Software for "Configuration Models of Random Hypergraphs"☆29Updated 3 years ago
- ☆21Updated 4 years ago
- Optimal transport on Multilayer networks☆16Updated 11 months ago
- WWW22 - MiDaS: Representative Hypergraph Sampling☆13Updated last year
- ☆12Updated 3 years ago
- Code of "Analyzing the Expressive Power of Graph Neural Networks in a Spectral Perspective" paper published in ICLR2021☆46Updated 4 years ago
- ☆13Updated 4 years ago
- List of papers on NeurIPS2023☆90Updated 2 years ago
- Code accompanying the AAAI 2022 paper "fGOT: Graph Distances based on Filters and Optimal Transport"☆15Updated 3 years ago
- The official implementation of the Graph Barlow Twins method with the experimental pipeline☆31Updated 2 years ago
- Tutorial for the ScHoLP.jl library and reproducing results from the accompanying paper.☆43Updated 6 years ago
- ☆83Updated 2 years ago
- Simplicial neural network benchmarking software☆17Updated 3 years ago