Representing and mining dynamical social networks in Neo4j

Interpretable AI pipeline improving binding predictions for novel protein targets and ligands

DITRAS (DIary-based TRAjectory Simulator), a mathematical model to simulate human mobility

Interpretable AI pipeline improving binding predictions for novel protein targets and ligands

Get ridge or die trying - 2 cents

This package is used to calculate the Strain Elevation Tension Spring embedding (SETSe) for networks in R

An R package for handling and manipulating multilayer network data, mainly for ecological networks

Ridge Estimation of Vector Auto-Regressive (VAR) Processes

Simulating and analyzing dynamical network models

Harry Potter Character Interaction Networks: Analyzing character relationships, evolution, and narrative dynamics in J.K. Rowling's wizarding world using network science techniques and data from the Harry Potter series. Explore the magic of storytelling through data.

This repository contains FDP'18 presentations and R scripts.

Barabási-Albert scale-free network model

Infomap State Network Visualizer

An effort to study information flow and belief propagation through ego networks.

Repository to share the codes used for the partition-based spread identification performed for the paper "An efficient Partition-Based Approach to Identify and Scatter Multiple Relevant Spreaders in Complex Networks".

This repository is associated with the manuscript: “Graph Ricci Curvatures Reveal Atypical Functional Connectivity in Autism Spectrum Disorder”

Source Code for the paper 'Dynamics of PA in Citation Networks'

A Toolkit for Generation and Analysis of Affiliation Networks

Network Science Theory Graphs illustrations

Clustering a low-level event log of a process involves creating groups of related events based on their commonalities. In this case, the centrality score of a process's graph can be used to determine the similarity between events and to guide the clustering process.