Codes

You can find a complete list of open source codes on my github page.

• HGX: 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.

  

• BROT: extracts optimal trajectories on networks between origin-destination pairs by making a trade off between transportation efficiency and lower traffic on edges.

  

• Hy-MMSBM: sampling hypergraphs with desired community structure and inferring overlapping communities from hypergraphs with arbitrary hyperedges sizes and community structure.

  

• HyMT: extracts overlapping communities and predicts missing hyperedges in hypergraphs.

  

• DynSpringRank: extracts rankings from dynamical pairwise comparisons, i.e. changing in time.

  

• XOR: extracts overlapping communities and hierarchies from directed network.

  

• JointCRep: extracts overlapping communities from networks while capturing reciprocity with joint distributions on pairs of edges.

  

• MODI: performs supervised classification by finding multicommodty optimal transport paths between pairs of images.

  

• ORC-Nextrout: detects hard membership communities using optimal transport and Ollivier-Ricci curvature.

  

• N-STARK: extracts optimal flows from networks with time-varying loads via optimal transport theory.

  

• Vimure: infers networks from double-sample data

  

• DynCRep: extracts overlapping communities from networks while capturing reciprocity from time-varying networks.
• MultiOT: extracts optimal multi-commodity flows on multilayer networks via optimal transport theory

  

• Img2net: extracts networks from images using routing optimization.

  

• CRep: extracts overlapping communities from networks while capturing reciprocity.

  

• McOpt: extracts optimal multi-commodity flows from networks via optimal transport theory.

  

• MTCov: extracts overlapping communities from multilayer networks and node attributes.

  

• NextRout: extracts network topologies from solutions of routing optimization problems.

  

• TCEC: extracts a network sample to optimize for eigenvector centrality recovery.

  

• MultiTensor: extracts overlapping communities from multilayer networks.

  

• SpringRank: extracts rankings from pairwise comparisons.

  

• MPEDP: extracts optimal edge-disjoint path trajectories.

  

• MPEM: calculates Matrix Product State approximation for dynamical processes on networks.