You can find a complete list of open source codes on my
: Python library for the analysis of complex systems with group interactions and provides a comprehensive suite of tools and algorithms for constructing, visualizing, and analyzing hypergraphs.
: extracts optimal trajectories on networks between origin-destination pairs by making a trade off between transportation efficiency and lower traffic on edges.
: sampling hypergraphs with desired community structure and inferring overlapping communities from hypergraphs with arbitrary hyperedges sizes and community structure.
: extracts overlapping communities and predicts missing hyperedges in hypergraphs.
: extracts rankings from dynamical pairwise comparisons, i.e. changing in time.
: extracts overlapping communities and hierarchies from directed network.
: extracts overlapping communities from networks while capturing reciprocity with joint distributions on pairs of edges.
: performs supervised classification by finding multicommodty optimal transport paths between pairs of images.
: detects hard membership communities using optimal transport and Ollivier-Ricci curvature.
: extracts optimal flows from networks with time-varying loads via optimal transport theory.
: infers networks from double-sample data
: extracts overlapping communities from networks while capturing reciprocity from time-varying networks.
: extracts optimal multi-commodity flows on multilayer networks via optimal transport theory
: extracts networks from images using routing optimization.
: extracts overlapping communities from networks while capturing reciprocity.
: extracts optimal multi-commodity flows from networks via optimal transport theory.
: extracts overlapping communities from multilayer networks and node attributes.
: extracts network topologies from solutions of routing optimization problems.
: extracts a network sample to optimize for eigenvector centrality recovery.
: extracts overlapping communities from multilayer networks.
: extracts rankings from pairwise comparisons.
: extracts optimal edge-disjoint path trajectories.
: calculates Matrix Product State approximation for dynamical processes on networks.