GitHub repository: k8hamilton/CodeSample1
Created: 2015-08-22T02:41:55Z
Description: includes a sample of code written by Dr. Kathleen Hamilton for numerical studies related to the problem of percolation on directed graphs.  It shows examples of: building an initial directed graph G0, with defined regions of connectivity; building  a random subgraph G1 finding the maximum connected components on it, and plotting their size as a  function of probability; and finally, illustrating the growth of connected components on the subgraph, compared to the original graph.