graph-notebooks

Stars
0

Network Notebooks


Intro:

These are a collection of notebooks explaing and coding solutions to some graph and network theory ideas. They're reasonably mathematically informal and I'm intending on focusing mostly on the algorithms.

Disclaimer: While the concepts I introduce here are I think correct, i'm definetly not known for being perfect. If you havppen to be reading and spot a mistake please let me know


Index:

  1. Random Walks on Gaphs: Introduces graph structure, transistion matricies, random walks, density/probability vectors, orbits and convergence
  2. Metropolis Hastings Algorithm: Numerical evidence Metropolis Hastings Random Walks converge to uniform distrubutions on graphs.

Setup:

You'll need python3. I'd advise setting the repo up in a virtual environment as so:

python3 -m venv venv
source venv/bin/activate
pip install --upgrade pip
pip install -r requirements.txt
jupyter notebook
Related Projects