clelidm Goto Github PK

binarydata_highorderinteractions_greedyalgo

This algorithm performs a greedy search to find the most relevant patterns of binary data. Uncovered patterns can be of any order.

genbindat_wcorr

Generate Binary Data with a chosen values of correlation between the variables

mincompspin_basissearch128

This program searches for the Best Basis representation for a chosen binary dataset

mincompspin_basissearch64

This program searches for the Best Basis representation for a chosen binary dataset

mincompspin_exhaustivesearch

Exhaustive search for the best Minimally Complex spin Model: "community detection" in binary data.

mincompspin_greedy

Greedy search for the best Minimally Complex spin Model: "community detection" in binary data.

mincompspin_simulatedannealing

Simulated annealing algorithm for detecting community structure in binary data

modelselection_montecarlo_subcompletespinmodels

This Monte Carlo simulation finds the best sub-complete model with m independent variables in a system of n random variables (with n > m). For this purpose, it travels through the class of equivalence of these models by performing gauge transformations on the dataset and selects the model with the largest maximum log-likelihood.

multiagents_v2016

Emergence of property rights in a multi-agent system

programmingpython-uva

This repository contains the Python part of the course "Programming in Mathematica and Python"

random

random MCMs

spike-gan

Tensorflow implementation of Spike-GAN.

spinmodels

Set of basic programs to generate data and fit data with spin models with high order interactions.

tcs_course

theory-of-complex-systems-uva