A distributed graph deep learning framework.

Practical volume computation and sampling in high dimensions

A general-purpose, distributed graph random walk engine.

🦜 DISCOTRESS 🦜 is a software package to simulate and analyse the dynamics on arbitrary Markov chains

Different Implementations of 2D Procedural Maps

2D and 3D wormlike chain generator for Python and written in C++

Personalized PageRank (PPR) on GraphLab PowerGraph

Local Community Detection in Multiple Netwrks

ARROW: Approximating Reachability using Random walks Over Web scale graphs

MCMC sampling algorithms for linear inverse models in R

Random Walk simulation using C++ and SFML

Justin Ventura & Jacob Duncan Knight Random Walk Simulation

Modelling continuous-time random walks on fractals

This project is an implementation of the Adaptive Power Method (APM). It simulates a random walk on an Erdős-Rényi random graph to compute the scaled culumant generating function (SCGF) and rate function of the mean degree a time additive observable.

Construct polymer chains using Self Avoiding Random Walk

A framework for procedural content generation with C++20

Infinite number of random walks on a large graph simulation using MPI

📓 Simulation exercises access point for result extraction which can be used in modeling and theoretical approach of molecular and atomic processes.