Google # Hash Code 2018 Challenge
-
Updated
Sep 21, 2018 - Python
Google # Hash Code 2018 Challenge
Exploration of metropolis-hastings (local) and Uli Wolff (cluster) algorithms on the Ising Model
Rust library for setting up and running distributed Monte-Carlo statistical simulations. Designed primarily for lattice QCD.
A dystopian city-builder game, in the theme of the 1927 film by Fritz Lang
Monte Carlo sampling and integration methods for high energy physics.
Ising model implementation in Python. Metropolis and Swendsen Wang algorithm.
A dark-color custom theme for the LaTeX Metropolis beamer package using LuaLaTeX
Quarto reveal.js template extension inspired by Metropolis theme
Metropolis consists of a suite of game developer tools that allows for easy integration to best suit your game and user experience.
Parallel Metropolis-Hastings Markov chain Monte Carlo toolkit
a presentation using LaTeX beamer in Peking University
Metropolis generator for Raku language. Generate sequence of random samples from probability distribution function.
An implementation of the BUGS example LSAT: item response (http://www.openbugs.net/Examples/Lsat.html) on R. Parameters for the Rasch model are estimated using Maximum Marginal Likelihood as well as Bayesian Inference using jags and an implementation of Metropolis on R.
Generate a dot painting from a photo by using the Metropolis algorithm
Spontaneous symmetry breaking
This package provides an implementation of the Metropolis algorithm for simulating spin configurations.
Add a description, image, and links to the metropolis topic page so that developers can more easily learn about it.
To associate your repository with the metropolis topic, visit your repo's landing page and select "manage topics."