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

Knowledge-Graph-UI (KG-UI) is an open-source web-based user interface built for KGs stored in Neo4j. The UI features Cypher queries for viewing immediate neighbors as well as shortest paths between two entities. Additionally, the API can be extended to add other functions such as enrichment analysis, and specialized queries. Example implementation:

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.

Get ridge or die trying - 2 cents

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

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

Simulating and analyzing dynamical network models

Barabási-Albert scale-free network model

Ridge Estimation of Vector Auto-Regressive (VAR) Processes

This repository contains FDP'18 presentations and R scripts.

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

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

High Reconstructability of Degree-Heterogeneous Networks

Infomap State Network Visualizer

Visualizing multilayer networks in Gephi

A Toolkit for Generation and Analysis of Affiliation Networks

This helps you measure assortativity in real-world 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".

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.

This work composes Association Networks, Randomness Control, and synthetic data generation with simulation events.

This repository studies the pandemic spread on the flight network using network science techniques. It identifies key airports that are critical for controlling the spread of a disease and uses a spreading simulator to illustrate disease spread. The report aims to inform the design of effective intervention strategies for future outbreaks.

Analyzing conflicts using advanced computational techniques & network analysis on social media data (e.g., Twitter). Uncover patterns, actors, causes, & impacts. Gain insights for conflict resolution. Join our data-driven journey! 🚀"

Network Science Theory Graphs illustrations

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

Epidemic modeling using effective distances

No description provided.

general graph project